AI Avatar Arbitrage

AI Avatar Arbitrage — independent reviews, comparisons, pricing and step-by-step guides on Aizhi.

• 

  Traceability

  Traceability is the capability to trace something. In some cases, it is interpreted as the ability to verify the history, location, or application of an item by means of documented recorded identification. Other common definitions include the capability (and implementation) of keeping track of a given set or type of information to a given degree, or the ability to chronologically interrelate uniquely identifiable entities in a way that is verifiable. Traceability is applicable to measurement, supply chain, software development, healthcare and security. == Measurement == The term measurement traceability or metrological traceability is used to refer to an unbroken chain of comparisons relating an instrument's measurements to a known standard. Calibration to a traceable standard can be used to determine an instrument's bias, precision, and accuracy. It may also be used to show a chain of custody—from current interpretation of evidence to the actual evidence in a legal context, or history of handling of any information. In many countries, national standards for weights and measures are maintained by a National Metrological Institute (NMI) which provides the highest level of standards for the calibration / measurement traceability infrastructure in that country. Examples of government agencies include the National Physical Laboratory, UK (NPL) the National Institute of Standards and Technology (NIST) in the USA, the Physikalisch-Technische Bundesanstalt (PTB) in Germany, the Instituto Nazionale di Ricerca Metrologica (INRiM) in Italy, and the National Research Council of Canada (NRC). As defined by NIST, "Traceability of measurement requires the establishment of an unbroken chain of comparisons to stated references each with a stated uncertainty." A clock providing traceable time is traceable to a time standard such as Coordinated Universal Time or International Atomic Time. The Global Positioning System is a source of traceable time. === Food processing === In food processing (meat processing, fresh produce processing), the term traceability refers to the recording through means of barcodes or RFID tags and other tracking media, all movement of product and steps within the production process. One of the key reasons this is such a critical point is in instances where an issue of contamination arises, and a recall is required. Where traceability has been closely adhered to, it is possible to identify, by precise date/time and exact location which goods must be recalled, and which are safe, potentially saving millions of dollars in the recall process. Traceability within the food processing industry is also utilised to identify key high production and quality areas of a business, versus those of low return, and where points in the production process may be improved. In food processing software, traceability systems imply the use of a unique piece of data (e.g., order date/time or a serialized sequence number, generally through the use of a barcode / RFID) which can be traced through the entire production flow, linking all sections of the business, including suppliers and future sales through the supply chain. Messages and files at any point in the system can then be audited for correctness and completeness, using the traceability software to find the particular transaction and/or product within the supply chain. In food systems, ISO 22005, as part of the ISO 22000 family of standards, has been developed to define the principles for food traceability and specifies the basic requirements for the design and implementation of a feed and food traceability system. It can be applied by an organization operating at any step in the feed and food chain. The European Union's General Food Law came into force in 2002, making traceability compulsory for food and feed operators and requiring those businesses to implement traceability systems. The EU introduced its Trade Control and Expert System, or TRACES, in April 2004. The system provides a central database to track movement of animals within the EU and from third countries. Australia has its National Livestock Identification System to keep track of livestock from birth to slaughterhouse. India has started taking initiatives for setting up traceability systems at Government and Corporate levels. Grapenet, an initiative by Agriculture and Processed Food Products Export Development Authority (APEDA), Ministry of Commerce, Government of India is an example in this direction. GrapeNet is an internet based traceability software system for monitoring fresh grapes exported from India to the European Union. GrapeNet is a first of its kind initiative in India that has put in place an end-to-end system for monitoring pesticide residue, achieve product standardization and facilitate tracing back from pallets to the farm of the Indian grower, through the various stages of sampling, testing, certification and packing. Grapenet won the National Award (Gold), in the winners announced for the best e-Governance initiatives undertaken in India in 2007. The Directorate Generate Foreign Trade (DGFT), Government of India, through its notification dated 04.02.2009 relating to Amendment in Foreign Trade Policy (RE2008)has mandated that Export to the European Union is permitted subject to registration with APEDA, thereby making Grapenet mandatory for all exports of fresh grapes from India to Europe. Uruguay has also designed a system called "Traceability & Electronic Information System of the Beef Industry". Traceability in food supply can also refer to practices employed by individual companies, including Ritual and Amway's Nutrilite. In the case of Nutrilite's supplements, ingredients are documented and tested throughout farming, processing, and manufacturing to ensure traceability at each stage of production. == Systems and software development == In systems and software development, the term traceability (or requirements traceability) refers to the ability to link product requirements back to stakeholders' rationales and forward to corresponding design artifacts, code, and test cases. Traceability supports numerous software engineering activities such as change impact analysis, compliance verification or traceback of code, regression test selection, and requirements validation. It is usually accomplished in the form of a matrix created for the verification and validation of the project. Unfortunately, the practice of constructing and maintaining a requirements trace matrix (RTM) can be very arduous and over time the traces tend to erode into an inaccurate state unless date/time stamped. Alternate automated approaches for generating traces using information retrieval methods have been developed. The IEEE defines traceability as "(1)The degree to which a relationship can be established between two or more products of the development process, especially products having a predecessor, successor or master-subordinate relationship to one another. For example, the degree to which the requirements and design of a given software component match. See also: consistency. " and "(2) The degree to which each element in a software development product establishes its reason for existing; for example, the degree to which each element in a bubble chart references the requirement that it satisfies." In transaction processing software, traceability implies use of a unique piece of data (e.g., order date/time or a serialized sequence number) which can be traced through the entire software flow of all relevant application programs. Messages and files at any point in the system can then be audited for correctness and completeness, using the traceability key to find the particular transaction. This is also sometimes referred to as the transaction footprint. == Health care == Patient safety during healthcare service plays an important role in preventing delayed recovery or even mortality, by increasing and improving the quality of life of citizens, and is considered an indicator of the quality status of health services Maintaining patient safety is a complex task and involves factors inherent to the environment and human actions. New technologies facilitate the traceability tools of patients and medications. This is particularly relevant for drugs that are considered high risk and cost. Recent research in the healthcare industry emphasizes the significant impact of Blockchain Technology (BCT) on improving the performance of healthcare supply chain management. It highlights BCT's role in enhancing transparency, data immutability, and efficient management, leading to better cooperation among stakeholders and effective risk mitigation in healthcare services. The World Health Organization has recognized the importance of traceability for medical products of human origin (MPHO) and urged member states "to encourage the implementation of globally consistent coding systems to facilitate national and international traceability". == Security and cri

  Read more →
• 

  Human-based evolutionary computation

  Human-based evolutionary computation (HBEC) is a set of evolutionary computation techniques that rely on human innovation. == Classes and examples == Human-based evolutionary computation techniques can be classified into three more specific classes analogous to ones in evolutionary computation. There are three basic types of innovation: initialization, mutation, and recombination. Here is a table illustrating which type of human innovation are supported in different classes of HBEC: All these three classes also have to implement selection, performed either by humans or by computers. === Human-based selection strategy === Human-based selection strategy is a simplest human-based evolutionary computation procedure. It is used heavily today by websites outsourcing collection and selection of the content to humans (user-contributed content). Viewed as evolutionary computation, their mechanism supports two operations: initialization (when a user adds a new item) and selection (when a user expresses preference among items). The website software aggregates the preferences to compute the fitness of items so that it can promote the fittest items and discard the worst ones. Several methods of human-based selection were analytically compared in studies by Kosorukoff and Gentry. Because the concept seems too simple, most of the websites implementing the idea can't avoid the common pitfall: informational cascade in soliciting human preference. For example, digg-style implementations, pervasive on the web, heavily bias subsequent human evaluations by prior ones by showing how many votes the items already have. This makes the aggregated evaluation depend on a very small initial sample of rarely independent evaluations. This encourages many people to game the system that might add to digg's popularity but detract from the quality of the featured results. It is too easy to submit evaluation in digg-style system based only on the content title, without reading the actual content supposed to be evaluated. A better example of a human-based selection system is Stumbleupon. In Stumbleupon, users first experience the content (stumble upon it), and can then submit their preference by pressing a thumb-up or thumb-down button. Because the user doesn't see the number of votes given to the site by previous users, Stumbleupon can collect a relatively unbiased set of user preferences, and thus evaluate content much more precisely. === Human-based evolution strategy === In this context and maybe generally, the Wikipedia software is the best illustration of a working human-based evolution strategy wherein the (targeted) evolution of any given page comprises the fine tuning of the knowledge base of such information that relates to that page. Traditional evolution strategy has three operators: initialization, mutation, and selection. In the case of Wikipedia, the initialization operator is page creation, the mutation operator is incremental page editing. The selection operator is less salient. It is provided by the revision history and the ability to select among all previous revisions via a revert operation. If the page is vandalised and no longer a good fit to its title, a reader can easily go to the revision history and select one of the previous revisions that fits best (hopefully, the previous one). This selection feature is crucial to the success of the Wikipedia. An interesting fact is that the original wiki software was created in 1995, but it took at least another six years for large wiki-based collaborative projects to appear. Why did it take so long? One explanation is that the original wiki software lacked a selection operation and hence couldn't effectively support content evolution. The addition of revision history and the rise of large wiki-supported communities coincide in time. From an evolutionary computation point of view, this is not surprising: without a selection operation the content would undergo an aimless genetic drift and would unlikely to be useful to anyone. That is what many people expected from Wikipedia at its inception. However, with a selection operation, the utility of content has a tendency to improve over time as beneficial changes accumulate. This is what actually happens on a large scale in Wikipedia. === Human-based genetic algorithm === Human-based genetic algorithm (HBGA) provides means for human-based recombination operation (a distinctive feature of genetic algorithms). Recombination operator brings together highly fit parts of different solutions that evolved independently. This makes the evolutionary process more efficient.

  Read more →
• 

  Distributed multi-agent reasoning system

  In artificial intelligence, the distributed multi-agent reasoning system (dMARS) was a platform for intelligent software agents developed at the AAII that makes uses of the belief–desire–intention software model (BDI). The design for dMARS was an extension of the intelligent agent cognitive architecture developed at SRI International called procedural reasoning system (PRS). The most recent incarnation of this framework is the JACK Intelligent Agents platform. == Overview == dMARS was an agent-oriented development and implementation environment written in C++ for building complex, distributed, time-critical systems.

  Read more →
• 

  Argument Interchange Format

  The Argument Interchange Format (AIF) is an international effort to develop a representational mechanism for exchanging argument resources between research groups, tools, and domains using a semantically rich language. AIF traces its history back to a 2005 colloquium in Budapest. The result of the work in Budapest was first published as a draft description in 2006. Building on this foundation, further work then used the AIF to build foundations for the Argument Web. AIF-RDF is the extended ontology represented in the Resource Description Framework Schema (RDFS) semantic language. The Argument Interchange Format introduces a small set of ontological concepts that aim to capture a common understanding of argument -- one that works in multiple domains (both domains of argumentation and also domains of academic research), so that data can be shared and re-used across different projects in different areas. These ontological concepts are: Information (I-nodes) Applications of Rules of Inference (RA-nodes) Applications of Rules of Conflict (CA-nodes) Applications of Rules of Preference (PA-nodes) extended by: Schematic Forms (F-nodes) that are instantiated by RA, CA and PA nodes The AIF has reifications in a variety of development environments and implementation languages including MySQL database schema RDF Prolog JSON as well as translations to visual languages such as DOT and SVG. AIF data can be accessed online at AIFdb.

  Read more →
• 

  Mountain car problem

  Mountain Car, a standard testing domain in Reinforcement learning, is a problem in which an under-powered car must drive up a steep hill. Since gravity is stronger than the car's engine, even at full throttle, the car cannot simply accelerate up the steep slope. The car is situated in a valley and must learn to leverage potential energy by driving up the opposite hill before the car is able to make it to the goal at the top of the rightmost hill. The domain has been used as a test bed in various reinforcement learning papers. == Introduction == The mountain car problem, although fairly simple, is commonly applied because it requires a reinforcement learning agent to learn on two continuous variables: position and velocity. For any given state (position and velocity) of the car, the agent is given the possibility of driving left, driving right, or not using the engine at all. In the standard version of the problem, the agent receives a negative reward at every time step when the goal is not reached; the agent has no information about the goal until an initial success. == History == The mountain car problem appeared first in Andrew Moore's PhD thesis (1990). It was later more strictly defined in Singh and Sutton's reinforcement learning paper with eligibility traces. The problem became more widely studied when Sutton and Barto added it to their book Reinforcement Learning: An Introduction (1998). Throughout the years many versions of the problem have been used, such as those which modify the reward function, termination condition, and the start state. == Techniques used to solve mountain car == Q-learning and similar techniques for mapping discrete states to discrete actions need to be extended to be able to deal with the continuous state space of the problem. Approaches often fall into one of two categories, state space discretization or function approximation. === Discretization === In this approach, two continuous state variables are pushed into discrete states by bucketing each continuous variable into multiple discrete states. This approach works with properly tuned parameters but a disadvantage is information gathered from one state is not used to evaluate another state. Tile coding can be used to improve discretization and involves continuous variables mapping into sets of buckets offset from one another. Each step of training has a wider impact on the value function approximation because when the offset grids are summed, the information is diffused. === Function approximation === Function approximation is another way to solve the mountain car. By choosing a set of basis functions beforehand, or by generating them as the car drives, the agent can approximate the value function at each state. Unlike the step-wise version of the value function created with discretization, function approximation can more cleanly estimate the true smooth function of the mountain car domain. === Eligibility traces === One aspect of the problem involves the delay of actual reward. The agent is not able to learn about the goal until a successful completion. Given a naive approach for each trial the car can only backup the reward of the goal slightly. This is a problem for naive discretization because each discrete state will only be backed up once, taking a larger number of episodes to learn the problem. This problem can be alleviated via the mechanism of eligibility traces, which will automatically backup the reward given to states before, dramatically increasing the speed of learning. Eligibility traces can be viewed as a bridge from temporal difference learning methods to Monte Carlo methods. == Technical details == The mountain car problem has undergone many iterations. This section focuses on the standard well-defined version from Sutton (2008). === State variables === Two-dimensional continuous state space. V e l o c i t y = ( − 0.07 , 0.07 ) {\displaystyle Velocity=(-0.07,0.07)} P o s i t i o n = ( − 1.2 , 0.6 ) {\displaystyle Position=(-1.2,0.6)} === Actions === One-dimensional discrete action space. m o t o r = ( l e f t , n e u t r a l , r i g h t ) {\displaystyle motor=(left,neutral,right)} === Reward === For every time step: r e w a r d = − 1 {\displaystyle reward=-1} === Update function === For every time step: A c t i o n = [ − 1 , 0 , 1 ] {\displaystyle Action=[-1,0,1]} V e l o c i t y = V e l o c i t y + ( A c t i o n ) ∗ 0.001 + cos ⁡ ( 3 ∗ P o s i t i o n ) ∗ ( − 0.0025 ) {\displaystyle Velocity=Velocity+(Action)0.001+\cos(3Position)(-0.0025)} P o s i t i o n = P o s i t i o n + V e l o c i t y {\displaystyle Position=Position+Velocity} === Starting condition === Optionally, many implementations include randomness in both parameters to show better generalized learning. P o s i t i o n = − 0.5 {\displaystyle Position=-0.5} V e l o c i t y = 0.0 {\displaystyle Velocity=0.0} === Termination condition === End the simulation when: P o s i t i o n ≥ 0.6 {\displaystyle Position\geq 0.6} == Variations == There are many versions of the mountain car which deviate in different ways from the standard model. Variables that vary include but are not limited to changing the constants (gravity and steepness) of the problem so specific tuning for specific policies become irrelevant and altering the reward function to affect the agent's ability to learn in a different manner. An example is changing the reward to be equal to the distance from the goal, or changing the reward to zero everywhere and one at the goal. Additionally, a 3D mountain car can be used, with a 4D continuous state space.

  Read more →
• 

  Theaitre

  Theaitre (stylized as THEaiTRE) is an interdisciplinary research project investigating to what extent artificial intelligence is able to generate theatre play scripts. The first theatre play produced within the project, AI: When a Robot Writes a Play, premiered online on February 26, 2021. == Goal == Following similar previous projects such as Sunspring, a short sci-fi movie with an automatically generated script, the THEaiTRE project investigates whether current language generation approaches are mature enough to generate a theatre play script that could be successfully performed in front of an audience. The project falls within the area of generative art, famously represented e.g. by the portrait of Edmond de Belamy which was generated by an artificial neural network. In this field, artists are trying to use automated techniques to create "art", questioning the modern definition of art itself. More broadly, the project aims at promoting cooperation rather than competition of humans and artificial intelligence as the more beneficial approach for both. The first theatre play created within the project, titled AI: When a Robot Writes a Play, was presented in February 2021 at the 100th anniversary of the premiere of the R.U.R. theatre play by the Czech author Karel Čapek to celebrate the invention of the word "robot". While R.U.R. was a play written by a human about robots (and humans), THEaiTRE tried to reverse this idea by presenting a play written by a "robot" (artificial intelligence) about humans (and robots). The script of the play was published online, with marked parts of the text which were written manually or manually post-edited. The analysis shows that 90% of the script is automatically generated, with 10% manually written or manually post-edited. The project also plans to produce a second play in 2022, addressing some of the many shortcomings of the approach used to generate the first play, as well as attempting to further minimize the amount of human influence on the script. == Approach == At the core of the project is the GPT-2 language model by OpenAI with various adjustments motivated by the task of generating theatre play scripts, for which the model is not particularly trained. The GPT-2 model is used in the usual way, providing it with a start of a document and prompting it to generate a continuation of the document. Specifically, the input for GPT-2 in this project is typically a short description of the scene setting, followed by a few lines to introduce the characters and start the dialogue. The model then generates 10 continuation lines, and hands control to the user, who can then either ask the model to continue generating, or make various edits before letting the model to generate further, deleting some parts of the script or adding new lines into the script. The adjustments include restricting the generator to only produce lines pertaining to characters appearing in the input prompt, limiting the repetitiveness of the generated text, and employing automatic summarization of the input prompt and the generated text to overcome the limitation of the GPT-2 model which only attends to the last 1,024 subword tokens. The limitations of the model include, among other, a lack of distinctiveness and self-consistency of the characters, an inability to generate the script for the whole play (scripts for individual scenes are generated independently), and errors due to the employment of automated machine translation, as GPT-2 generates English texts but the final play script is being produced in Czech language. The source codes of the project are available under the MIT licence. The project has also published some sample outputs. == Team == The project is a cooperation of the following experts, all based in Prague, Czech Republic: computational linguists from the Faculty of Mathematics and Physics, Charles University theatre experts from the Švanda Theatre and from the Theatre Faculty of the Academy of Performing Arts in Prague hackers from CEE Hacks The project is financially supported by the Technology Agency of the Czech Republic.

  Read more →
• 

  Sunspring

  Sunspring is a 2016 experimental science fiction short film entirely written by an artificial intelligence bot using neural networks. It was conceived by BAFTA-nominated filmmaker Oscar Sharp and NYU AI researcher Ross Goodwin and produced by film production company, End Cue along with Allison Friedman and Andrew Swett. It stars Thomas Middleditch, Elisabeth Grey, and Humphrey Ker as three people, namely H, H2, and C, living in a future world and eventually connecting with each other through a love triangle. The script of the film was authored by a recurrent neural network called long short-term memory (LSTM) by an AI bot named Benjamin. Originally made for the Sci-Fi-London film festival's 48hr Challenge, it was released online by technology news website Ars Technica on 9 June 2016. == Premise == Sunspring narrates the story of three people - H (Middleditch), H2 (Grey), and C (Ker) - set in a futuristic world and entangled with murder and love. == Cast == Thomas Middleditch as H Elisabeth Grey as H2 Humphrey Ker as C == Production == Oscar Sharp originally created the film for the 48hr Film Challenge contest of Sci-Fi-London, a film festival which focuses on science fiction. For the challenge, contestants are given a set of prompts (mostly props and lines) that have to appear in a movie they make over the next two days. It eventually contested in the festival and was nominated among the final top ten films Sharp collaborated with his longtime associate Ross Goodwin, an AI researcher in New York University to create the AI bot, which was initially called Jetson. The bot, which later came to call itself Benjamin, wrote the screenplay including stage directions and dialog. The garbled script was then interpreted by Sharp who directed the actors to construe the plot points themselves and enact the play. According to Ars Technica, the final plot turned out to be a tale of romance and murder, set in a dark future world. === Benjamin, the automatic screenwriter === Called the world's first automatic screenwriter, Benjamin is a self-improving LSTM RNN machine intelligence trained on human screenplays conceived by Goodwin and Sharp. It was trained to write the screenplay by feeding it with a corpus of dozens of sci-fi screenplays found online—mostly movies from the 1980s and 90s. == Music == The film contains a song from Brooklyn-based electro-acoustic duo Tiger and Man, with lyrics written by Benjamin using a database of 30,000 folk songs. As well as a score written by composer Andrew Orkin. == Reception == CNet called it "a beautiful, bizarre sci-fi novelty." Critic Amanda Kooser said, "...probably won't start a rush for replacing human screenwriters with machines. Some day, neural networks may get better at imitating the art of coherent storytelling, but we're not there yet. That doesn't mean "Sunspring" isn't entertaining or worthy of viewing. It is. It's a thought experiment come to life, a novelty." As of April 2019, it has surpassed 1 million views on YouTube.

  Read more →
• 

  Rifts (role-playing game)

  Rifts is a multi-genre role-playing game created by Kevin Siembieda in August 1990 and published continuously by Palladium Books since then. It takes place in a post-apocalyptic future, deriving elements from cyberpunk, science fiction, fantasy, horror, western, mythology and many other genres. Rifts serves as a cross-over environment for a variety of other Palladium games with different universes connected through "rifts" on Earth that lead to different spaces, times, and realities that Palladium calls the "Rifts Megaverse". Rifts describes itself as an "advanced" role-playing game and not an introduction for those new to the concept. Palladium continues to publish books for the Rifts series, with about 80 books published between 1990 and 2011. Rifts Ultimate Edition was released in August 2005 and designed to update the game with Palladium's incremental changes to its system, changes in the game world, and additional information and character types. The web site is quick to point out that this is not a second edition but an improvement and expansion of the original role playing game. == Background == The RPG had the tentative title Boomers, named after the original name for the Glitter Boy power armor until Kevin Siembieda changed the name after finding out it was in use for Bubblegum Crisis. == Setting == The Rifts world is Earth, but hundreds of years into the future. Ley lines, lines of magic energy, criss-cross the earth forming supernatural geographic areas such as the Bermuda Triangle. Points where Ley Lines intersect, called a nexus, are places of powerful magic, such as the Pyramids of Giza and Stonehenge. If a Ley Line nexus energy surges or is purposely activated, the fabric of space and time can be torn, creating a rift - a hole in space-time leading to another place, time, or dimension. Ley lines contain magical energy called Potential Psychic Energy (PPE), which is found in various places, objects, and animals and is particularly strong in children. An adult's level of PPE can vary based on other factors. PPE also allows Psionics which uses energy known as Inner Strength Points or ISP. Psychic phenomenon (more commonly called psionics) can also vary from individuals, ranging from none at all to Master level abilities. Psychic abilities can manifest in virtually any way imaginable. Some psychics develop differently, such as psi-stalkers; human mutants that feed on psychic energy. === Earth === Rifts begins with two future-historical premises: first, a golden age of humanity occurs, with tremendous advances in science, technology, military, and society. Humanity as a whole is at peace as a majority of Earth's nations decide to cease world war and begin to share ideas and technology freely. Much of the Solar System is conquered, humanity's wars will end, and harmony will reign. This golden age is followed by an unknown cause near the winter solstice and a rare planetary alignment, causing a disaster that cascades into tremendous destruction via a ripple effect. The cataclysm begins with unprecedented storms, earthquakes, tsunamis, and volcanic eruptions, which kill millions of people. The Ley Line networks that crisscross the globe are energized, causing rifts to open both on Earth and throughout the Megaverse. For hundreds of years after the holocaust, many creatures, both mythical beasts and aliens, come through the Rifts to wreak havoc. The old world gone, a new Dark Age dawns and humanity's shrinking population is reduced, due to catastrophe and domestic failure, immeasurably. This period is covered in Palladium's Rifts Chaos Earth spin-off series. Rifts initially takes place in 101 P.A. (equivalent to the year 2387) 289 years after this event. The "Post-Apocalypse" calendar was established by the formation of the Coalition States in 2286. By this time, most of the disasters have quieted down, though Earth is still bathed in PPE. The planet's mystical energy has attracted aliens from other dimensions, who continue to arrive through the Rifts both accidentally and deliberately. The humanoid creatures that arrive on Earth are referred to as Dimensional Beings (called D-Bees). Some resemble familiar fantasy races, such as elves and dwarfs, while others were created specifically for the game setting. Non-humanoid creatures have also arrived, including monstrous creatures and mystical demons. To cope with these natural, supernatural, and alien menaces, the human race has adapted in a variety of ways, many of them borrowed from the technological developments of the lost Golden Age. Powered armor suits and giant vehicles are frequently used to combat the dangers of Rifts, but more invasive augmentation is common. This has three basic categories: "Juicers" augment themselves chemically, the "Borgs" augment themselves mechanically, and "Crazies" use performance-enhancing brain implants. All such augmentations boost strength, speed, endurance, and dexterity to superhuman levels. However, all come at great cost. Chemicals cause the body to wear out faster, decreasing life span to a few years. Mechanical Borg augmentation causes a loss of humanity when those with multiple limb and organ replacements become more machine than human. Brain implants cause mental instability ranging from mild phobias to crippling neurosis or psychosis. ==== North America ==== The strongest power in North America is the Coalition States (CS), which is based in the arcological city of Chi-Town and lays claim to northern Illinois, all of Iowa, the Texas Panhandle, Missouri, and the eastern half of Ontario, Canada. The second greatest power is Free Quebec, a former Coalition State that seceded following a civil war with the other Coalition States. Mexico is ruled by a group of vampire kingdoms, who treat humans as little more than food. North of the Rio Grande, west of Texas and roaming most of the American Southwest are large nomadic bands/tribes of bandits who collectively form the Pecos Empire, consisting of El Paso, Los Alamos, and Houstown. Much of the western United States has more or less willingly reverted to a mix of modern and past technology akin to the Wild West. The Royal Canadian Mounted Police managed to survive the great cataclysm, though Canada itself did not. The Mounties have become an independent law enforcement force called the Tundra Rangers, patrolling the northern wilderness. The Midwest, both upper and central, is home to most of North America's population. The Manistique Imperium and Northern Gun in Michigan's Upper Peninsula, both Coalition allies, are among the largest weapons manufacturing areas on the continent. New Lazlo is one of the largest cities in Michigan's southern portion. Chillicothe in Missouri is a large supplier of Coalition food processing and growing. Missouri's southern half, home to the city-states of Whykin (Poplar Bluff) and Kingsdale (West Plains) are in constant opposition to the CS and claim independence. Arkansas is home to the independent CS ally El Dorado. Southern Illinois and the Ohio Valley is home to the Federation of Magic. Also in the Ohio Valley is Psyscape, a city-state founded by psychics. Tolkeen was a major city in the former Minneapolis region in early Rifts books; the city welcomed users of magic. A military campaign made by the Coalition States (which is the primary event of 109 PA) resulted in the magic-user kingdom being wiped off the map. In the Northeast, the city-state of Lazlo, named after supernatural researcher and writer Victor Lazlo, was built upon the ruins of Toronto. This major center of civilization is well known as a melting pot of humans, D-Bees and other beings, and is the home of Techno-Wizardry. Mad Haven is the name given to the ruins of Manhattan; tectonic forces during the cataclysm have moved it into the coast, creating a peninsula. It is seen by most denizens of Rifts Earth as a refuge of demons and madness. ==== South America ==== The return of Atlantis caused the Amazon River basin to flood most of western South America, giving it the nickname The Land of a Thousand Islands. The Empire of the Sun, consisting of Cuzco, Nazca, Arequipa and Lima, created a wide range of technology and magic, including magic derived from the Nazca lines. In Argentina, the Silver River Republics of Cordoba (the South American Chi-Town), Santiago (one of the most tolerant human nations on Rifts Earth), Achilles (a nation founded by mutants), and New Babylon, a nation where humans and aliens coexist) have thrived and created nations whose strength rivals that of the CS. In Bolivia, freed Human and D-Bees formed the Megaversal Legion: a mercenary company with one of the highest levels of technology on Rifts Earth. ==== Europe ==== England has become a vast wilderness again, broken up by the occasional giant Millennium Tree or feudal kingdom, complete with a New Camelot and a new King Arthur, partially being manipulated by an alien intelligence disguised as Merlin. Also the magic of

  Read more →
• 

  AirDine

  AirDine was a mobile app within the platform economy where individuals acted as both supplier and customer for a supper club. AirDine discontinued their service after 31 October 2017. == Operations == AirDine was an online marketplace for home dining that connected users that liked to cook with users looking for a dining experience. Users were categorized as "Hosts" and "Guests," both of whom needed to register with AirDine. AirDine acted as a two-sided market for home dining that allowed hosts and guests, and did not act as a restaurant or host any dinners itself. AirDine charged a service fee. Security and safety of the host were not vetted by AirDine and were completely left to users based on published reviews. Profiles included user reviews and shared social connections to build trust among users. AirDine also included a private messaging system.

  Read more →
• 

  Coronavirus breathalyzer

  A coronavirus breathalyzer is a diagnostic medical device enabling the user to test with 90% or greater accuracy the presence of severe acute respiratory syndrome coronavirus 2 in an exhaled breath. As of the first half of 2020, the idea of a practical coronavirus breathalyzer was concomitantly developed by unrelated research groups in Australia, Canada, Finland, Germany, Indonesia, Israel, Netherlands, Poland, Singapore, United Kingdom and the USA. == Australia == In Australia, GreyScan CEO Samantha Ollerton and Prof. Michael Breadmore of the University of Tasmania are basing a coronavirus breathalyzer on existing technology that is used around the world to detect explosives. Another invention published from ABC News; produced by Colin Hickey and Examin Holdings, have released information on a new breathalyzer called the "Queensland Breath test" claiming its function has 98% efficiency, equipped with a replaceable plastic nozzle for reusability (February 2022). a statement in claim by Bruce Thompson, a professor at Swinburne University of Technology, Although this products is reliable, due to insufficient funding, the product is inaccessible. == Canada == Canary Health Technologies, headquartered in Toronto with offices in Cleveland, Ohio, is developing a breathalyzer with disposable nanosensors using AI-powered cloud-based analysis. According to a press release, clinical trials began in India during November 2020. The stated goal is to develop an accurate, reasonably priced screening tool that can be used anywhere and deliver a result in less than a minute. The company postulates that analyzing volatile organic compounds in human breath could potentially detect diseases before the on-set of symptoms, earlier than currently available methods. Moreover, the cloud-based technology is designed to be used as a disease surveillance apparatus. == Finland == By the end of June 2020, Forum Virium Helsinki, in collaboration with Finnish software firm Deep Sensing Algorithms, funded by the Helsinki-Uusimaa Regional Council, announced that testing of their device had begun with a control group in Kazakhstan, with plans to expand to the Netherlands, the United States, South Africa, Brazil and Finland throughout the summer. The efficacy of the Forum Virium Helsinki / Deep Sensing Algorithms device hinges on its AI component. "We are engaged in innovative cooperation with corporations to solve the coronavirus crisis, and we will help firms to use the city as a development platform. We are utilizing artificial intelligence and digitalization," said Forum Virium Helsinki CEO Mika Malin. == Germany == In March 2020, the Singaporean company RAM Global conducted research in Germany in hopes of developing a one-minute breathalyzer test for SARS-CoV-2 based on terahertz time-domain spectroscopy. The company attempted to develop a disposable test kit for direct detection of COVID-19 virion particles in breath, saliva and swab samples. On 31 March, RAM Global completed an initial clinical study on live patients at University Hospital Saarland. In April, the company pursued a small unknown sample study in which hospital doctors provided unknown samples in order to test accuracy in differentiating positive and negative samples. == Indonesia == Since April 2020, a team of researchers from Gadjah Mada University (UGM) has been developing an electronic nose called GeNose C19. The GeNose C19 can be used as a rapid, non-invasive screening tool in less than two minutes. A profiling test was carried out at the Bhayangkara Hospital and the Covid Bambanglipuro Special Field Hospital in Yogyakarta. GeNose C19 consists of gas sensors and an artificial intelligence-based pattern recognition system. The diagnostic test was carried out with the cooperation of nine multi-center hospitals. In the end of December 2020, GeNose C19 received a distribution permit from Indonesia's Health Ministry. Initially, 100 units will be released and each device will be able to perform 120 tests per day. The test is estimated to cost 15,000–25,000 Indonesian rupiah ($1–$1.8) and would take three minutes for the test and another two minutes to yield a result. Researchers hope to manufacture up to 1,000 GeNose C19 units, increasing the country's testing capabilities by 120 thousand subjects per day. Moreover, they aim to manufacture 10,000 units by February 2021. == Israel == In Israel, it is at the photonics lab of Gabby Sarusi, professor at Ben-Gurion University of the Negev, that research is underway as of midsummer 2020. Separately from Sarusi's project, in July 2020, it was reported that Israeli start-up Nanoscent in cooperation with Sheba Medical Center had devised a breathalyzer that Magen David Adom (MDA) is seeking to incorporate into existing drive-thru testing stations located throughout the country. Questionable intellectual property of Gabby Sarusi regarding this project is now under discussion in the court in Israel. == The Netherlands == A breath test with the SpiroNose device, made by the Dutch company Breathomix, has been developed and tested in collaboration with the Leiden University Medical Center (LUMC), Franciscus Gasthuis & Vlietland and the GGD Amsterdam. The breath test has been validated as a pre-screening test for people who have no or mild symptoms of COVID-19. From April 2021, the device was operational in COVID-19 test drive-ins, conferences and events, i.e. Eurovision Song Contest 2021. Subjects must abstain from alcohol for eight hours prior to taking the breath test. The SpiroNose contains four sets of seven different sensors that can measure the mixture of volatile organic compounds (biomarkers) in the exhaled air. These VOCs provide a picture of a person's metabolism. This 'breath profile' is forwarded to an online analysis platform. Here the breath profile is compared with other breath profiles of people with and without a COVID-19 diagnosis and analysed by algorithms. Data-analysis involves advanced signal processing and statistics based on independent t-tests followed by linear discriminant and ROC analysis. The test result is known within minutes. The breath test has a sensitivity/specificity for SARS-CoV-2 infection of 100/78, >99/84, 98/82% in validation, replication and asymptomatic cohorts of patients. The breath test reliably detects who is not infected. Such a subject will receive a test result immediately. Other subjects must promptly conduct a subsequent test, for example a PCR test or LAMP test. The test results can be viewed by the client and are not automatically interfaced to other databases, i.e. for public health surveillance, source and contact tracing, vaccination programs. In July 2021, the ministry stopped the tests with the SpiroNose because, according to the GGD, the device gives unusable results in some cases. Breathomix indicates that this is the result of the way in which the SpiroNose is deployed. The SpiroNose is and remains a reliable instrument for lung diseases. The analysis platform is developed conform the requirements of the standard ISO 27001 (Information Security) and NEN 7510 (Information Security in Health Care). A CE marking has been requested. In the meantime, the Dutch minister has granted a CE marking exemption on 25 January 2021. The device may also be used to detect other diseases, e.g., asthma, COPD, lung cancer, interstitial lung diseases (ILD). == Poland == In February 2021, the President of Poland, Andrzej Duda, announced that ML System S. A., headquartered in Zaczernie, Poland, had successfully developed a means of analyzing a patient's breath to test for the presence of coronavirus. According to an anonymous press release, test subjects exhale into a device in order to determine the presence of the coronavirus. The procedure, similar to that of a police breathalyzer, is said to take less than ten seconds. Independent clinical trials were begun in April 2021. In the first half of May 2021, a brief text concerning partial results was published by ML System, stating that independent clinical trials were successful with specificity (97,15%) and accuracy/sensitivity (86,86%), for CT (Cycle Threshold) assumed at 25, which is in line with the guidelines set out by the World Health Organization. Moreover, ML System in partnership with Rzeszów–Jasionka Airport published a statement indicating their intention to test the device at the airport. Similar plans exist between the manufacturer and the Warsaw Chopin Airport. Two large networks of laboratories in Poland, "Diagnostyka" and "ALAB Laboratoria", have signed a letter of intent with ML System. In agreement with ALAB, the parties declared cooperation in the implementation of the product named "COVID DETECTOR" on the Polish, German and Ukrainian markets. In addition, the companies declared joint activities aimed at extending the diagnosis with the use of "COVID Detector" to include mutations of the SARS-CoV-2 virus, differentiate the stage of the disease and ot

  Read more →
• 

  Theaitre

  Theaitre (stylized as THEaiTRE) is an interdisciplinary research project investigating to what extent artificial intelligence is able to generate theatre play scripts. The first theatre play produced within the project, AI: When a Robot Writes a Play, premiered online on February 26, 2021. == Goal == Following similar previous projects such as Sunspring, a short sci-fi movie with an automatically generated script, the THEaiTRE project investigates whether current language generation approaches are mature enough to generate a theatre play script that could be successfully performed in front of an audience. The project falls within the area of generative art, famously represented e.g. by the portrait of Edmond de Belamy which was generated by an artificial neural network. In this field, artists are trying to use automated techniques to create "art", questioning the modern definition of art itself. More broadly, the project aims at promoting cooperation rather than competition of humans and artificial intelligence as the more beneficial approach for both. The first theatre play created within the project, titled AI: When a Robot Writes a Play, was presented in February 2021 at the 100th anniversary of the premiere of the R.U.R. theatre play by the Czech author Karel Čapek to celebrate the invention of the word "robot". While R.U.R. was a play written by a human about robots (and humans), THEaiTRE tried to reverse this idea by presenting a play written by a "robot" (artificial intelligence) about humans (and robots). The script of the play was published online, with marked parts of the text which were written manually or manually post-edited. The analysis shows that 90% of the script is automatically generated, with 10% manually written or manually post-edited. The project also plans to produce a second play in 2022, addressing some of the many shortcomings of the approach used to generate the first play, as well as attempting to further minimize the amount of human influence on the script. == Approach == At the core of the project is the GPT-2 language model by OpenAI with various adjustments motivated by the task of generating theatre play scripts, for which the model is not particularly trained. The GPT-2 model is used in the usual way, providing it with a start of a document and prompting it to generate a continuation of the document. Specifically, the input for GPT-2 in this project is typically a short description of the scene setting, followed by a few lines to introduce the characters and start the dialogue. The model then generates 10 continuation lines, and hands control to the user, who can then either ask the model to continue generating, or make various edits before letting the model to generate further, deleting some parts of the script or adding new lines into the script. The adjustments include restricting the generator to only produce lines pertaining to characters appearing in the input prompt, limiting the repetitiveness of the generated text, and employing automatic summarization of the input prompt and the generated text to overcome the limitation of the GPT-2 model which only attends to the last 1,024 subword tokens. The limitations of the model include, among other, a lack of distinctiveness and self-consistency of the characters, an inability to generate the script for the whole play (scripts for individual scenes are generated independently), and errors due to the employment of automated machine translation, as GPT-2 generates English texts but the final play script is being produced in Czech language. The source codes of the project are available under the MIT licence. The project has also published some sample outputs. == Team == The project is a cooperation of the following experts, all based in Prague, Czech Republic: computational linguists from the Faculty of Mathematics and Physics, Charles University theatre experts from the Švanda Theatre and from the Theatre Faculty of the Academy of Performing Arts in Prague hackers from CEE Hacks The project is financially supported by the Technology Agency of the Czech Republic.

  Read more →
• 

  Padre Pio (2022 film)

  Padre Pio is a 2022 biographical drama film co-written and directed by Abel Ferrara. It stars Shia LaBeouf as the titular role of Padre Pio, a Capuchin Franciscan priest who receives the stigmata, in the background of the World War I in Italy. The film is a co-production of Italy, Germany and the United Kingdom. During its production, LaBeouf converted to Catholicism as result of his spiritual experiences in character as Pio, who is venerated as a saint by the Catholic Church. The film had its world premiere in the Giornate degli Autori section of the 79th Venice International Film Festival on 2 September 2022. It was released theatrically in the United Kingdom on 26 January 2024 by Dazzler Media and in Italy on 18 July 2024 by RS Productions. == Plot == It is the year 1920. Italian WWI veterans have returned to their impoverished villages. Padre Pio arrives at San Giovanni Rotondo after living with his family in Pietrelcina for a number of years. While still sick, he continues to encounter Satan. Satan reveals himself as the instigator of the war and the sociopolitical problems of San Giovanni. While having little contact with the people of this town, Padre Pio learns what the poor are suffering from in the Sacrament of Confession and the Holy Mass, such as when a crippled man walks again because of Padre Pio's prayer. Besides the effects of war, such as medical inadequacy, health conditions and labourers dying from the effects of mustard gas, the people suffer from corrupt, wealthy landowners. Gerardo, a militaristic anti-socialist, threatens to kill any communal labourers tending his land. Many of them join the socialist party as a way to improve their lives. However, after they win the first free election in San Giovanni, Gerardo's forces massacre many of them. Padre Pio asks God that he may become a suffering servant for their salvation. He receives the wounds of Jesus Christ. The stigmata disrupts Satan's influence on San Giovanni Rotondo. == Cast == Shia LaBeouf as Padre Pio Marco Leonardi as Gerardo Salvatore Ruocco as Vincenzo Cristina Chiriac as Giovanna Brando Pacitto as Renato Luca Lionello as Silvestro Asia Argento as Tall Man == Production == According to Abel Ferrara, actor Willem Dafoe suggested that Shia LaBeouf should be cast for the film's leading role. After Ferrara held several Zoom calls with LaBeouf, the latter agreed to join the film, even though very little money was raised (the film was almost never made) and LaBeouf did the project for free. LaBeouf arrived at Old Mission Santa Inés in July 2021 to learn about Padre Pio with the Capuchin Franciscan friars. Thanks to Father Bobby Barbato and Brother Jude Quinto, Br. Alexander Rodriguez met LaBeouf while he attended Mass every day. He learned about the Catholic Church and the Capuchins while living in his truck or spending a few nights in the Capuchin's guest room. He was immersing himself in the Catholic faith. He enrolled in RCIA, revised the script with Rodriguez and trained to do the Latin Mass. Rodriguez traveled with LaBeouf as his spiritual adviser and catechist and was in the film as Padre Pio's companion. Filming occurred in Apulia, Italy, in December 2021. The first place was at the Capuchin friary in San Marco la Catola. Padre Pio exchanged letters with his provincial and spiritual director while living in Pietrelcina with his family. The time was around 1909–1916. Both directors were living in San Marco during these years. Padre Pio expressed in his letters his deep and mysterious relationship with God and health difficulties. This event is in the film. While filming, LaBeouf slept in Padre Pio's bedroom. After San Marco, filming continued outside the Sanctuary of Saint Michael the Archangel in Monte Sant'Angelo. Traditionally, St. Michael appeared here in the late 400s. LaBeouf stayed and filmed for a few weeks at the Abbey of Saint Mary of Pulsano. It is near the sanctuary. The rest of the filming took place outside the sanctuary. Ferrara said in 2024 that he used AI for the Italian dub of this film. == Release == Padre Pio had its world premiere in the Giornate degli Autori section of the 79th Venice International Film Festival on 2 September 2022. It received a four-minute ovation. It also competed at the Rio de Janeiro International Film Festival. At the Lisbon & Estoril Film Festival, it was chosen to compete for the "Best Film Award." During its North American premiere at the Mammoth Film Festival, it won the "Achievement for Filmmaking" award for cinematography. At the Taormina Film Festival, it premiered worldwide in Italian. In March 2023, Gravitas Ventures acquired North American rights to the film. It was released in select theaters and on video on demand in the United States on 2 June 2023. The film was released in the United Kingdom and Ireland on 26 January 2024 by Dazzler Media. RS Productions released it in Italy on 18 July 2024. == Reception == On the review aggregator website Rotten Tomatoes, the film holds an approval rating of 30% based on 43 reviews, with an average rating of 4.5/10. The website's critics consensus reads, "Tonally unbalanced and burdened with a distracting Shia LaBeouf performance, Padre Pio is one of Abel Ferrara's less divine works." Metacritic, which uses a weighted average, assigned the film a score of 45 out of 100, based on 6 critics, indicating "mixed or average" reviews.. Jordan Mintzer of The Hollywood Reporter gave the film a negative review, describing it as "clunky" and criticizing its political themes for possessing "the subtlety of a cartoon for preschoolers." Brian Tallerico of RogerEbert.com gave the film one and a half stars out of four, describing it as a "dull slog". Journalist Glenn Kenny of The New York Times found the film "occasionally rank" and panned LaBeouf's performance, though complimented Ferrara's "sometimes Brechtian consideration of the nodes of political history and spirituality." Film critic Armond White of National Review also criticized the film, describing it as "a work of deluded, semi-improvisational navel-gazing". Film critic Peter Bradshaw of The Guardian gave the film a positive review, with three out of five stars, writing that it is "a weird film...with an undeveloped, improvised feel, like a fragment or shard of something else. Yet there is a background hum there...an awareness of something dark and malign. It is a minor film but interesting." Writing for The New Yorker, Richard Brody considered that "in its hectic, scattershot way, Padre Pio feels very much of the desperate present day," describing it as "a historical drama without historical distance" and "a wild effort to reach the immediate experience of the past and its furies." Faith-based reviews for the film were generally negative. It received negative reviews from Catholic Answers, The Catholic World Report, The Catholic Weekly, The Catholic Thing, and Crisis Magazine. Conversely, it received a mixed review from The Catholic Review, as well as a positive review from America. Criticisms were generally aimed at the film's sexual content and perceived support of left-wing politics.

  Read more →
• 

  Global serializability

  In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, global serializability (or modular serializability) is a property of a global schedule of transactions. A global schedule is the unified schedule of all the individual database (and other transactional object) schedules in a multidatabase environment (e.g., federated database). Complying with global serializability means that the global schedule is serializable, has the serializability property, while each component database (module) has a serializable schedule as well. In other words, a collection of serializable components provides overall system serializability, which is usually incorrect. A need in correctness across databases in multidatabase systems makes global serializability a major goal for global concurrency control (or modular concurrency control). With the proliferation of the Internet, Cloud computing, Grid computing, and small, portable, powerful computing devices (e.g., smartphones), as well as increase in systems management sophistication, the need for atomic distributed transactions and thus effective global serializability techniques, to ensure correctness in and among distributed transactional applications, seems to increase. In a federated database system or any other more loosely defined multidatabase system, which are typically distributed in a communication network, transactions span multiple (and possibly distributed) databases. Enforcing global serializability in such system, where different databases may use different types of concurrency control, is problematic. Even if every local schedule of a single database is serializable, the global schedule of a whole system is not necessarily serializable. The massive communication exchanges of conflict information needed between databases to reach conflict serializability globally would lead to unacceptable performance, primarily due to computer and communication latency. Achieving global serializability effectively over different types of concurrency control has been open for several years. == The global serializability problem == === Problem statement === The difficulties described above translate into the following problem: Find an efficient (high-performance and fault tolerant) method to enforce Global serializability (global conflict serializability) in a heterogeneous distributed environment of multiple autonomous database systems. The database systems may employ different concurrency control methods. No limitation should be imposed on the operations of either local transactions (confined to a single database system) or global transactions (span two or more database systems). === Quotations === Lack of an appropriate solution for the global serializability problem has driven researchers to look for alternatives to serializability as a correctness criterion in a multidatabase environment (e.g., see Relaxing global serializability below), and the problem has been characterized as difficult and open. The following two quotations demonstrate the mindset about it by the end of the year 1991, with similar quotations in numerous other articles: "Without knowledge about local as well as global transactions, it is highly unlikely that efficient global concurrency control can be provided... Additional complications occur when different component DBMSs [Database Management Systems] and the FDBMSs [Federated Database Management Systems] support different concurrency mechanisms... It is unlikely that a theoretically elegant solution that provides conflict serializability without sacrificing performance (i.e., concurrency and/or response time) and availability exists." === Proposed solutions === Several solutions, some partial, have been proposed for the global serializability problem. Among them: Global conflict graph (serializability graph, precedence graph) checking Distributed Two-phase locking (Distributed 2PL) Distributed Timestamp ordering Tickets (local logical timestamps which define local total orders, and are propagated to determine global partial order of transactions) == Relaxing global serializability == Some techniques have been developed for relaxed global serializability (i.e., they do not guarantee global serializability; see also Relaxing serializability). Among them (with several publications each): Quasi serializability Two-level serializability Another common reason nowadays for Global serializability relaxation is the requirement of availability of internet products and services. This requirement is typically answered by large scale data replication. The straightforward solution for synchronizing replicas' updates of a same database object is including all these updates in a single atomic distributed transaction. However, with many replicas such a transaction is very large, and may span several computers and networks that some of them are likely to be unavailable. Thus such a transaction is likely to end with abort and miss its purpose. Consequently, Optimistic replication (Lazy replication) is often utilized (e.g., in many products and services by Google, Amazon, Yahoo, and alike), while global serializability is relaxed and compromised for eventual consistency. In this case relaxation is done only for applications that are not expected to be harmed by it. Classes of schedules defined by relaxed global serializability properties either contain the global serializability class, or are incomparable with it. What differentiates techniques for relaxed global conflict serializability (RGCSR) properties from those of relaxed conflict serializability (RCSR) properties that are not RGCSR is typically the different way global cycles (span two or more databases) in the global conflict graph are handled. No distinction between global and local cycles exists for RCSR properties that are not RGCSR. RCSR contains RGCSR. Typically RGCSR techniques eliminate local cycles, i.e., provide local serializability (which can be achieved effectively by regular, known concurrency control methods); however, obviously they do not eliminate all global cycles (which would achieve global serializability).

  Read more →
• 

  Sinewave synthesis

  Sinewave synthesis, or sine wave speech, is a technique for synthesizing speech by replacing the formants (main bands of energy) with pure tone whistles. The first sinewave synthesis program (SWS) for the automatic creation of stimuli for perceptual experiments was developed by Philip Rubin at Haskins Laboratories in the 1970s. This program was subsequently used by Robert Remez, Philip Rubin, David Pisoni, and other colleagues to show that listeners can perceive continuous speech without traditional speech cues, i.e., pitch, stress, and intonation. This work paved the way for a view of speech as a dynamic pattern of trajectories through articulatory-acoustic space.

  Read more →
• 

  Competitions and prizes in artificial intelligence

  There are a number of competitions and prizes to promote research in artificial intelligence. == General machine intelligence == The David E. Rumelhart Prize is an annual award for making a "significant contemporary contribution to the theoretical foundations of human cognition". The prize is $100,000. The Human-Competitive Award is an annual challenge started in 2004 to reward results "competitive with the work of creative and inventive humans". The prize is $10,000. Entries are required to use evolutionary computing. The Intel AI Global Impact Festival is an international annual competition held by Intel Corporation for school, and college students with prizes upwards of $15,000. It is about artificial intelligence technology. There are two age brackets in this competition, 13-18 Age Group, and 18 and Above Age Group. The IJCAI Award for Research Excellence is a biannual award given at the International Joint Conference on Artificial Intelligence (IJCAI) to researchers in artificial intelligence as a recognition of excellence of their career. The 2011 Federal Virtual World Challenge, advertised by The White House and sponsored by the U.S. Army Research Laboratory's Simulation and Training Technology Center, held a competition offering a total of US$52,000 in cash prize awards for general artificial intelligence applications, including "adaptive learning systems, intelligent conversational bots, adaptive behavior (objects or processes)" and more. The Machine Intelligence Prize is awarded annually by the British Computer Society for progress towards machine intelligence. The Kaggle – "the world's largest community of data scientists compete to solve most valuable problems". == Conversational behaviour == The Loebner prize is an annual competition to determine the best Turing test competitors. The winner is the computer system that, in the judges' opinions, demonstrates the "most human" conversational behaviour, they have an additional prize for a system that in their opinion passes a Turing test. This second prize has not yet been awarded. == Automatic control == === Pilotless aircraft === The International Aerial Robotics Competition is a long-running event begun in 1991 to advance the state of the art in fully autonomous air vehicles. This competition is restricted to university teams (although industry and governmental sponsorship of teams is allowed). Key to this event is the creation of flying robots which must complete complex missions without any human intervention. Successful entries are able to interpret their environment and make real-time decisions based only on a high-level mission directive (e.g., "find a particular target inside a building having certain characteristics which is among a group of buildings 3 kilometers from the aerial robot launch point"). In 2000, a $30,000 prize was awarded during the 3rd Mission (search and rescue), and in 2008, $80,000 in prize money was awarded at the conclusion of the 4th Mission (urban reconnaissance). === Driverless cars === The DARPA Grand Challenge is a series of competitions to promote driverless car technology, aimed at a congressional mandate stating that by 2015 one-third of the operational ground combat vehicles of the US Armed Forces should be unmanned. While the first race had no winner, the second awarded a $2 million prize for the autonomous navigation of a hundred-mile trail, using GPS, computers and a sophisticated array of sensors. In November 2007, DARPA introduced the DARPA Urban Challenge, a sixty-mile urban area race requiring vehicles to navigate through traffic. In November 2010 the US Armed Forces extended the competition with the $1.6 million prize Multi Autonomous Ground-robotic International Challenge to consider cooperation between multiple vehicles in a simulated-combat situation. Roborace will be a global motorsport championship with autonomously driving, electric vehicles. The series will be run as a support series during the Formula E championship for electric vehicles. This will be the first global championship for driverless cars. == Data-mining and prediction == The Netflix Prize was a competition for the best collaborative filtering algorithm that predicts user ratings for films, based on previous ratings. The competition was held by Netflix, an online DVD-rental service. The prize was $1,000,000. The Pittsburgh Brain Activity Interpretation Competition will reward analysis of fMRI data "to predict what individuals perceive and how they act and feel in a novel Virtual Reality world involving searching for and collecting objects, interpreting changing instructions, and avoiding a threatening dog." The prize in 2007 was $22,000. The Face Recognition Grand Challenge (May 2004 to March 2006) aimed to promote and advance face recognition technology. The American Meteorological Society's artificial intelligence competition involves learning a classifier to characterise precipitation based on meteorological analyses of environmental conditions and polarimetric radar data. == Cooperation and coordination == === Robot football === The RoboCup and Federation of International Robot-soccer Association (FIRA) are annual international robot soccer competitions. The International RoboCup Federation challenge is by 2050 "a team of fully autonomous humanoid robot soccer players shall win the soccer game, comply with the official rule of the FIFA, against the winner of the most recent World Cup." == Logic, reasoning and knowledge representation == The Herbrand Award is a prize given by Conference on Automated Deduction (CADE) Inc. to honour persons or groups for important contributions to the field of automated deduction. The prize is $1000. The CADE ATP System Competition (CASC) is a yearly competition of fully automated theorem provers for classical first order logic associated with the Conference on Automated Deduction (CADE) and International Joint Conference on Automated Reasoning (IJCAR). The competition was part of the Alan Turing Centenary Conference in 2012, with total prizes of 9000 GBP given by Google. The SUMO prize is an annual prize for the best open source ontology extension of the Suggested Upper Merged Ontology (SUMO), a formal theory of terms and logical definitions describing the world. The prize is $3000. The Hutter Prize for lossless compression of human knowledge is a cash prize which rewards compression improvements on a specific 100 MB English text file. The prize awards 500 euros for each one percent improvement, up to €50,000. The organizers believe that text compression and AI are equivalent problems and 3 prizes have been given, at around € 2k. The Cyc TPTP Challenge is a competition to develop reasoning methods for the Cyc comprehensive ontology and database of everyday common sense knowledge. The prize is 100 euros for "each winner of two related challenges". The Eternity II challenge was a constraint satisfaction problem very similar to the Tetravex game. The objective is to lay 256 tiles on a 16x16 grid while satisfying a number of constraints. The problem is known to be NP-complete. The prize was US$2,000,000. The competition ended in December 2010. == Games == The World Computer Chess Championship has been held since 1970. The International Computer Games Association continues to hold an annual Computer Olympiad which includes this event plus computer competitions for many other games. The Ing Prize was a substantial money prize attached to the World Computer Go Congress, starting from 1985 and expiring in 2000. It was a graduated set of handicap challenges against young professional players with increasing prizes as the handicap was lowered. At the time it expired in 2000, the unclaimed prize was 400,000 NT dollars for winning a 9-stone handicap match. The AAAI General Game Playing Competition is a competition to develop programs that are effective at general game playing. Given a definition of a game, the program must play it effectively without human intervention. Since the game is not known in advance the competitors cannot especially adapt their programs to a particular scenario. The prize in 2006 and 2007 was $10,000. The General Video Game AI Competition (GVGAI) poses the problem of creating artificial intelligence that can play a wide, and in principle unlimited, range of games. Concretely, it tackles the problem of devising an algorithm that is able to play any game it is given, even if the game is not known a priori. Additionally, the contests poses the challenge of creating level and rule generators for any game is given. This area of study can be seen as an approximation of General Artificial Intelligence, with very little room for game dependent heuristics. The competition runs yearly in different tracks: single player planning, two-player planning, single player learning, level and rule generation, and each track prizes ranging from 200 to 500 US dollars for winners and runner-ups. The 2007 Ultimate Computer Ches

  Read more →