Duck face or duck lips is a photographic pose that is common on profile pictures in social networks. The lips are pressed together as in a pout and the cheeks are typically also sucked in. The pose is usually seen as an attempt to appear alluring, but it can be ironic or an attempt to hide self-conscious embarrassment. == History == Fashion models frequently use exaggerated pouts, and self-portraits with a pouty face go back to Rembrandt. In the 1994 film Four Weddings and a Funeral, one of the lead characters, Henrietta, played by Anna Chancellor, is nicknamed Duckface for her pouty expressions. Ben Stiller mocked models' pouty expressions in 1996 comedy sketches and the 2001 feature film Zoolander. The silly expressions made by his narcissistic character have retroactively been identified as an example of duck face. As social networks became popular, young women frequently made exaggeratedly pouty expressions. This became a major fad by the 2010s, provoking a strong negative reaction among some viewers. OxfordDictionaries.com added "duck face" as a new word in 2014 to their list of current and modern words, but it has not been added to the Oxford English Dictionary. In an animal communication studies of capuchin monkeys, the "duck face" term has been used synonymously with "protruded lip face", which females exhibit in the proceptive phase before mating.
Collision detection
Collision detection is the computational problem of detecting an intersection of two or more objects in virtual space. More precisely, it deals with the questions of if, when, and where two or more objects intersect. Collision detection is a classic problem of computational geometry with applications in computer graphics, physical simulation, video games, robotics (including autonomous driving), and computational physics. Collision detection algorithms can be divided into operating on 2D or 3D spatial objects. == Overview == Collision detection is closely linked to calculating the distance between objects, as objects collide when the distance between them is less than or equal to zero. Negative distances indicate that one object has penetrated another. Performing collision detection requires more context than just the distance between the objects. Accurately identifying the points of contact on both objects' surfaces is also essential for computing a physically accurate collision response. The complexity of this task increases with the level of detail in the objects' representations: the more intricate the model, the greater the computational cost. Collision detection frequently involves dynamic objects, adding a temporal dimension to distance calculations. Instead of simply measuring distance between static objects, collision detection algorithms often aim to determine whether the objects' motion will bring them to a point in time when their distance is zero—an operation that adds significant computational overhead. In collision detection involving multiple objects, a naive approach would require detecting collisions for all pairwise combinations of objects. As the number of objects increases, the number of required comparisons grows rapidly: for n {\displaystyle n} objects, n ( n − 1 ) / 2 {n(n-1)}/{2} intersection tests are needed with a naive approach. This quadratic growth makes such an approach computationally expensive as n {\displaystyle n} increases. Due to the complexity mentioned above, collision detection is a computationally intensive process. Nevertheless, it is essential for interactive applications like video games, robotics, and real-time physics engines. To manage these computational demands, extensive efforts have gone into optimizing collision detection algorithms. A commonly used approach towards accelerating the required computations is to divide the process into two phases: the broad phase and the narrow phase. The broad phase aims to answer the question of whether objects might collide, using a conservative but efficient approach to rule out pairs that clearly do not intersect, thus avoiding unnecessary calculations. Objects that cannot be definitively separated in the broad phase are passed to the narrow phase. Here, more precise algorithms determine whether these objects actually intersect. If they do, the narrow phase often calculates the exact time and location of the intersection. == Broad phase == This phase aims at quickly finding objects or parts of objects for which it can be quickly determined that no further collision test is needed. A useful property of such approach is that it is output sensitive. In the context of collision detection this means that the time complexity of the collision detection is proportional to the number of objects that are close to each other. An early example of that is the I-COLLIDE where the number of required narrow phase collision tests was O ( n + m ) {\displaystyle O(n+m)} where n {\displaystyle n} is the number of objects and m {\displaystyle m} is the number of objects at close proximity. This is a significant improvement over the quadratic complexity of the naive approach. === Spatial partitioning === Several approaches can be grouped under the spatial partitioning umbrella, which includes octrees (for 3D), quadtrees (for 2D), binary space partitioning (or BSP trees) and other, similar approaches. If one splits space into a number of simple cells, and if two objects can be shown not to be in the same cell, then they need not be checked for intersection. Dynamic scenes and deformable objects require updating the partitioning which can add overhead. === Bounding volume hierarchy === Bounding Volume Hierarchy (BVH) is a tree structure over a set of bounding volumes. Collision is determined by doing a tree traversal starting from the root. If the bounding volume of the root doesn't intersect with the object of interest, the traversal can be stopped. If, however there is an intersection, the traversal proceeds and checks the branches for each there is an intersection. Branches for which there is no intersection with the bounding volume can be culled from further intersection test. Therefore, multiple objects can be determined to not intersect at once. BVH can be used with deformable objects such as cloth or soft-bodies but the volume hierarchy has to be adjusted as the shape deforms. For deformable objects we need to be concerned about self-collisions or self intersections. BVH can be used for that end as well. Collision between two objects is computed by computing intersection between the bounding volumes of the root of the tree as there are collision we dive into the sub-trees that intersect. Exact collisions between the actual objects, or its parts (often triangles of a triangle mesh) need to be computed only between intersecting leaves. The same approach works for pair wise collision and self-collisions. === Exploiting temporal coherence === During the broad-phase, when the objects in the world move or deform, the data-structures used to cull collisions have to be updated. In cases where the changes between two frames or time-steps are small and the objects can be approximated well with axis-aligned bounding boxes, the sweep and prune algorithm can be a suitable approach. Several key observation make the implementation efficient: Two bounding-boxes intersect if, and only if, there is overlap along all three axes; overlap can be determined, for each axis separately, by sorting the intervals for all the boxes; and lastly, between two frames updates are typically small (making sorting algorithms optimized for almost-sorted lists suitable for this application). The algorithm keeps track of currently intersecting boxes, and as objects move, re-sorting the intervals helps keep track of the status. === Pairwise pruning === Once a pair of physical bodies has been selected for further investigation, collisions need to be checked more carefully. However, in many applications, individual objects (if they are not too deformable) are described by a set of smaller primitives, mainly triangles. So there are two sets of triangles, S = S 1 , S 2 , … , S n {\displaystyle S={S_{1},S_{2},\dots ,S_{n}}} and T = T 1 , T 2 , … , T n {\displaystyle T={T_{1},T_{2},\dots ,T_{n}}} (for simplicity, each set has the same number of triangles.) The obvious thing to do is to check all triangles S j {\displaystyle S_{j}} against all triangles T k {\displaystyle T_{k}} for collisions, but this involves n 2 {\displaystyle n^{2}} comparisons, which is highly inefficient. If possible, it is desirable to use a pruning algorithm to reduce the number of pairs of triangles that need to be checked. The most widely used family of algorithms is known as the hierarchical bounding volumes method. As a preprocessing step, for each object (e.g., S {\displaystyle S} and T {\displaystyle T} ) calculates a hierarchy of bounding volumes. Then, at each time step, when collisions need to be checked between S {\displaystyle S} and T {\displaystyle T} , the hierarchical bounding volumes are used to reduce the number of pairs of triangles under consideration. For simplicity, provide an example using bounding spheres, although it has been noted that spheres are undesirable in many cases. If E {\displaystyle E} is a set of triangles, a bounding sphere is pre-calculated. B ( E ) {\displaystyle B(E)} . There are many ways of choosing B ( E ) {\displaystyle B(E)} , B ( E ) {\displaystyle B(E)} is a sphere that completely contains E {\displaystyle E} and is as small as possible. Ahead of time, B ( S ) {\displaystyle B(S)} and B ( T ) {\displaystyle B(T)} can be computed. Clearly, if these two spheres do not intersect (and that is very easy to test), then neither do S {\displaystyle S} and T {\displaystyle T} . This is not much better than an n-body pruning algorithm, however. If E = E 1 , E 2 , … , E m {\displaystyle E={E_{1},E_{2},\dots ,E_{m}}} is a set of triangles, then split it into two halves L ( E ) := E 1 , E 2 , … , E m / 2 {\displaystyle L(E):={E_{1},E_{2},\dots ,E_{m/2}}} and R ( E ) := E m / 2 + 1 , … , E m − 1 , E m {\displaystyle R(E):={E_{m/2+1},\dots ,E_{m-1},E_{m}}} . Apply this to S {\displaystyle S} and T {\displaystyle T} , and calculate (ahead of time) the bounding spheres B ( L ( S ) ) , B ( R ( S ) ) {\displaystyle B(L(S)),B(R(S))} and B ( L ( T ) ) , B ( R ( T ) ) {\displaystyle B(L(T)),B(R(T))} . T
Digital citizen
The term digital citizen is used with different meanings. According to the definition provided by Karen Mossberger, one of the authors of Digital Citizenship: The Internet, Society, and Participation, digital citizens are "those who use the internet regularly and effectively". In this sense, a digital citizen is a person who uses information technology (IT) to engage in society, politics, and government. More recent elaborations of the concept define digital citizenship as the self-enactment of people’s role in society through the use of digital technologies, stressing the empowering and democratizing characteristics of the citizenship idea. These theories aim at taking into account the ever-increasing datafication of contemporary societies (symbolically linked to the Snowden leaks), which has called into question the meaning of “being (digital) citizens in a datafied society”. This condition is also referred to as the “algorithmic society”, characterised by the increasing datafication of social life and the pervasive presence of surveillance practices – see surveillance and surveillance capitalism, the use of artificial intelligence, and Big Data. Datafication presents crucial challenges for the very notion of citizenship, so that data collection can no longer be seen as an issue of privacy alone so that:We cannot simply assume that being a citizen online already means something (whether it is the ability to participate or the ability to stay safe) and then look for those whose conduct conforms to this meaning Instead, the idea of digital citizenship shall reflect the idea that we are no longer mere “users” of technologies since they shape our agency both as individuals and as citizens. Digital citizenship refers to the responsible and respectful use of technology to engage online, evaluate information, and protect human rights. It encompasses skills for communication, collaboration, empathy, privacy protection, and security to prevent data breaches and identity theft. == Digital citizenship in the "algorithmic society" == In the context of the algorithmic society, the question of digital citizenship "becomes one of the extents to which subjects are able to challenge, avoid or mediate their data double in this datafied society”. These reflections put the emphasis on the idea of the digital space (or cyberspace) as a political space where the respect of fundamental rights of the individual shall be granted (with reference both to the traditional ones as well as to new specific rights of the internet [see “digital constitutionalism”]) and where the agency and the identity of the individuals as citizens is at stake. This idea of digital citizenship is thought to be not only active but also performative, in the sense that “in societies that are increasingly mediated through digital technologies, digital acts become important means through which citizens create, enact and perform their role in society.” In particular, for Isin and Ruppert this points towards an active meaning of (digital) citizenship based on the idea that we constitute ourselves as digital citizen by claiming rights on the internet, either by saying or by doing something. == Types of digital participation == People who characterize themselves as digital citizens often use IT extensively—creating blogs, using social networks, and participating in online journalism. Although digital citizenship begins when any child, teen, or adult signs up for an email address, posts pictures online, uses e-commerce to buy merchandise online, and/or participates in any electronic function that is B2B or B2C, the process of becoming a digital citizen goes beyond simple internet activity. According to Thomas Humphrey Marshall, a British sociologist known for his work on social citizenship, a primary framework of citizenship comprises three different traditions: liberalism, republicanism, and ascriptive hierarchy. Within this framework, the digital citizen needs to exist in order to promote equal economic opportunities and increase political participation. In this way, digital technology helps to lower the barriers to entry for participation as a citizen within a society. They also have a comprehensive understanding of digital citizenship, which is the appropriate and responsible behavior when using technology. Since digital citizenship evaluates the quality of an individual's response to membership in a digital community, it often requires the participation of all community members, both visible and those who are less visible. A large part in being a responsible digital citizen encompasses digital literacy, etiquette, online safety, and an acknowledgement of private versus public information. The development of digital citizen participation can be divided into two main stages. The first stage is through information dissemination, which includes subcategories of its own: static information dissemination, characterized largely by citizens who use read-only websites where they take control of data from credible sources in order to formulate judgments or facts. Many of these websites where credible information may be found are provided by the government. dynamic information dissemination, which is more interactive and involves citizens as well as public servants. Both questions and answers can be communicated, and citizens have the opportunity to engage in question-and-answer dialogues through two-way communication platforms The second stage of digital citizen participation is citizen deliberation, which evaluates what type of participation and role that they play when attempting to ignite some sort of policy change. static citizen participants can play a role by engaging in online polls as well as through complaints and recommendations sent up, mainly toward the government who can create changes in policy decisions. dynamic citizen participants can deliberate amongst others on their thoughts and recommendations in town hall meetings or various media sites. One potential advantage of online participation through digital citizenship is increased social inclusion. In a report on civic engagement, citizen-powered democracy can be initiated either through information shared through the web, direct communication signals made by the state toward the public, and social media tactics from both private and public companies. In fact, it was found that the community-based nature of social media platforms allow individuals to feel more socially included and informed about political issues that peers have also been found to engage with, otherwise known as a "second-order effect." Understanding strategic marketing on social media would further explain social media customers’ participation. Two types of opportunities rise as a result, the first being the ability to lower barriers that can make exchanges much easier. In addition, they have the chance to participate in transformative disruption, giving people who have a historically lower political engagement to mobilize in a much easier and convenient fashion. Nonetheless, there are several challenges that face the presence of digital technologies in political participation. Both current as well as potential challenges can create significant risks for democratic processes. Not only is digital technology still seen as relatively ambiguous, it was also seen to have "less inclusivity in democratic life." Demographic groups differ considerably in the use of technology, and thus, one group could potentially be more represented than another as a result of digital participation. Another primary challenge consists in the ideology of a "filter bubble" effect. Alongside a tremendous spread of false information, internet users could reinforce existing prejudices and assist in polarizing disagreements in the public sphere. This can lead to misinformed voting and decisions based on exposure rather than on pure knowledge. A communication technology director, Van Dijk, stated, "Computerized information campaigns and mass public information systems have to be designed and supported in such a way that they help to narrow the gap between the 'information rich' and 'information poor' otherwise the spontaneous development of ICT will widen it." Access and equivalent amounts of knowledge behind digital technology must be equivalent in order for a fair system to put into place. Alongside a lack of evidenced support for technology that can be proven to be safe for citizens, the OECD has identified five struggles for the online engagement of citizens: Scale: To what extent can a society allow every individual's voice to be heard, but also not be lost in the mass debate? This can be extremely challenging for the government, which may not effectively know how to listen and respond to each individual contribution. Capacity: How can digital technology offer citizens more information on public policy-making? The opportunity for citizens to debate with one another is lacking for acti
Conversion path
A conversion path is a description of the steps taken by a user of a website towards a desired end from the standpoint of the website operator or marketer. The typical conversion path begins with a user arriving at a landing page or a product page and proceeding through a series of page transitions until reaching a final state, either positive (e.g. purchase) or negative (e.g. abandoned session). In practice, the study of the dynamics of this process by the interested party has evolved into a sophisticated field, where various statistical methods are being applied to the optimization of outcomes. This includes real-time adjustment of presented content, in which a website operator tries to provide deliberate incentives to increase the odds of conversion based on various sources of information, including demographic traits, search history, and browsing events. In practice, this reflects in different content presented to users arriving from online advertising versus search engines, and similarly, different content is presented depending on their demographic segments. The fundamental metric describing this process in the aggregate is known as conversion rate.
Line splice
In electrical engineering and telecommunications, a line splice is a joint directly connecting lengths of electrical cables (electrical splice) or optical fibers (optical splice). The splices are often protected by sleeves. == Splicing of copper wires == The splicing of copper wires happens in the following steps: The cores are laid one above the other at the junction. The core insulation is removed. The wires are wrapped two to three times around each other (twisting). The bare veins on a length of about 3 cm "strangle" or "twist". In some cases, the strangulation is soldered. To isolate the splice, an insulating sleeve made of paper or plastic is pushed over it. The splicing of copper wires is mainly used on paper insulated wires. LSA techniques (LSA: soldering, screwing and stripping free) are used to connect copper wires, making the copper wires faster and easier to connect. LSA techniques include: Wire connection sleeves (AVH = Adernverbindungshülsen) and other crimp connectors. The two wires to be connected are inserted into the AVH without being stripped, which is then compressed with special pliers. The about 2 cm long AVH consist of contact, pressure and insulation. For wire connection strips (AVL = Adernverbindungsleisten) several pairs of wires (10 = AVL10 or 20 = AVL20) are inserted, the strip is then closed with a lid and pressed together with a hydraulic press, which ensures the connection. == Splicing of glass fibers == Fiber-optic cables are spliced using a special arc-splicer, with installation cables connected at their ends to respective "pigtails" - short individual fibers with fiber-optic connectors at one end. The splicer precisely adjusts the light-guiding cores of the two ends of the glass fibers to be spliced. The adjustment is done fully automatically in modern devices, whereas in older models this is carried out manually by means of micrometer screws and microscope. An experienced splicer can precisely position the fiber ends within a few seconds. Subsequently, the fibers are fused together (welded) with an electric arc. Since no additional material is added, such as gas welding or soldering, this is called a "fusion splice". Depending on the quality of the splicing process, attenuation values at the splice points are achieved by 0.3 dB, with good splices also below 0.02 dB. For newer generation devices, alignment is done automatically by motors. Here one differentiates core and jacket centering. At core centering (usually single-mode fibers), the fiber cores are aligned. A possible core offset with respect to the jacket is corrected. In the jacket centering (usually in multimode fibers), the fibers are adjusted to each other by means of electronic image processing in front of the splice. When working with good equipment, the damping value is according to experience at max. 0.1 dB. Measurements are made by means of special measuring devices including optical time-domain reflectometry (OTDR). A good splice should have an attenuation of less than 0.3 dB over the entire distance. Finished fiber optic splices are housed in splice boxes. One differentiates: Fusion splice Adhesive splicing Crimp splice or NENP (no-epoxy no-polish), mechanical splice
Framebuffer
A framebuffer (frame buffer, or sometimes framestore) is a portion of random-access memory (RAM) containing a bitmap that drives a video display. It is a memory buffer containing data representing all the pixels in a complete video frame. Modern video cards contain framebuffer circuitry in their cores. This circuitry converts an in-memory bitmap into a video signal that can be displayed on a computer monitor. In computing, a screen buffer is a part of computer memory used by a computer application for the representation of the content to be shown on the computer display. The screen buffer may also be called the video buffer, the regeneration buffer, or regen buffer for short. The phrase "screen buffer” refers to a logical function, while video memory refers to a hardware storage location. In particular, the screen buffer may be placed in the main RAM, the video memory, or some other hardware location. To reduce latency and avoid screen tearing, multiple frames can be buffered, and this technique is called multiple buffering. When this is so, at any time, only one frame would be visible, and the others would not be. The currently invisible frames are located in the off-screen buffer. The information in the buffer typically consists of color values for every pixel to be shown on the display. Color values are commonly stored in 1-bit binary (monochrome), 4-bit palettized, 8-bit palettized, 16-bit high color and 24-bit true color formats. An additional alpha channel is sometimes used to retain information about pixel transparency. The total amount of memory required for the framebuffer depends on the resolution of the output signal, and on the color depth or palette size. == History == Computer researchers had long discussed the theoretical advantages of a framebuffer but were unable to produce a machine with sufficient memory at an economically practicable cost. In 1947, the Manchester Baby computer used a Williams tube, later the Williams-Kilburn tube, to store 1024 bits on a cathode-ray tube (CRT) memory and displayed on a second CRT. Other research labs were exploring these techniques with MIT Lincoln Laboratory achieving a 4096 display in 1950. A color-scanned display was implemented in the late 1960s, called the Brookhaven RAster Display (BRAD), which used a drum memory and a television monitor. In 1969, A. Michael Noll of Bell Telephone Laboratories, Inc. implemented a scanned display with a frame buffer, using magnetic-core memory. A year or so later, the Bell Labs system was expanded to display an image with a color depth of three bits on a standard color TV monitor. The vector graphics used in the computer had to be converted for the scanned graphics of a TV display. In the early 1970s, the development of MOS memory (metal–oxide–semiconductor memory) integrated-circuit chips, particularly high-density DRAM (dynamic random-access memory) chips with at least 1 kb memory, made it practical to create, for the first time, a digital memory system with framebuffers capable of holding a standard video image. This led to the development of the SuperPaint system by Richard Shoup at Xerox PARC in 1972. Shoup was able to use the SuperPaint framebuffer to create an early digital video-capture system. By synchronizing the output signal to the input signal, Shoup was able to overwrite each pixel of data as it shifted in. Shoup also experimented with modifying the output signal using color tables. These color tables allowed the SuperPaint system to produce a wide variety of colors outside the range of the limited 8-bit data it contained. This scheme would later become commonplace in computer framebuffers. In 1974, Evans & Sutherland released the first commercial framebuffer, the Picture System, costing about $15,000. It was capable of producing resolutions of up to 512 by 512 pixels in 8-bit grayscale, and became a boon for graphics researchers who did not have the resources to build their own framebuffer. The New York Institute of Technology would later create the first 24-bit color system using three of the Evans & Sutherland framebuffers. Each framebuffer was connected to an RGB color output (one for red, one for green and one for blue), with a Digital Equipment Corporation PDP 11/04 minicomputer controlling the three devices as one. In 1975, the UK company Quantel produced the first commercial full-color broadcast framebuffer, the Quantel DFS 3000. It was first used in TV coverage of the 1976 Montreal Olympics to generate a picture-in-picture inset of the Olympic flaming torch while the rest of the picture featured the runner entering the stadium. The rapid improvement of integrated-circuit technology made it possible for many of the home computers of the late 1970s to contain low-color-depth framebuffers. Today, nearly all computers with graphical capabilities utilize a framebuffer for generating the video signal. Amiga computers, created in the 1980s, featured special design attention to graphics performance and included a unique Hold-And-Modify framebuffer capable of displaying 4096 colors. Framebuffers also became popular in high-end workstations and arcade system boards throughout the 1980s. SGI, Sun Microsystems, HP, DEC and IBM all released framebuffers for their workstation computers in this period. These framebuffers were usually of a much higher quality than could be found in most home computers, and were regularly used in television, printing, computer modeling and 3D graphics. Framebuffers were also used by Sega for its high-end arcade boards, which were also of a higher quality than on home computers. == Display modes == Framebuffers used in personal and home computing often had sets of defined modes under which the framebuffer can operate. These modes reconfigure the hardware to output different resolutions, color depths, memory layouts and refresh rate timings. In the world of Unix machines and operating systems, such conveniences were usually eschewed in favor of directly manipulating the hardware settings. This manipulation was far more flexible in that any resolution, color depth and refresh rate was attainable – limited only by the memory available to the framebuffer. An unfortunate side-effect of this method was that the display device could be driven beyond its capabilities. In some cases, this resulted in hardware damage to the display. More commonly, it simply produced garbled and unusable output. Modern CRT monitors fix this problem through the introduction of protection circuitry. When the display mode is changed, the monitor attempts to obtain a signal lock on the new refresh frequency. If the monitor is unable to obtain a signal lock or if the signal is outside the range of its design limitations, the monitor will ignore the framebuffer signal and possibly present the user with an error message. LCD monitors tend to contain similar protection circuitry, but for different reasons. Since the LCD must digitally sample the display signal (thereby emulating an electron beam), any signal that is out of range cannot be physically displayed on the monitor. == Color palette == Framebuffers have traditionally supported a wide variety of color modes. Due to the expense of memory, most early framebuffers used 1-bit (2 colors per pixel), 2-bit (4 colors), 4-bit (16 colors) or 8-bit (256 colors) color depths. The problem with such small color depths is that a full range of colors cannot be produced. The solution to this problem was indexed color, which adds a lookup table to the framebuffer. Each color stored in framebuffer memory acts as a color index. The lookup table serves as a palette with a limited number of different colors, while the rest is used as an index table. Here is a typical indexed 256-color image and its own palette (shown as a rectangle of swatches): In some designs, it was also possible to write data to the lookup table (or switch between existing palettes) on the fly, allowing dividing the picture into horizontal bars with their own palette and thus rendering an image that had a far wider palette. For example, viewing an outdoor shot photograph, the picture could be divided into four bars: the top one with emphasis on sky tones, the next with foliage tones, the next with skin and clothing tones, and the bottom one with ground colors. This required each palette to have overlapping colors, but, carefully done, allowed great flexibility. == Memory access == While framebuffers are commonly accessed via a memory mapping directly to the CPU memory space, this is not the only method by which they may be accessed. Framebuffers have varied widely in the methods used to access memory. Some of the most common are: Mapping the entire framebuffer to a given memory range. Port commands to set each pixel, range of pixels or palette entry. Mapping a memory range smaller than the framebuffer memory, then bank switching as necessary. The framebuffer organization may be packed pixel or planar. The framebuffer may be all
Festival of International Virtual & Augmented Reality Stories
Festival of International Virtual & Augmented Reality Stories (FIVARS) is a Canadian media festival for story-driven works using extended reality (XR) and immersive media, including virtual reality, augmented reality, WebXR, live VR performance, projection mapping and spatialized audio. Founded in Toronto in 2015, it has been described as Canada's first dedicated virtual and augmented reality stories festival, the first Canadian festival of its kind, and Canada's original festival dedicated to immersive storytelling. FIVARS has described itself as "the original and longest-running festival wholly dedicated to Virtual and Augmented Reality Stories", while third-party XR coverage has called it one of the longest-running events dedicated to immersive content. FIVARS is produced by Constant Change Media Group, Inc., with its partner event VRTO. == History == FIVARS began in 2015, with preview screenings at the Camp Wavelength music festival on Toronto Island and an inaugural festival held in Toronto in September 2015. Contemporary coverage described the first edition as a virtual reality film festival held at UG3 Live in Toronto. The festival continued with a second edition in 2016. L'Express described the 2016 festival as presenting Canadian and international interactive works in virtual and augmented reality narrative forms. FIVARS's 2016 festival was also listed in a York University Future Cinema course page as a public event students could attend. In 2017, the third annual FIVARS festival was held at the House of VR in Toronto. In 2018, the festival was held at the Matador Ballroom, which NOW Magazine reported was reopening for FIVARS from September 14 to 16. The festival's own history states that the 2018 edition included 36 works from 12 countries and that Stephanie Greenall took over as co-producer that year. In 2019, FIVARS moved to the Toronto Media Arts Centre for its fifth anniversary and listed official selections in passive and interactive immersive-experience categories. The festival also held talks and panels at the Toronto Media Arts Centre. During the COVID-19 pandemic, FIVARS moved part of its programming online. In 2020, Voices of VR reported that Malicki-Sanchez and WebXR developer James Baicoianu used JanusXR code to create a platform for presenting 360-degree video through the web. The festival's history states that its 2020 online festival included 39 selections from 16 countries and was produced by Malicki-Sanchez and Greenall. In 2021, FIVARS introduced a dual-event structure with FIVARS in FEB and FIVARS in FALL. The fall 2021 edition used a hybrid format, with an in-person component in West Hollywood from October 15 to 17 and an online WebXR component from October 22 to November 2. In 2022, FIVARS held hybrid programming with pop-up viewing locations in Los Angeles and Toronto. The fall 2022 edition was listed by blogTO as the festival's tenth edition, with an in-person component at Stackt - an outdoor arts park built from shipping containers in Toronto and online programming. The 2023 festival was presented as a hybrid exhibition of 65 immersive stories, with an in-person Toronto component and an online component. The FIVARS Online Festival was later listed among the Innovator of the Year nominees for the 2024 Poly Awards. FIVARS stated that the nominees for that recognition were producer and designer Keram Malicki-Sanchez and developer James Baicoianu. The 2024 edition was listed as FIVARS 2024 (Toronto + Online), with an in-person Toronto event from October 3 to 8 and an online component beginning October 10. The festival also published a 2024 official selections list covering virtual reality, augmented reality, spherical video, spatial web and related immersive formats. In 2025, FIVARS and VRTO were held together at OCAD University. The 2026 edition is scheduled for June 15 to 19, 2026, at OCAD University in Toronto, with OCAD University as presenting sponsor and first-time venue host. FIVARS has featured official selections from more than forty countries across six continents. == Organization == FIVARS was founded in 2015 by Keram Malicki-Sánchez. Joseph Ellsworth was the festival's original technical director and helped operate FIVARS during its early years. Malicki-Sánchez remains executive director and festival director. Jessy Blaze joined Malicki-Sánchez as co-producer in 2016 and served until Stephanie Greenall took over the role in 2018. Greenall served as co-producer and associate producer from 2018 to 2022. Aimee Reynolds took over from Greenall in 2022 and has served as associate producer of FIVARS and VRTO since 2022. == Immersive Media Awards == FIVARS presents People's Choice awards for interactive works and immersive video or passive immersive works. Juried award categories have included the Grand Jury Prize, Impact Award, Technical Achievement, Excellence in Experience Design, Excellence in Visual Design, Excellence in Sound Design, and Outstanding Performance. === 2015 === On Monday, September 21, the festival announced People's Choice awards for two categories at the Cadillac Lounge, a music venue and restaurant in Toronto. People's Choice Best Interactive Experience: Apollo 11 Best Immersive Video: SONAR === 2016 === People's Choice Best Interactive Experience: Pearl (Patrick Osborne) Best Immersive Video: Help (Justin Lin) Juried Grand Jury Award: Real (Connor Hair and Alex Meader) === 2017 === People's Choice Best Interactive: Alteration Best Immersive (Passive): Guardian of the Guge Kingdom Juried Impact Award: Priya's Shakti / Priya's Mirror (Dan Goldman) Grand Jury Prize: Manifest 99 === 2018 === People's Choice Best Interactive: Museum of Symmetry (Paloma Dawkins) Best Immersive (Passive): Going Home (David Beier) Juried Impact Award: The Hidden (Annie Lukowski, BJ Schwartz) Grand Jury Prize: Battlescar (Nico Casavecchia, Martin Allais) === 2019 === People's Choice Best Interactive: After Dan Graham (David Han/Friend Generator) Best Immersive (Passive): 2nd Step (Joerg Courtial) Juried Technical Achievement: tx-reverse Excellence in Experience Design: Battlescar (Nico Casavecchia, Martin Allais) Excellence in Sound Design: Unheard (Zhechuan Zhang) Excellence in Visual Design: Ex Anima (Pierre Zandrowicz) Impact Award: State Power (Jeff Stanzler) Grand Jury Prize: The Industry (Mirka Duijn) === 2020 === People's Choice Best Interactive: Gravity VR (Fabito Rychter, Amir Admoni) Best Immersive (Passive): Warsaw Rising (Tomasz Dobosz) Juried Technical Achievement: The Cosmic Laughter of Cucci Binaca (Jonathan Sims) Excellence in Experience Design: Sleeping Eyes (Sojung Bahng, Sungeun Lee) Excellence in Sound Design: Symphony of Noise VR (Michaela Pnacekova) Excellence in Visual Design: Hominidae (Brian Andrews) Impact Award: Indirect Actions (Maranatha Hay) Grand Jury Prize: Minimum Mass (Raqi Syed, Areito Echevarria) === 2021 === FIVARS in FEB – People's Choice Best Interactive: CLAWS (created by Evan Neiden; directed by John Ertman) Best Immersive (Passive): Inside COVID 19 (Gary Yost, Adam Loften) FIVARS in FALL – People's Choice Best Interactive: Samsara (director: Hsin-Chien Huang) Best Immersive (Passive): The Invasion of Normandy Omaha Beach (director: Uli Futschik) Juried Technical Achievement: Dark Threads (director: Jonathon Corbiere) Excellence in Experience Design: Andy's World (director: Liquan Liu) Excellence in Sound Design: Symphony (director: Igor Cortadellas) Excellence in Visual Design: Mind VR Exploration (director: Deng Zuyun) Outstanding Performance: Lori Kovachevich, Lena's Journey (director: Wes Evans) Impact Award: Om Devi: Sheroes Revolution (director: Claudio Casale) Grand Jury Prize: Montegelato (director: Davide Rapp) === 2022 === FIVARS in FEB – People's Choice Best Interactive: Severance Theory: Welcome to Respite (Lyndsie Scoggin, United States) Best Immersive (Passive): Beescapes (Alan Nguyen, Australia) FIVARS in FALL – People's Choice Best Interactive: Namuanki (Kevin Mack, United States) Best Immersive (Passive): Reimagined Vol. 1: Nyssa (Julie Cavaliere, United States) Juried (Whole Year) Technical Achievement: Namuanki (Kevin Mack, United States) Excellence in Experience Design: Unframed: Hand Puppets, Paul Klee (Martin Charrière, Switzerland) Excellence in Visual Design: The Last Dance (Toshiaki Hanzaki, Japan) Excellence in Sound Design: Kingdom of Plants with David Attenborough (Iona McEwan, UK and USA) Outstanding Performance: Ari Tarr, OffRail (Ari Tarr, United States) Impact Award: Tearless (Gina Kim, South Korea) Grand Jury Prize: Klaxon. My dear sweet Friend (Nikita Shokhov, United States) === 2023 === People's Choice Best Interactive: PULSAR Best Immersive (Passive): Behind the Dish Juried Technical Achievement: VFC Excellence in Experience Design: Broken Spectre Excellence in Visual Design: Night Creatures Excellence in Sound Design: VFC Outstanding Performance: Origins Impact Award: LOU Grand Jury Prize: Stay Alive, My Son === 2024 ==