AI Code Fixer

AI Code Fixer — independent reviews, comparisons, pricing and step-by-step guides on Aizhi.

• 

  Textual case-based reasoning

  Textual case-based reasoning (TCBR) is a subtopic of case-based reasoning, in short CBR, a popular area in artificial intelligence. CBR suggests the ways to use past experiences to solve future similar problems, requiring that past experiences be structured in a form similar to attribute-value pairs. This leads to the investigation of textual descriptions for knowledge exploration whose output will be, in turn, used to solve similar problems. == Subareas == Textual case-base reasoning research has focused on: measuring similarity between textual cases mapping texts into structured case representations adapting textual cases for reuse automatically generating representations.

  Read more →
• 

  Someday (short story)

  "Someday" is a science fiction short story by American writer Isaac Asimov. It was first published in the August 1956 issue of Infinity Science Fiction and reprinted in the collections Earth Is Room Enough (1957), The Complete Robot (1982), Robot Visions (1990), and The Complete Stories, Volume 1 (1990). == Plot summary == The story is set in a future where computers play a central role in organizing society. Humans are employed as computer operators, but they leave most of the thinking to machines. Indeed, whilst binary programming is taught at school, reading and writing have become obsolete. The story concerns a pair of boys who dismantle and upgrade an old Bard, a child's computer whose sole function is to generate random fairy tales. The boys download a book about computers into the Bard's memory in an attempt to expand its vocabulary, but the Bard simply incorporates computers into its standard fairy tale repertoire. The story ends with the boys excitedly leaving the room after deciding to go to the library to learn "squiggles" (writing) as a means of passing secret messages to one another. As they leave, one of the boys accidentally kicks the Bard's on switch. The Bard begins reciting a new story about a poor mistreated and often ignored robot called the Bard, whose sole purpose is to tell stories, which ends with the words: "the little computer knew then that computers would always grow wiser and more powerful until someday—someday—someday—…"

  Read more →
• 

  Lymphater's Formula

  "Lymphater's Formula" (Polish: "Formula Lymphatera") is a 1961 science fiction short story by Polish writer Stanisław Lem. It is a story of a "mad scientist", mathematician Ammon Lymphater, who invents an artificial intelligence, and then he realizes that it is capable of rendering the humankind obsolete. It was first published in the 1961 collection Księga robotów (Book of Robots) with the pre-annotation "from the memoirs of Ijon Tichy". The story was never republished with this pre-annotation, and nothing in the novel gives any indication at Ijon Tichy. Piotr Krywak tried to figure out possible explanations for this, apart from a typographical error. == Plot == Ammon Lymphater became interested in the emerging science of cybernetics and information theory, and started studying the works of an animal brain, the ant's brain in particular. He took note that the inherited knowledge is an evolutionary advantage somehow not exploited in full by the evolution. Eventually he came to a conclusion that only by pure biological restrictions that adaptive abilities of insects were stopped in their tracks by the evolution. He went on further wondering whether the ants have an ability to apriori knowledge, i.e., knowledge neither inherited nor learned. He decided to consult a famous myrmecologist, who told him about a rare ant species Acanthis Rubra Willinsoniana with an exceptionally high adaptability. Eventually Lymphater devised and constructed "It" capable of instant precognition of everything within "Its" rapidly expanding range of perception. From "It" Lymphater learns that the humanity is not the "crown of evolution", but rather evolution's tool to create "It", because the evolution could not create "It" directly (confirming Lymphater's reasoning about ants). Realizing that the Superentity "It" renders the human civilization redundant and obsolete, Lymphater destroys "It". "It" already knew Lymphater's intentions, but was not worried, knowing that sooner or later someone else will create "It" again and again. "It" was only the first variant of Lymphater's formula and the second variant is possible. Lyphater wonders whether the second one would be capable to create the third stage of the evolution which would amount to an artificial God. == Publication history == It was translated in Russian (as "Формула Лимфатера") in 1963, in Hungarian (as "Lymphater utolsó képlete") in 1966, and in Bulgarian (as "Формулата на Лимфатер" by Георги Димитров Георгиев) in 1969. In 1973 an audiobook was released in German (as "Die lymphatersche Formel"), narrated by Martin Held. It was also republished (and translated) in some other collections of Lem's short stories.

  Read more →
• 

  Shadowrun

  Shadowrun is a science fantasy tabletop role-playing game set in an alternate future in which cybernetics, magic and fantasy creatures co-exist. It combines genres of cyberpunk, urban fantasy, and crime, with occasional elements of conspiracy, horror, and detective fiction. From its inception in 1989, it has spawned a franchise that includes a series of novels, a collectible card game, two miniature-based tabletop wargames, and multiple video games. The title is taken from the game's main premise – a near-future world damaged by a massive magical event, where industrial espionage and corporate warfare runs rampant. A shadowrun – a successful data theft or physical break-in at a rival corporation or organization – is one of the main tools employed by both corporate rivals and underworld figures. Deckers (futuristic hackers) can tap into an immersive, three-dimensional cyberspace on such missions as they seek access, physical or remote, to the power structures of rival groups. They are opposed by rival deckers and lethal, potentially brain-destroying artificial intelligences called "Intrusion Countermeasures" (IC), while they are protected by street fighters and/or mercenaries, often with cyborg implants (called cyberware), magicians, and other exotic figures. Magic has also returned to the world after a series of plagues; dragons who can take human form have returned as well, and are commonly found in high positions of corporate power. == Publication history == Shadowrun was developed and published by FASA from 1989 until early 2001, when the company closed and Shadowrun was transferred to WizKids, a company founded by former FASA employees. Two years before its closure, FASA sold its videogame branch, FASA Interactive, to Microsoft corporation, keeping rights to publishing novels and pen and paper RPGs. Since then, digital rights to Shadowrun IP have belonged to Microsoft. WizKids licensed the RPG rights to Fantasy Productions, who were already publishing a German version, until WizKids was acquired by Topps in 2003. Catalyst Game Labs, a publishing imprint of InMediaRes Productions, licensed the rights from Topps to publish new products. WizKids itself produced an unsuccessful collectible action figure game based on the property, called Shadowrun Duels. A fifth edition of Shadowrun was announced in December 2012. A limited-edition softcover was sold at the Origins Game Fair in June 2013, and the PDF in July 2013. A hardcover was published in August 2013. Shadowrun Anarchy was published in October 2016 It is a simplified version of the ruleset which allows focus more on the narration than on the rules. The sixth edition, called Shadowrun, Sixth World, was announced on May 1, 2019 to coincide with the game's 30th anniversary, along with a new website at shadowrunsixthworld.com. The game was published on August 26, 2019. The mechanics for this new version are generally similar to those of fifth edition, with some rules reworked for what line developer Jason Hardy describes as streamlining. This new version also progressed the in-game year to 2080. Since 2004, Shadowrun Missions (SRM) has offered fans "living campaigns" that allow for persistent character advancement. SRM is broken down into seasons which are made up of up to 24 individual missions that can be played at home, with special missions available to play exclusively at conventions. Each SRM season develops an overarching plot focused on a specific city from the Shadowrun setting. Missions settings have included the divided city of Denver, the corporate city-state of Manhattan, the Seattle Metroplex city-state, the formerly walled-off wastelands of Chicago, and Neo-Tokyo. For Shadowrun, Sixth World missions returned to Seattle, with twenty-four missions set in 2081, right after Seattle declared independence from the UCAS. The current Shadowrun Missions setting is 2083 New Orleans. The Shadowrun role-playing game has spawned several properties, including Shadowrun: The Trading Card Game, eight video games, an action figure game (Shadowrun Duels), two magazines, an art book and more than 50 novels, starting with the Secrets of Power series which introduces some of the original characters of Shadowrun and provides an introduction to this fictional universe. In addition to the main rule book there have been over 100 published supplements including adventures and expansions to both the rules and the game settings. Catalyst Game Labs announced that 2013 would be "The Year of Shadowrun," and in addition to the release of Shadowrun fifth edition that it has collaborated with publishers on the following properties: Shadowrun: Crossfire, The Adventure Deck-building Game; Shadowrun: Sprawl Gangers, a tactical miniatures wargame; and Shadowrun: Hostile Takeover, a board game designed by Bryan C.P. Steele was planned for release in late 2014/early 2015. Catalyst had been in collaboration with Nordic Games and Cliffhanger Studios to create Shadowrun Chronicles: Boston Lockdown online RPG, however it was shuttered November 30, 2018, with the producers citing lack of funding and the end of the license terms for use of the IP. == Fictional universe == Shadowrun takes place several decades in the future (2050 in the first edition, currently 2088). The end of the Mesoamerican Long Count calendar ushered in the "Sixth World", with once-mythological beings (e.g. dragons) appearing and forms of magic suddenly emerging. Large numbers of humans have "Goblinized" into orks and trolls, while many human children are born as elves, dwarves, and even more exotic creatures. In North America, indigenous peoples discovered that their traditional ceremonies allow them to command powerful spirits, and rituals associated with a new Ghost Dance movement let them take control of much of the western U.S. and Canada, where they formed a federation of Native American Nations. Seattle remains under U.S. control by treaty as a city-state enclave, and most game materials are set there and assume campaigns will use it as their setting. In parallel with these magical developments, the setting's 21st century features technological and social developments associated with cyberpunk science fiction. Megacorporations control the lives of their employees and command their own armies; many of the largest have extraterritoriality, such as currently enjoyed by foreign heads of state. Technological advances make cyberware (mechanical replacement body parts) and bioware (augmented vat-grown body parts implanted in place of or in tandem with natural organs) common. The Computer Crash of 2029 led to the creation of the Matrix, a worldwide computer network that users interact with via direct neural interface. When conflicts arise, corporations, governments, organized crime syndicates, and even wealthy individuals subcontract their dirty work to specialists, who then perform "shadowruns" or missions undertaken by deniable assets without identities or those that wish to remain unknown. The most skilled of these specialists, called shadowrunners, have earned a reputation for getting the job done. They have developed a knack for staying alive, and prospering, in the world of Shadowrun. The Shadowrun world is cross-genre, incorporating elements of both cyberpunk and urban fantasy. Unlike in a purely cyberpunk game, in the Shadowrun world, magic exists and has "worked" since 2011. Among other things, this split humankind into subtypes, also known as metatypes/metahumans. Some of these metatypes take the form of common fantasy races. Likewise, some animals have turned into familiar monsters of past fantasy and lore and both monsters and human magicians have regained magical powers. By the second half of the 21st century, in the time the game is set, these events are accepted as commonplace. Man, machine, and magic exist in a world where the amazing is among the most common and technology has entered into every facet of human (and metahuman) life. === Races === Characters in Shadowrun can be humans, orks, trolls, elves, dwarves, as well as certain diverging subspecies (known as metavariants) such as gnomes, giants, dryads, etc. In the early days, when magic returned to the world, humans began to either change into, or give birth to, elf and dwarf infants, a phenomenon called Unexplained Genetic Expression (UGE). Later, some juvenile and adult humans "goblinized" into other races (mostly orks, but also some trolls). The term "metahuman" is used either to refer to humanity as a whole, including all races, or to refer specifically to non-human races, depending on context. The return of Halley's Comet brought even further variation in the form of changelings, who have variation atypical to their metatype or even species, such as electroreception. Two of the metahuman races, elves and orks, have fictional languages. Additionally, a virus known as the Human Meta-Human Vampiric Virus (HMHVV), with many variant strains, has been known to cause f

  Read more →
• 

  Data augmentation

  Data augmentation is a statistical technique which allows maximum likelihood estimation from incomplete data. Data augmentation has important applications in Bayesian analysis, and the technique is widely used in machine learning to reduce overfitting when training machine learning models, achieved by training models on several slightly-modified copies of existing data. == Synthetic oversampling techniques for traditional machine learning == Synthetic Minority Over-sampling Technique (SMOTE) is a method used to address imbalanced datasets in machine learning. In such datasets, the number of samples in different classes varies significantly, leading to biased model performance. For example, in a medical diagnosis dataset with 90 samples representing healthy individuals and only 10 samples representing individuals with a particular disease, traditional algorithms may struggle to accurately classify the minority class. SMOTE rebalances the dataset by generating synthetic samples for the minority class. For instance, if there are 100 samples in the majority class and 10 in the minority class, SMOTE can create synthetic samples by randomly selecting a minority class sample and its nearest neighbors, then generating new samples along the line segments joining these neighbors. This process helps increase the representation of the minority class, improving model performance. == Data augmentation for image classification == When convolutional neural networks grew larger in mid-1990s, there was a lack of data to use, especially considering that some part of the overall dataset should be spared for later testing. It was proposed to perturb existing data with affine transformations to create new examples with the same labels, which were complemented by so-called elastic distortions in 2003, and the technique was widely used as of 2010s. Data augmentation can enhance CNN performance and acts as a countermeasure against CNN profiling attacks. Data augmentation has become fundamental in image classification, enriching training dataset diversity to improve model generalization and performance. The evolution of this practice has introduced a broad spectrum of techniques, including geometric transformations, color space adjustments, and noise injection. === Geometric Transformations === Geometric transformations alter the spatial properties of images to simulate different perspectives, orientations, and scales. Common techniques include: Affine Transformation Rotation: Rotating images by a specified degree to help models recognize objects at various angles. Reflection: Reflecting images horizontally or vertically to introduce variability in orientation. Translation: Shifting images in different directions to teach models positional invariance. Scaling Shear Mapping Cropping: Removing sections of the image to focus on particular features or simulate closer views. Elastic Distortion Morphing within the same class: Generating new samples by applying morphing techniques between two images belonging to the same class, thereby increasing intra-class diversity. === Color Space Transformations === Color space transformations modify the color properties of images, addressing variations in lighting, color saturation, and contrast. Techniques include: Brightness Adjustment: Varying the image's brightness to simulate different lighting conditions. Contrast Adjustment: Changing the contrast to help models recognize objects under various clarity levels. Saturation Adjustment: Altering saturation to prepare models for images with diverse color intensities. Color Jittering: Randomly adjusting brightness, contrast, saturation, and hue to introduce color variability. === Noise Injection === Injecting noise into images simulates real-world imperfections, teaching models to ignore irrelevant variations. Techniques involve: Gaussian Noise: Adding Gaussian noise mimics sensor noise or graininess. Salt and Pepper Noise: Introducing black or white pixels at random simulates sensor dust or dead pixels. == Data augmentation for signal processing == Residual or block bootstrap can be used for time series augmentation. === Biological signals === Synthetic data augmentation is of paramount importance for machine learning classification, particularly for biological data, which tend to be high dimensional and scarce. The applications of robotic control and augmentation in disabled and able-bodied subjects still rely mainly on subject-specific analyses. Data scarcity is notable in signal processing problems such as for Parkinson's Disease Electromyography signals, which are difficult to source - Zanini, et al. noted that it is possible to use a generative adversarial network (in particular, a DCGAN) to perform style transfer in order to generate synthetic electromyographic signals that corresponded to those exhibited by sufferers of Parkinson's Disease. The approaches are also important in electroencephalography (brainwaves). Wang, et al. explored the idea of using deep convolutional neural networks for EEG-Based Emotion Recognition, results show that emotion recognition was improved when data augmentation was used. A common approach is to generate synthetic signals by re-arranging components of real data. Lotte proposed a method of "Artificial Trial Generation Based on Analogy" where three data examples x 1 , x 2 , x 3 {\displaystyle x_{1},x_{2},x_{3}} provide examples and an artificial x s y n t h e t i c {\displaystyle x_{synthetic}} is formed which is to x 3 {\displaystyle x_{3}} what x 2 {\displaystyle x_{2}} is to x 1 {\displaystyle x_{1}} . A transformation is applied to x 1 {\displaystyle x_{1}} to make it more similar to x 2 {\displaystyle x_{2}} , the same transformation is then applied to x 3 {\displaystyle x_{3}} which generates x s y n t h e t i c {\displaystyle x_{synthetic}} . This approach was shown to improve performance of a Linear Discriminant Analysis classifier on three different datasets. Current research shows great impact can be derived from relatively simple techniques. For example, Freer observed that introducing noise into gathered data to form additional data points improved the learning ability of several models which otherwise performed relatively poorly. Tsinganos et al. studied the approaches of magnitude warping, wavelet decomposition, and synthetic surface EMG models (generative approaches) for hand gesture recognition, finding classification performance increases of up to +16% when augmented data was introduced during training. More recently, data augmentation studies have begun to focus on the field of deep learning, more specifically on the ability of generative models to create artificial data which is then introduced during the classification model training process. In 2018, Luo et al. observed that useful EEG signal data could be generated by Conditional Wasserstein Generative Adversarial Networks (GANs) which was then introduced to the training set in a classical train-test learning framework. The authors found classification performance was improved when such techniques were introduced. === Mechanical signals === The prediction of mechanical signals based on data augmentation brings a new generation of technological innovations, such as new energy dispatch, 5G communication field, and robotics control engineering. In 2022, Yang et al. integrate constraints, optimization and control into a deep network framework based on data augmentation and data pruning with spatio-temporal data correlation, and improve the interpretability, safety and controllability of deep learning in real industrial projects through explicit mathematical programming equations and analytical solutions.

  Read more →
• 

  Fuzzy finite element

  The fuzzy finite element method combines the well-established finite element method with the concept of fuzzy numbers, the latter being a special case of a fuzzy set. The advantage of using fuzzy numbers instead of real numbers lies in the incorporation of uncertainty (on material properties, parameters, geometry, initial conditions, etc.) in the finite element analysis. One way to establish a fuzzy finite element (FE) analysis is to use existing FE software (in-house or commercial) as an inner-level module to compute a deterministic result, and to add an outer-level loop to handle the fuzziness (uncertainty). This outer-level loop comes down to solving an optimization problem. If the inner-level deterministic module produces monotonic behavior with respect to the input variables, then the outer-level optimization problem is greatly simplified, since in this case the extrema will be located at the vertices of the domain.

  Read more →
• 

  Miss AI

  Miss AI is an annual international artificial intelligence beauty pageant run by the British company Fanvue. It is the first beauty pageant for AI-generated personas. == History == Miss AI's inaugural contest was organized by Fanvue as a part of the World AI Creator Awards (WAICAs) in 2024. The winner is selected by a panel of judges which consists of both humans and AI-generated individuals. The Moroccan virtual influencer Kenza Layli was crowned with the inaugural title while Lalina Valina and Olivia C remained the first and second runners-up respectively. == Competition == The creators are eligible to take part in this competition as long as the models are entirely AI-generated and have a social media presence. The judges evaluate contestants' three main categories – Beauty, Tech, & Social clout and rank them according the overall points earned from these categories. The Guardian commented that "AI models take every toxic gendered beauty norm and bundle them up into completely unrealistic package". == Winners ==

  Read more →
• 

  Defuzzification

  Defuzzification is the process of producing a quantifiable result in crisp logic, given fuzzy sets and corresponding membership degrees. It is the process that maps a fuzzy set to a crisp set. It is typically needed in fuzzy control systems. These systems will have a number of rules that transform a number of variables into a fuzzy result, that is, the result is described in terms of membership in fuzzy sets. For example, rules designed to decide how much pressure to apply might result in "Decrease Pressure (15%), Maintain Pressure (34%), Increase Pressure (72%)". Defuzzification is interpreting the membership degrees of the fuzzy sets into a specific decision or real value. The simplest but least useful defuzzification method is to choose the set with the highest membership, in this case, "Increase Pressure" since it has a 72% membership, and ignore the others, and convert this 72% to some number. The problem with this approach is that it loses information. The rules that called for decreasing or maintaining pressure might as well have not been there in this case. A common and useful defuzzification technique is center of gravity. First, the results of the rules must be added together in some way. The most typical fuzzy set membership function has the graph of a triangle. Now, if this triangle were to be cut in a straight horizontal line somewhere between the top and the bottom, and the top portion were to be removed, the remaining portion forms a trapezoid. The first step of defuzzification typically "chops off" parts of the graphs to form trapezoids (or other shapes if the initial shapes were not triangles). For example, if the output has "Decrease Pressure (15%)", then this triangle will be cut 15% the way up from the bottom. In the most common technique, all of these trapezoids are then superimposed one upon another, forming a single geometric shape. Then, the centroid of this shape, called the fuzzy centroid, is calculated. The x coordinate of the centroid is the defuzzified value. == Methods == There are many different methods of defuzzification available, including the following: AI (adaptive integration) BADD (basic defuzzification distributions) BOA (bisector of area) CDD (constraint decision defuzzification) COA (center of area) COG (center of gravity) ECOA (extended center of area) EQM (extended quality method) FCD (fuzzy clustering defuzzification) FM (fuzzy mean) FOM (first of maximum) GLSD (generalized level set defuzzification) ICOG (indexed center of gravity) IV (influence value) LOM (last of maximum) MeOM (mean of maxima) MOM (middle of maximum) QM (quality method) RCOM (random choice of maximum) SLIDE (semi-linear defuzzification) WFM (weighted fuzzy mean) The maxima methods are good candidates for fuzzy reasoning systems. The distribution methods and the area methods exhibit the property of continuity that makes them suitable for fuzzy controllers.

  Read more →
• 

  AI Mode

  AI Mode is a search feature used within Google Search. In March 2025, Google introduced an experimental "AI Mode" within its search platform, enabling users to input complex, multi-part queries and receive comprehensive, AI-generated responses. This feature uses Google's Gemini model, which enhances the system's reasoning capabilities and supports multimodal inputs, including text, images, and voice. Users need to be signed in to be able to use the image generation features. Initially, AI Mode was available to Google One AI Premium subscribers in the United States, who could access it through the Search Labs platform. This phased rollout allowed Google to gather user feedback and refine the feature before a broader release.

  Read more →
• 

  Shyster (expert system)

  SHYSTER is a legal expert system developed at the Australian National University in Canberra in 1993. It was written as the doctoral dissertation of James Popple under the supervision of Robin Stanton, Roger Clarke, Peter Drahos, and Malcolm Newey. A full technical report of the expert system, and a book further detailing its development and testing have also been published. SHYSTER emphasises its pragmatic approach, and posits that a legal expert system need not be based upon a complex model of legal reasoning in order to produce useful advice. Although SHYSTER attempts to model the way in which lawyers argue with cases, it does not attempt to model the way in which lawyers decide which cases to use in those arguments. SHYSTER is of a general design, permitting its operation in different legal domains. It was designed to provide advice in areas of case law that have been specified by a legal expert using a bespoke specification language. Its knowledge of the law is acquired, and represented, as information about cases. It produces its advice by examining, and arguing about, the similarities and differences between cases. It derives its name from Shyster: a slang word for someone who acts in a disreputable, unethical, or unscrupulous way, especially in the practice of law and politics. == Methods == SHYSTER is a specific example of a general category of legal expert systems, broadly defined as systems that make use of artificial intelligence (AI) techniques to solve legal problems. Legal AI systems can be divided into two categories: legal retrieval systems and legal analysis systems. SHYSTER belongs to the latter category of legal analysis systems. Legal analysis systems can be further subdivided into two categories: judgment machines and legal expert systems. SHYSTER again belongs to the latter category of legal expert systems. A legal expert system, as Popple uses the term, is a system capable of performing at a level expected of a lawyer: "AI systems which merely assist a lawyer in coming to legal conclusions or preparing legal arguments are not here considered to be legal expert systems; a legal expert system must exhibit some legal expertise itself." Designed to operate in more than one legal domain, and be of specific use to the common law of Australia, SHYSTER accounts for statute law, case law, and the doctrine of precedent in areas of private law. Whilst it accommodates statute law, it is primarily a case-based system, in contradistinction to rule-based systems like MYCIN. More specifically, it was designed in a manner enabling it to be linked with a rule-based system to form a hybrid system. Although case-based reasoning possesses an advantage over rule-based systems by the elimination of complex semantic networks, it suffers from intractable theoretical obstacles: without some further theory it cannot be predicted what features of a case will turn out to be relevant. Users of SHYSTER therefore require some legal expertise. Richard Susskind argues that "jurisprudence can and ought to supply the models of law and legal reasoning that are required for computerized [sic] implementation in the process of building all expert systems in law". Popple, however, believes jurisprudence is of limited value to developers of legal expert systems. He posits that a lawyer must have a model of the law (maybe unarticulated) which includes assumptions about the nature of law and legal reasoning, but that model need not rest on basic philosophical foundations. It may be a pragmatic model, developed through experience within the legal system. Many lawyers perform their work with little or no jurisprudential knowledge, and there is no evidence to suggest that they are worse, or better, at their jobs than lawyers well-versed in jurisprudence. The fact that many lawyers have mastered the process of legal reasoning, without having been immersed in jurisprudence, suggests that it may indeed be possible to develop legal expert systems of good quality without jurisprudential insight. As a pragmatic legal expert system SHYSTER is the embodiment of this belief. A further example of SHYSTER’s pragmatism is its simple knowledge representation structure. This structure was designed to facilitate specification of different areas of case law using a specification language. Areas of case law are specified in terms of the cases and attributes of importance in those areas. SHYSTER weights its attributes and checks for dependence between them. In order to choose cases upon which to construct its opinions, SHYSTER calculates distances between cases and uses these distances to determine which of the leading cases are nearest to the instant case. To this end SHYSTER can be seen to adopt and expand upon nearest neighbor search methods used in pattern recognition. These nearest cases are used to produce an argument (based on similarities and differences between the cases) about the likely outcome in the instant case. This argument relies on the doctrine of precedent; it assumes that the instant case will be decided the same way as was the nearest case. SHYSTER then uses information about these nearest cases to construct a report. The report that SHYSTER generates makes a prediction and justifies that prediction by reference only to cases and their similarities and differences: the calculations that SHYSTER performs in coming to its opinion do not appear in that opinion. Safeguards are employed to warn users if SHYSTER doubts the veracity of its advice. == Results == SHYSTER was tested in four different and disparate areas of case law. Four specifications were written, each representing an area of Australian law: an aspect of the law of trover; the meaning of "authorization [sic]" in copyright law of Australia; the categorisation of employment contracts; and the implication of natural justice in administrative decision-making. SHYSTER was evaluated under five headings: its usefulness, its generality, the quality of its advice, its limitations, and possible enhancements that could be made to it. Despite its simple knowledge representation structure, it has shown itself capable of producing good advice, and its simple structure has facilitated the specification of different areas of law. Appreciating the difficulties encountered by legal expert systems developers in adequately representing legal knowledge can assist in appreciating the shortcomings of digital rights management technologies. Some academics believe future digital rights management systems may become sophisticated enough to permit exceptions to copyright law. To this end SHYSTER's attempt to model "authorization [sic]" in the Copyright Act can be viewed as pioneering work in this field. The term "authorization [sic]" is undefined in the Copyright Act. Consequently, a number of cases have been before the courts seeking answers as to what conduct amounts to authorisation. The main contexts in which the issue has arisen are analogous to permitted exceptions to copyright currently prevented by most digital rights management technologies: "home taping of recorded materials, photocopying in educational institutions and performing works in public". When applied to one case concerning compact cassettes, SHYSTER successfully agreed that Amstrad did not authorise the infringement. 'shyster-myci'n Popple highlighted the most obvious avenue of future research using SHYSTER as the development of a rule-based system, and the linking together of that rule-based system with the existing case-based system to form a hybrid system. This intention was eventually realised by Thomas O’Callaghan, the creator of SHYSTER-MYCIN: a hybrid legal expert system first presented at ICAIL '03, 24–28 June 2003 in Edinburgh, Scotland. MYCIN is an existing medical expert system, which was adapted for use with SHYSTER. MYCIN’s controversial "certainty factor" is not used in SHYSTER-MYCIN. The reason for this is the difficulty in scientifically establishing how certain a fact is in a legal domain. The rule-based approach of the MYCIN part is used to reason with the provisions of an Act of Parliament only. This hybrid system enables the case-based system (SHYSTER) to determine open textured concepts when required by the rule-based system (MYCIN). The ultimate conclusion of this joint endeavour is that a hybrid approach is preferred in the creation of legal expert systems where "it is appropriate to use rule-based reasoning when dealing with statutes, and…case-based reasoning when dealing with cases".

  Read more →
• 

  Squirrel AI

  Squirrel Ai Learning is an international educational technology company that specializes in intelligent adaptive learning and was one of the first companies in the world to offer large scale AI-powered adaptive education solutions. == Methodology == Squirrel Ai Learning uses artificial intelligence to tailor lesson plans to each individual student. The company's AI researchers have access to the world's largest student databases, which are used to train the AI algorithms. Squirrel Ai Learning works with teachers to identify the most fine-grained possible concepts ("knowledge points") for a course in order to precisely target learning gaps. For example, middle school mathematics is broken into over 10,000 points such as rational numbers, the properties of a triangle, and the Pythagorean theorem. Each point is linked to related items, forming a "knowledge graph". Each knowledge point is addressed by videos, examples and practice problems. A textbook might address 3,000 points; ALEKS, another adaptive learning platform, uses 1,000. Each student begins with a diagnostic test to identify where to begin their learning. The system continues to refine its graph as more students proceed. Learning is not student-directed. The system decides the order of topics. == History and milestones == Squirrel Ai Learning was founded by Derek Haoyang Li in 2014. In March, 2017, The Squirrel Ai Intelligent Adaptive Learning System (IALS) was launched. IALS utilizes artificial intelligence to customize lessons, practice and evaluations for each individual student. In 2018, Squirrel Ai Learning established a joint research lab of AI adaptive learning with the institute of Automation of the Chinese Academy of Sciences. By 2019, Squirrel Ai Learning had opened 2,000 learning centers in 200 cities and registered over a million students in Asia. In 2019, Squirrel Ai Learning opened a research lab in partnership with Carnegie Mellon University. As of 2019, Squirrel Ai Learning had raised over $180 million in funding and in 2018 it surpassed $1 billion in valuation. In 2020, Squirrel Ai Learning launched the $1 million AAAI Squirrel AI Award for Artificial Intelligence for the Benefit of Humanity in partnership with AAAI. The inaugural award was given to Regina Barzilay for her work developing machine learning models to address drug synthesis and early-stage breast cancer diagnosis. In 2020, Squirrel Ai Learning established strategic partnership with DingTalk, Alibaba Group. As of 2021, Squirrel Ai Learning had served over 60,000 public schools, in over 1200 cities in Asia. Squirrel Ai plans to start offering its services in the United States in 2026. The American arm is separate from the Chinese company to avoid regulatory hurdles. As of January 2026, it had set up an "independent technology platform" in the US. == Recognition == Squirrel Ai Learning has gained recognition both in Asia and internationally including: Squirrel Ai Learning was named one of the World's Top 30 AI application case in the 2018 Synced Machine Intelligence Awards. In June 2019, Squirrel Ai Learning was named as one of the 50 smartest companies in China by MIT technology review. Squirrel Ai Learning won the GITEX 2019 Best Education Technology Award. In 2020, Squirrel Ai Learning won the UNESCO AI Innovation Award. Squirrel Ai Learning was listed in the 2020 CB Insight's AI 100, CB Insights' annual ranking of the 100 most promising AI startups in the world. Squirrel Ai Learning won Edtech Review's Best AI in Education Company of the Year award 2020.

  Read more →
• 

  Big Mechanism

  Big Mechanism is a $45 million DARPA research program, begun in 2014, aimed at developing software that will read cancer research papers, integrate them into a cancer model and frame new hypotheses by the end of 2017 through the automated collection of big data and integrating across various disciplines such as knowledge-based NLP, curation and ontology, systems and mathematical biology by reading research abstracts and papers to extract pieces of causal mechanisms. == Ras gene == The program focuses on mutations in the Ras gene family, which underlie some one-third of human cancers. Currently, a rough road map shows interaction sequences among proteins affecting cell replication and death. However, the causal relations are poorly understood. == Plan == The program is to occur in three stages. The first is to read literature and convert it into formal representations. Second is to integrate the knowledge into computational models. Third is to produce experimentally testable explanations and predictions. Research teams are developing four separate systems targeting all three tasks. In February 2015, an evaluation meeting reviewed progress on the first stage. Multiple tasks were considered. One was extraction of experimental procedure details and evaluating statements such as "we demonstrate" and "we suggest." Another worked to map sentence meaning and relationships. The best machine-reading system extracted 40% of relevant information from a small corpus and correctly determined how each passage related to the model. The second stage is to become active in summer 2015, when members attempt to produce a single reference model. The third stage is the most challenging, because the artificial intelligence community has had limited success at developing hypothesis generators. Molecular biology may be more amenable, because most domain knowledge is technical and available in written form.

  Read more →
• 

  Symbolic regression

  Symbolic regression (SR) is a type of regression analysis that searches the space of mathematical expressions to find the model that best fits a given dataset, both in terms of accuracy and simplicity. No particular model is provided as a starting point for symbolic regression. Instead, initial expressions are formed by randomly combining mathematical building blocks such as mathematical operators, analytic functions, constants, and state variables. Usually, a subset of these primitives will be specified by the person operating it, but that's not a requirement of the technique. The symbolic regression problem for mathematical functions has been tackled with a variety of methods, including recombining equations most commonly using genetic programming, as well as more recent methods utilizing Bayesian methods and neural networks. Another non-classical alternative method to SR is called Universal Functions Originator (UFO), which has a different mechanism, search-space, and building strategy. Further methods such as Exact Learning attempt to transform the fitting problem into a moments problem in a natural function space, usually built around generalizations of the Meijer-G function. By not requiring a priori specification of a model, symbolic regression isn't affected by human bias, or unknown gaps in domain knowledge. It attempts to uncover the intrinsic relationships of the dataset, by letting the patterns in the data itself reveal the appropriate models, rather than imposing a model structure that is deemed mathematically tractable from a human perspective. The fitness function that drives the evolution of the models takes into account not only error metrics (to ensure the models accurately predict the data), but also special complexity measures, thus ensuring that the resulting models reveal the data's underlying structure in a way that's understandable from a human perspective. This facilitates reasoning and favors the odds of getting insights about the data-generating system, as well as improving generalisability and extrapolation behaviour by preventing overfitting. Accuracy and simplicity may be left as two separate objectives of the regression—in which case the optimum solutions form a Pareto front—or they may be combined into a single objective by means of a model selection principle such as minimum description length. It has been proven that symbolic regression is an NP-hard problem. Nevertheless, if the sought-for equation is not too complex it is possible to solve the symbolic regression problem exactly by generating every possible function (built from some predefined set of operators) and evaluating them on the dataset in question. == Difference from classical regression == While conventional regression techniques seek to optimize the parameters for a pre-specified model structure, symbolic regression avoids imposing prior assumptions, and instead infers the model from the data. In other words, it attempts to discover both model structures and model parameters. This approach has the disadvantage of having a much larger space to search, because not only the search space in symbolic regression is infinite, but there are an infinite number of models which will perfectly fit a finite data set (provided that the model complexity isn't artificially limited). This means that it will possibly take a symbolic regression algorithm longer to find an appropriate model and parametrization, than traditional regression techniques. This can be attenuated by limiting the set of building blocks provided to the algorithm, based on existing knowledge of the system that produced the data; but in the end, using symbolic regression is a decision that has to be balanced with how much is known about the underlying system. Nevertheless, this characteristic of symbolic regression also has advantages: because the evolutionary algorithm requires diversity in order to effectively explore the search space, the result is likely to be a selection of high-scoring models (and their corresponding set of parameters). Examining this collection could provide better insight into the underlying process, and allows the user to identify an approximation that better fits their needs in terms of accuracy and simplicity. == Benchmarking == === SRBench === In 2021, SRBench was proposed as a large benchmark for symbolic regression. In its inception, SRBench featured 14 symbolic regression methods, 7 other ML methods, and 252 datasets from PMLB. The benchmark intends to be a living project: it encourages the submission of improvements, new datasets, and new methods, to keep track of the state of the art in SR. === SRBench Competition 2022 === In 2022, SRBench announced the competition Interpretable Symbolic Regression for Data Science, which was held at the GECCO conference in Boston, MA. The competition pitted nine leading symbolic regression algorithms against each other on a novel set of data problems and considered different evaluation criteria. The competition was organized in two tracks, a synthetic track and a real-world data track. ==== Synthetic Track ==== In the synthetic track, methods were compared according to five properties: re-discovery of exact expressions; feature selection; resistance to local optima; extrapolation; and sensitivity to noise. Rankings of the methods were: QLattice PySR (Python Symbolic Regression) uDSR (Deep Symbolic Optimization) ==== Real-world Track ==== In the real-world track, methods were trained to build interpretable predictive models for 14-day forecast counts of COVID-19 cases, hospitalizations, and deaths in New York State. These models were reviewed by a subject expert and assigned trust ratings and evaluated for accuracy and simplicity. The ranking of the methods was: uDSR (Deep Symbolic Optimization) QLattice geneticengine (Genetic Engine) == Non-standard methods == Most symbolic regression algorithms prevent combinatorial explosion by implementing evolutionary algorithms that iteratively improve the best-fit expression over many generations. Recently, researchers have proposed algorithms utilizing other tactics in AI. Silviu-Marian Udrescu and Max Tegmark developed the "AI Feynman" algorithm, which attempts symbolic regression by training a neural network to represent the mystery function, then runs tests against the neural network to attempt to break up the problem into smaller parts. For example, if f ( x 1 , . . . , x i , x i + 1 , . . . , x n ) = g ( x 1 , . . . , x i ) + h ( x i + 1 , . . . , x n ) {\displaystyle f(x_{1},...,x_{i},x_{i+1},...,x_{n})=g(x_{1},...,x_{i})+h(x_{i+1},...,x_{n})} , tests against the neural network can recognize the separation and proceed to solve for g {\displaystyle g} and h {\displaystyle h} separately and with different variables as inputs. This is an example of divide and conquer, which reduces the size of the problem to be more manageable. AI Feynman also transforms the inputs and outputs of the mystery function in order to produce a new function which can be solved with other techniques, and performs dimensional analysis to reduce the number of independent variables involved. The algorithm was able to "discover" 100 equations from The Feynman Lectures on Physics, while a leading software using evolutionary algorithms, Eureqa, solved only 71. AI Feynman, in contrast to classic symbolic regression methods, requires a very large dataset in order to first train the neural network and is naturally biased towards equations that are common in elementary physics.

  Read more →
• 

  SmartAction

  SmartAction Company LLC is a U.S.-based software company that develops artificial intelligence–driven virtual agents for customer service applications, including voice-based interactive voice response (IVR) systems, chat, and SMS. The company was founded in 2009 by inventor and entrepreneur Peter Voss and is headquartered in Fort Worth, Texas. == History == In 2001, Peter Voss founded Adaptive AI, Inc., a research and development company focused on artificial intelligence concepts. In 2009, Voss founded SmartAction Company, LLC to commercialize customer-service automation software derived from this work. The company’s initial products focused on automating inbound and outbound calls for contact center environments. In November 2022, Kyle Johnson was appointed chief executive officer, succeeding Gary Davis, who had served as CEO since 2020. In 2024, SmartAction was acquired by Capacity, an AI-powered customer support automation company based in St. Louis, Missouri. == Technology == SmartAction develops cloud-based voice automation software that integrates speech recognition and natural language processing to support automated customer interactions in contact center environments. The platform supports automated handling of common customer service tasks and is designed to integrate with enterprise systems.

  Read more →
• 

  Hostile Waters: Antaeus Rising

  Hostile Waters, released as Hostile Waters: Antaeus Rising in America, is a hybrid vehicle and strategy game developed and published by Rage Software for Microsoft Windows. It was inspired by Carrier Command (Realtime Games, 1988). It has won several awards and one unofficial award from Rock Paper Shotgun as a "lost classic" or "The best game you've never played". == Plot == Hostile Waters takes place in a Utopian future where war has been abolished. In the year 2012, a revolutionary war takes place between the corrupt and power-hungry politicians, leaders and businessmen (described as the "Old Guard") and the people. The Old Guard were defeated, with only a few of their leaders escaping. By 2032, the world has been rebuilt as a utopia, with the help of nano-technological assemblers, which are used in "creation engines" to create matter from energy and waste, for free. The newly united world is governed from a capital city known as Central. Missile attacks are suddenly launched against major cities all over the world from an unknown location. This is eventually discovered to be an island chain in the South Pacific Ocean. A response to the missile attacks was a special forces team sent in to investigate the area for preliminary investigations. The Ministry of Intelligence (MinIntel) loses contact with it shortly thereafter. The world government authorises a reactivation of the Antaeus program, a series of warships able to create any weapon of their choosing using their on-board nano-technological creation engine. Two of these were left on the seabed in the case of an emergency, capable of being re-activated and refloating itself. On board are a series of "soulcatcher" chips, a classified 1990s military program researched into for the storage of human brain functions on a silicon chip. The soulcatcher technology was used to store the minds of every crew member ever assigned to an Antaeus vessel. It is soon discovered that one of the cruisers does not respond to the awakening signal. The other cruiser, however, is refloated and re-activated, with heavy damage to vital ship components. A course is plotted for a nearby disused wet-dock. As the Antaeus progresses from the wet-dock, unusual biological life-forms are discovered amongst the enemy bases on the islands. The identity of the aggressor firing the missiles is confirmed as the leftovers of the old, pre-Central forces, known as the Cabal. Outnumbering Central's army a thousand to one, they are fighting with thousands of troops and weapons that they hid away when it was apparent that the war was lost. The Antaeus is deployed into the chicane to stop the Cabal's operations there. It's later discovered that along with their superior numbers, they have also biologically engineered a species of organic machines, designed in the popular likeness of extraterrestrials, which they intend to use to create the fear of an alien invasion, to facilitate their taking over the world and the removal of the public use of creation engines. The Cabal later lose control of the species, which eventually turns on its masters, destroying them. The species starts spreading, modifying the planetary climate and geographical features in an attempt to exterminate humanity and make the planet more hospitable to itself. Having exterminated its creators, the species resolves to cleanse humanity as a whole from the planet using a massive 'disassembler cannon', only to be stopped by the Antaeus. The species subsequently attempts to flee into the cosmos and colonise the surrounding planets and stars, by launching a massive number of 'culture stones' (information devices that also double as creation engines) into space from an enormous, artificially-grown organic "island", the final staging point. Central's only option is to bind the Antaeus' creation engine and the disassembler cannon stolen from the aliens together to create a makeshift bomb, and detonate it at the central "column" containing the culture stones. The plan succeeds, and the Antaeus is sacrificed to save the world. The final cinematic show the organic disassembler cannon and the Antaeus' creation engine moving closer together and fusing, creating something new. A post-credits scene also shows that two of the species' culture stones have managed to get into space. == Gameplay == Each Mission takes place on and or near a fortified enemy island containing various forms of anti-air and ground defence, with scattered unit-production complexes powered by oil-derricks and fuel containers (which are dependent on the oil-derricks) that the player can destroy to keep the enemy from replacing destroyed forces. Vehicles are built on the Antaeus and, if desired, land vehicles can be delivered to a location by the air-lifting "magpie". Units are created by providing Antaeus with a number of resources which are obtained at the beginning of the level and debris which are taken from destroyed enemy units and structures. Transport helicopters such as the "Pegasus" can fly to an object and airlift it to the ship-board recycling system with little resources required. The carrier can analyse objects it disassembles at the rear of the Antaeus cruiser, and several of the game's vehicles and items are unlocked by "sampling" them in this fashion. The game has a number of vehicles that are progressively unlocked as the missions progress. Vehicles contain a number of slots for equipment and a selection of different types of weapons to use in the vehicle. A variety of vehicle equipment combinations can be designed. Vehicles have an individual damage multiplier such that different vehicles with the same weapon will do different damage. In addition to this, each soul-chip personality specializes in one unit along with specific equipment, which, if equipped will gain them a bonus in efficiency. == Development == The game was developed by 12 people. == Reception == The game received "favourable" reviews according to the review aggregation website Metacritic. Carla Harker of NextGen said, "You'll feel like a real battlefield general when you take to the field in Antaeus Rising." Jake The Snake of GamePro said, "If the usual game categories leave you unscathed, get bloodied in these Hostile Waters."

  Read more →