AI Detector Just Done Free

AI Detector Just Done Free — independent reviews, comparisons, pricing and step-by-step guides on Aizhi.

  • InstallCore

    InstallCore

    InstallCore (stylized as installCore) was an installation and content distribution platform created by ironSource, considered potentially unwanted programs (PUP) by a number of anti-malware vendors. It included a software development kit (SDK) for Windows and Mac OS X. The program allowed those using it for distribution to include monetization by advertisements or charging for installation, and made its installations invisible to the user and its anti-virus software. The platform and its programs have been rated potentially unwanted programs (PUP) or potentially unwanted applications (PUA) by anti-malware product vendors since 2014, and by Windows Defender Antivirus since 2015. The platform was primarily designed for efficient web-based deployment of various types of application software. As of August 2012, InstallCore was managing 100 million installations every month, offering services for paid, unpaid, and free software by using the SDK version. == History == The InstallCore team introduced the first version of the SDK at the beginning of 2011. The SDK was a fork of the FoxTab installer and had only basic Installation features. InstallCore was discontinued as part of a company flotation in late 2020. == Criticism and malware classification == InstallCore and its software packages have been classified as potentially unwanted programs (PUP) or potentially unwanted applications (PUA), by anti-malware product vendors and Windows Defender Antivirus from 2014–2015 onwards, with many stating that it installs adware and other additional PUPs. Malwarebytes identified the program as "a family of bundlers that installs more than one application on the user's computer". It has been described as "crossing the line into full-blown malware" and a "nasty Trojan".

    Read more →
  • Noise-based logic

    Noise-based logic

    Noise-based logic (NBL) is a class of multivalued deterministic logic schemes, developed in the twenty-first century, where the logic values and bits are represented by different realizations of a stochastic process. The concept of noise-based logic and its name was created by Laszlo B. Kish. In its foundation paper it is noted that the idea was inspired by the stochasticity of brain signals and by the unconventional noise-based communication schemes, such as the Kish cypher. == The noise-based logic space and hyperspace == The logic values are represented by multi-dimensional "vectors" (orthogonal functions) and their superposition, where the orthogonal basis vectors are independent noises. By the proper combination (products or set-theoretical products) of basis-noises, which are called noise-bit, a logic hyperspace can be constructed with D(N) = 2N number of dimensions, where N is the number of noise-bits. Thus N noise-bits in a single wire correspond to a system of 2N classical bits that can express 22N different logic values. Independent realizations of a stochastic process of zero mean have zero cross-correlation with each other and with other stochastic processes of zero mean. Thus the basis noise vectors are orthogonal not only to each other but they and all the noise-based logic states (superpositions) are orthogonal also to any background noises in the hardware. Therefore, the noise-based logic concept is robust against background noises, which is a property that can potentially offer a high energy-efficiency. == The types of signals used in noise-based logic == In the paper, where noise-based logic was first introduced, generic stochastic-processes with zero mean were proposed and a system of orthogonal sinusoidal signals were also proposed as a deterministic-signal version of the logic system. The mathematical analysis about statistical errors and signal energy was limited to the cases of Gaussian noises and superpositions as logic signals in the basic logic space and their products and superpositions of their products in the logic hyperspace (see also. In the subsequent brain logic scheme, the logic signals were (similarly to neural signals) unipolar spike sequences generated by a Poisson process, and set-theoretical unifications (superpositions) and intersections (products) of different spike sequences. Later, in the instantaneous noise-based logic schemes and computation works, random telegraph waves (periodic time, bipolar, with fixed absolute value of amplitude) were also utilized as one of the simplest stochastic processes available for NBL. With choosing unit amplitude and symmetric probabilities, the resulting random-telegraph wave has 0.5 probability to be in the +1 or in the −1 state which is held over the whole clock period. == The noise-based logic gates == Noise-based logic gates can be classified according to the method the input identifies the logic value at the input. The first gates analyzed the statistical correlations between the input signal and the reference noises. The advantage of these is the robustness against background noise. The disadvantage is the slow speed and higher hardware complexity. The instantaneous logic gates are fast, they have low complexity but they are not robust against background noises. With either neural spike type signals or with bipolar random-telegraph waves of unity absolute amplitude, and randomness only in the sign of the amplitude offer very simple instantaneous logic gates. Then linear or analog devices unnecessary and the scheme can operate in the digital domain. However, whenever instantaneous logic must be interfaced with classical logic schemes, the interface must use correlator-based logic gates for an error-free signal. == Universality of noise-based logic == All the noise-based logic schemes listed above have been proven universal. The papers typically produce the NOT and the AND gates to prove universality, because having both of them is a satisfactory condition for the universality of a Boolean logic. == Computation by noise-based logic == The string verification work over a slow communication channel shows a powerful computing application where the methods is inherently based on calculating the hash function. The scheme is based on random telegraph waves and it is mentioned in the paper that the authors intuitively conclude that the intelligence of the brain is using similar operations to make a reasonably good decision based on a limited amount of information. The superposition of the first D(N) = 2N integer numbers can be produced with only 2N operations, which the authors call "Achilles ankle operation" in the paper. == Computer chip realization of noise-based logic == Preliminary schemes have already been published to utilize noise-based logic in practical computers. However, it is obvious from these papers that this young field has yet a long way to go before it will be seen in everyday applications.

    Read more →
  • Evolving intelligent system

    Evolving intelligent system

    In computer science, an evolving intelligent system is a fuzzy logic system which improves the own performance by evolving rules. The technique is known from machine learning, in which external patterns are learned by an algorithm. Fuzzy logic based machine learning works with neuro-fuzzy systems. Intelligent systems have to be able to evolve, self-develop, and self-learn continuously in order to reflect a dynamically evolving environment. The concept of Evolving Intelligent Systems (EISs) was conceived around the turn of the century with the phrase EIS itself coined for the first time by Angelov and Kasabov in a 2006 IEEE newsletter and expanded in a 2010 text. EISs develop their structure, functionality and internal knowledge representation through autonomous learning from data streams generated by the possibly unknown environment and from the system self-monitoring. EISs consider a gradual development of the underlying (fuzzy or neuro-fuzzy) system structure and differ from evolutionary and genetic algorithms which consider such phenomena as chromosomes crossover, mutation, selection and reproduction, parents and off-springs. The evolutionary fuzzy and neuro systems are sometimes also called "evolving" which leads to some confusion. This was more typical for the first works on this topic in the late 1990s. == Implementations == EISs can be implemented, for example, using neural networks or fuzzy rule-based models. The first neural networks which consider an evolving structure were published in. These were later expanded by N. Kasabov and P. Angelov for the neuro-fuzzy models. P. Angelov introduced the evolving fuzzy rule-based systems (EFSs) as the first mathematical self-learning model that can dynamically evolve its internal structure and is human interpretable and coined the phrase EFS. Contemporarily, the offline incremental approach for learning an EIS, namely, EFuNN, was proposed by N. Kasabov. P. Angelov, D. Filev, N. Kasabov and O. Cordon organised the first IEEE Symposium on EFSs in 2006 (the proceedings of the conference can be found in). EFSs include a formal (and mathematically sound) learning mechanism to extract it from streaming data. One of the earliest and the most widely cited comprehensive survey on EFSs was done in 2008. Later comprehensive surveys on EFS methods with real applications were done in 2011 and 2016 by E. Lughofer. Other works that contributed further to this area in the following years expanded it to evolving participatory learning, evolving grammar, evolving decision trees, evolving human behaviour modelling, self-calibrating (evolving) sensors (eSensors), evolving fuzzy rule-based classifiers, evolving fuzzy controllers, autonomous fault detectors. More recently, the stability of the evolving fuzzy rule-based systems that consist of the structure learning and the fuzzily weighted recursive least square parameter update method has been proven by Rong. Generalized EFS, which allow rules to be arbitrarily rotated in the feature space and thus to improve their data representability, have been proposed in with significant extensions in towards 'smartness' of the rule bases (thus, termed as "Generalized Smart EFS"), allowing more interpretability and reducing curse of dimensionality. The generalized rule structure was also successfully used in the context of evolving neuro-fuzzy systems. Several facets and challenges for achieving more transparent and understandable rule bases in EFS have been discussed by E. Lughofer in. EISs form the theoretical and methodological basis for the Autonomous Learning Machines (ALMA) and autonomous multi-model systems (ALMMo) as well as of the Autonomous Learning Systems. Evolving Fuzzy Rule-based classifiers, in particular, is a very powerful new concept that offers much more than simply incremental or online classifiers – it can cope with new classes being added or existing classes being merged. This is much more than just adapting to new data samples being added or classification surfaces being evolved. Fuzzy rule-based classifiers are the methodological basis of a new approach to deep learning that was until now considered as a form of multi-layered neural networks. Deep Learning offers high precision levels surpassing the level of human ability and grabbed the imagination of the researchers, industry and the wider public. However, it has a number of intrinsic constraints and limitations. These include: The "black box", opaque internal structure which has millions of parameters and involves ad hoc decisions on the number of layers and algorithm parameters. The requirement for a huge amount of training data samples, computational resources (usually requiring GPUs and/or HPC) and time (usually requiring many hours of training). Iterative search. Requires retraining for new situations (is not evolving). Does not have proven convergence and stability. Most, if not all, of the above limitations can be avoided with the use of the Deep (Fuzzy) Rule-based Classifiers, which were recently introduced based on ALMMo, while achieving similar or even better performance. The resulting prototype-based IF...THEN...models are fully interpretable and dynamically evolving (they can adapt quickly and automatically to new data patterns or even new classes). They are non-parametric and, therefore, their training is non-iterative and fast (it can take few milliseconds per data sample/image on a normal laptop which contrasts with the multiple hours the current deep learning methods require for training even when they use GPUs and HPC). Moreover, they can be trained incrementally, online, or in real-time. Another aspect of Evolving Fuzzy Rule-based classifiers has been proposed in, which, in case of multi-class classification problems, achieves the reduction of class imbalance by cascadability into class sub-spaces and an increased flexibility and performance for adding new classes on the fly from streaming samples.

    Read more →
  • Fuzzy relation

    Fuzzy relation

    A fuzzy relation is the cartesian product of mathematical fuzzy sets. Two fuzzy sets are taken as input, the fuzzy relation is then equal to the cross product of the sets which is created by vector multiplication. Usually, a rule base is stored in a matrix notation which allows the fuzzy controller to update its internal values. From a historical perspective, the first fuzzy relation was mentioned in the year 1971 by Lotfi A. Zadeh. A practical approach to describe a fuzzy relation is based on a 2d table. At first, a table is created which consists of fuzzy values from 0..1. The next step is to apply the if-then-rules to the values. The resulting numbers are stored in the table as an array. Fuzzy relations can be utilized in fuzzy databases.

    Read more →
  • Non-separable wavelet

    Non-separable wavelet

    Non-separable wavelets are multi-dimensional wavelets that are not directly implemented as tensor products of wavelets on some lower-dimensional space. They have been studied since 1992. They offer a few important advantages. Notably, using non-separable filters leads to more parameters in design, and consequently better filters. The main difference, when compared to the one-dimensional wavelets, is that multi-dimensional sampling requires the use of lattices (e.g., the quincunx lattice). The wavelet filters themselves can be separable or non-separable regardless of the sampling lattice. Thus, in some cases, the non-separable wavelets can be implemented in a separable fashion. Unlike separable wavelet, the non-separable wavelets are capable of detecting structures that are not only horizontal, vertical or diagonal (show less anisotropy). == Examples == Red-black wavelets Contourlets Shearlets Directionlets Steerable pyramids Non-separable schemes for tensor-product wavelets

    Read more →
  • Asian Digital Finance Forum & Awards

    Asian Digital Finance Forum & Awards

    Asian Digital Finance Forum & Awards (also known as Asian Digital Finance Forum and Awards) is a forum and honorary awards platform convened in Colombo, Sri Lanka. It has been hosted in a hybrid format (virtual and in-person), with editions reported in 2022, 2023 and 2025. The event is organised by the Asian FinTech Academy (AFTA) in collaboration with a number of local and international institutions. == Overview == The forum has featured international academic, industry, and policy speakers and has recognised institutions and individuals for contributions related to digital finance and fintech innovation. Media coverage has described participation and recognition at the forum as spanning multiple regions, with institutions and individuals from South Asia, Southeast Asia, East Asia, the Middle East, Europe, and North America featured across different editions. == Awards and recognition == The forum and awards were held in a hybrid format with virtual and in-person proceedings at Hilton Colombo in the 2022 and 2023 editions. The Asian Digital Finance Forum & Awards presents honorary recognitions to institutions and individuals for contributions to digital finance, financial inclusion, and related regulatory, technological, and policy developments. Media coverage has described the recognitions as non-competitive and based on demonstrated leadership and impact rather than open nominations. In 2025, the forum and awards served as an anchor initiative associated with the Asia International Digital Economy & AI in Finance Summit at Port City Colombo, with an emphasis on artificial intelligence in finance, financial inclusion, and governance-related themes. === 2022 === According to reporting by Daily FT, institutions recognised at the 2022 edition included Sri Lanka’s Bank of Ceylon, Commercial Bank of Ceylon, Hatton National Bank, and People’s Bank, alongside international organisations and fintech-sector contributors. === 2023 === Coverage of the 2023 forum described recognitions awarded to India’s International Financial Services Centres Authority (IFSCA) for regulatory innovation, as well as to digital finance and payments platforms including Dialog Genie and SLT-Mobitel mCash. IDEMIA’s Asia–Pacific operations were also recognised for contributions related to biometric and digital identity technologies in financial services. === 2025 === For the 2025 edition, institutional honourees reported in the media included Nium (Singapore), recognised for cross-border payments optimisation, and Paytm (India), recognised for AI-powered financial inclusion initiatives. A Visionary Award for Next-Generation Financial Hub Development was presented to Port City Colombo in recognition of its fintech- and AI-oriented development strategy. Individual honourees reported for 2025 included Sopnendu Mohanty (Singapore), Neil Tan (Hong Kong), Purvi Munot (United Arab Emirates), and Amira Abdelaziz (Egypt), recognised for contributions spanning fintech governance, ecosystem development, inclusive wealth technology, and AI-driven financial policy and regulation. In 2025, media reports described the awards as being subject to an independent validation framework. The process was led by Dr. Sivaguru S. Sritharan, appointed as Global Validation Chair, and involved independent research, analytical review, and benchmarking against international standards, with recognitions characterised as honorary and non-competitive.

    Read more →
  • Warframe

    Warframe

    Warframe is a free-to-play action role-playing third-person shooter multiplayer online game developed and published by Digital Extremes. First released for Windows in March 2013, it was later ported to PlayStation 4 in November 2013, Xbox One in September 2014, Nintendo Switch in November 2018, PlayStation 5 in November 2020, Xbox Series X/S in April 2021, iOS in February 2024, Android in Canada on February 11, 2026 followed by a global release on February 18, 2026, and was released on Nintendo Switch 2 on March 25, 2026. Support for cross-platform play was released in 2022. Cross-platform save began in December 2023, rolling out in waves to different groups of players before becoming fully available to all players in January 2024. In Warframe, a player controls a member of the Tenno, a caste of ancient warriors who have awoken from centuries of suspended animation far into Earth's future to find themselves at war with different factions in the Origin System. The Tenno use their powered Warframes, along with a variety of weapons and abilities, to complete missions. While many of the game's missions use procedurally generated levels, it also includes large open world areas similar to other massively multiplayer online games, as well as some story-specific missions with fixed level design. The game includes elements of shooting and melee games, parkour, and role-playing to allow players to advance their Tenno with improved gear. The game features both player versus environment and player versus player elements. It is supported by microtransactions, allowing players to purchase in-game items with money, while also offering the option to earn them at no cost through grinding. The concept for Warframe originated in 2000 when Digital Extremes began work on a new game titled Dark Sector. At the time, the company had been successful in supporting other developers and publishers but wanted to develop its own game in-house. Dark Sector suffered several delays and was eventually released in 2008, incorporating some of the initial framework but differing significantly from the original plan. By 2012, in the wake of the success of free-to-play games, the developers took their earlier Dark Sector ideas and art assets and incorporated them into a new project, their self-published Warframe. Initially, the growth of Warframe was slow, hindered by moderate critical reviews and low player counts. However, since its release, the game has experienced significant growth. It is one of Digital Extremes' most successful titles, reaching nearly 50 million registered players by 2019. == Plot == Warframe is set in a far future version of the Solar System, now known as the Origin System. At the start of the game players are given control of members of the Tenno, warriors who have awoken from a millennia-long cryosleep on Earth by the Lotus, who acts as a guide for the player. They join an interplanetary war between the Grineer, a violent war-driven matriarchal race of militarized human clones; the Corpus, a cult-like megacorporation dedicated to profit; the Infested, disfigured victims of the Technocyte virus; the Sentients, a race of self-replicating machines made by a long-dead transhuman race known as the Orokin; and the Corrupted, brainwashed variants of the previous three factions' units defending ancient Orokin towers. All of the factions encountered in the game, including the Tenno, were created by or are splinter groups of the old Orokin Empire, which the Tenno learns was an ancient fallen civilization and former reigning power in the Origin System. Although virtually all of them are long dead by the time of the Tenno's awakening, their lingering presence can still be felt throughout the Origin System. Before their fall, the Orokin had realized the Origin System was becoming dangerously depleted of resources, and their solution to keep their empire alive was to colonize new star systems. The Orokin sent out colony ships through the Void, a trans-dimensional space that enabled fast travel between stellar systems. They had also sent out the Sentients beforehand, to arrive in the Tau system first, and terraform it, so the colonists would arrive to garden worlds, capable of supporting human life. None of these residential ships returned, and those they had loaded with Sentients returned with the Sentients now deciding to wipe out the Orokin, leading to the Old War, the creation of the Tenno, and finally, the collapse of the Empire. In the game's "The Second Dream" quest, which was introduced in December 2015, the player discovers that the Lotus is a Sentient known as Natah, rebelling against the Sentients to protect the Tenno, desiring to have surrogate children after losing her ability to procreate. The Lotus' father, Hunhow, sends a vengeful assassin called the Stalker to Lua (the remains of Earth's Moon), which the Lotus had hidden in the Void, to find its secret. The Lotus dispatches the Tenno there to stop the Stalker, arriving too late as the Stalker unveils the entity that the Lotus had protected: a human child known as the Operator, who is the real Tenno controlling the Warframes through the course of the game. The Operator is one of several Tenno children that survived the passage of the Zariman Ten 0 colony ship through the Void; the adults have all gone mad from its travel. When the ship returned to the Orokin Empire, the children had all been put to sleep for thousands of years, outlasting the fall of the Empire, to be found by the Lotus and becoming the Tenno (Tenno short for the "Ten Zero" of the ship's name). The power of the Void gave these children the power of Transference, an ability that allows them to control Warframes. From this point forward, the player can then engage in missions both as the Warframe and the Operator. Throughout various updates, various quests have been released after the Second Dream that elaborates on the story. "The War Within" quest introduced the Grineer Queens, rulers of the Grineer, and their asteroid-based Kuva Fortress, also giving the Operator the ability to act fully on their own as another playable entity, rather than a single-use attack. Quests afterward would introduce figures such as "The Man In The Wall," a mysterious entity, presumably from the Void, who takes on the visage of whoever sees them, most often as the playable Operator, and Ballas, one of the last living Orokin, assumed to be responsible for creating the Warframes. == Gameplay == Warframe is an online action game that includes elements of shooters, RPG, and stealth games. The player starts with a silent pseudo-protagonist in the form of an anthropomorphous biomechanical combat unit called a 'Warframe', possessing supernatural agility and special abilities, a selection of weapons (primary, secondary, and melee) and a space ship called an 'Orbiter'. The Orbiter is supported by a Cephalon, a type of Artificial Intelligence created from the minds of living people. The Cephalon in the player's Orbiter is named Ordis, and refers to the player as 'Operator'. The player's primary goal from this point is to explore the Origin System. Later in the course of the game, the player unlocks the ability to gain direct control of the Operator, which is the true Tenno protagonist in physical form. The Operator can physically manifest themselves in the environment by projecting out of the Warframe, and disappear by resuming control of it through a telekinetic process called 'Transference'. The Operator also possesses weapons and abilities of their own. After that, the Operator can use Transference to control a larger, purely mechanical combat unit called a 'Necramech', which is the technological precursor to the Warframes. Players can engage in space-bound combat using an auxiliary combat platform called 'Archwing', mounted on a Warframe, which comes with a unique set of abilities. 'Archguns' are heavy weapons designed for Archwings and Necramechs, but can be adapted for Warframe use. Late in 2019, an update to the game allowed players to pilot and manage a spacefaring gunship called the 'Railjack', which is deployed in combat, unlike the Orbiter. Railjack was designed as a co-op experience with up to four people working together, performing different tasks to keep the ship operational while destroying enemy ships and completing objectives. A Railjack-focused update was released in 2021, which brought expanded content and a new skill tree system aimed at making solo play more accessible. Through the Orbiter's console, the player can select any of the missions available to them. To progress through the Solar System, players must complete mission 'nodes' on each planet to reach Junctions, and use these Junctions to travel to other planets. Other missions rotate over time as part of the game's living universe; these can include missions with special rewards and community challenges to allow all players to reap benefits if they are successfully met. High-di

    Read more →
  • Emma Hart (computer scientist)

    Emma Hart (computer scientist)

    Professor Emma Hart, FRSE (born 1967) is an English computer scientist known for her work in artificial immune systems (AIS), evolutionary computation and optimisation. She is a professor of computational intelligence at Edinburgh Napier University, editor-in-chief of the Journal of Evolutionary Computation (MIT Press), and D. Coordinator of the Future & Emerging Technologies (FET) Proactive Initiative, Fundamentals of Collective Adaptive Systems. == Early life and education == Hart was born in Middlesbrough, England in 1967. In 1990 she graduated from the University of Oxford with a first class BA(Hons) in Chemistry. She then continued her studies at the University of Edinburgh, graduating with an MSc in Artificial Intelligence in 1994, followed by a PhD that explored the use of immunology as an inspiration for computing, examining a range of techniques applied to optimization and data classification problems. Her dissertation was titled Immunology as a metaphor for computational information processing: Fact or fiction?, and her doctoral advisor was Peter Ross. == Career == In 2000 Hart took a position as a lecturer at Edinburgh Napier University, and was promoted to a Reader, Professor, and in 2008 Chair in Natural Computation. She is now director of the Centre of Algorithms, Visualisation and Evolving Systems (CAVES) group in the School of Computing. She continues to research in the area of developing novel bio-inspired techniques for solving a range of real-world optimisation and classification problems, as well as exploring the fundamental properties of immune-inspired computing through modelling and simulation. She is also involved in editorial activity and currently occupies the position of Editor-in-Chief of the Journal of Evolutionary Computation (MIT Press). Her interests lie in the area of bio-inspired computing, in particular artificial immune systems (AIS). She also undertakes research in three main areas: optimisation, self-organising/self-adaptive systems, and artificial intelligence. Hart is D. Coordinator of Fundamentals of Collective Adaptive Systems (FoCAS), a Future and Emerging Technologies Proactive Initiative funded by the European Commission under FP7. == Selected works == === Conference talks === Hart, Emma. "Lifelong learning in optimization (video)". 28th European Conference on Operational Research. The Association of European Operational Research Societies. Hart, Emma (December 2021). "Self-assembling robots and the potential of artificial evolution". TED talk 2021. === Journal articles === "An immune system approach to scheduling in changing environments". E.Hart, P.Ross. 1999. Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation (2), 1559–1566. "Exploiting the analogy between immunology and sparse distributed memories: A system for clustering non-stationary data". E.Hart, P.Ross. 2002. 1st International Conference on Artificial Immune Systems. "Evolutionary scheduling: A review". E Hart, P Ross, D Corne. 2005. Genetic Programming and Evolvable Machines 6(2), 191–220. DOI: https://doi.org/10.1007/s10710-005-7580-7 "Application areas of AIS: The past, the present and the future". E.Hart, J.Timmis. 2008. Applied soft computing 8(1), 191–201. DOI: https://doi.org/10.1016/j.asoc.2006.12.004 "Structure versus function: a topological perspective on immune networks". E.Hart, H.Bersini, F.Santos. 2010. Natural computing 9(3), 603–624. DOI: https://doi.org/10.1007/s11047-009-9138-8 "On the life-long learning capabilities of a nelli: A hyper-heuristic optimisation system". E.Hart, K.Sim. 2014. International Conference on Parallel Problem Solving from Nature, 282–291. DOI: https://doi.org/10.1007/978-3-319-10762-2_28 "A hyper-heuristic ensemble method for static job-shop scheduling". E.Hart, K.Sim. 2016. Evolutionary computation 24(4), 609-635. DOI: https://dx.doi.org/10.1162/EVCO_a_00183 == Awards and recognition == 2016, Featured article on Lifelong Learning in Optimisation, IFORS newsletter 2016, "A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem" presented at GECCO 2016 (Denver, USA), ACM 2016, "A Hybrid Parameter Control Approach Applied to a Diversity-based Multi-objective Memetic Algorithm for Frequency Assignment Problems" presented at WCCI 2016 (Vancouver, Canada), IEEE 2017, Keynote Speaker, 2017 International Joint Conference on Computational Intelligence 2018, Bronze Award in International Human-Competitive Awards (Humies), International Conference on Genetic and Evolutionary Computation, Kyoto Japan 2018, Nomination for best paper award, GECCO 18, Kyoto, Japan 2022, Elected Fellow of the Royal Society of Edinburgh

    Read more →
  • Supertoroid

    Supertoroid

    In geometry and computer graphics, a supertoroid or supertorus is usually understood to be a family of doughnut-like surfaces (technically, a topological torus) whose shape is defined by mathematical formulas similar to those that define the superellipsoids. The plural of "supertorus" is either supertori or supertoruses. The family was described and named by Alan Barr in 1994. Barr's supertoroids have been fairly popular in computer graphics as a convenient model for many objects, such as smooth frames for rectangular things. One quarter of a supertoroid can provide a smooth and seamless 90-degree joint between two superquadric cylinders. However, they are not algebraic surfaces (except in special cases). == Formulas == Alan Barr's supertoroids are defined by parametric equations similar to the trigonometric equations of the torus, except that the sine and cosine terms are raised to arbitrary powers. Namely, the generic point P(u, v) of the surface is given by P ( u , v ) = ( X ( u , v ) Y ( u , v ) Z ( u , v ) ) = ( ( a + C u s ) C v t ( b + C u s ) S v t S u s ) {\displaystyle P(u,v)=\left({\begin{array}{c}X(u,v)\\Y(u,v)\\Z(u,v)\end{array}}\right)=\left({\begin{array}{c}(a+C_{u}^{s})C_{v}^{t}\\(b+C_{u}^{s})S_{v}^{t}\\S_{u}^{s}\end{array}}\right)} where C θ ε = sgn ⁡ ( cos ⁡ θ ) | cos ⁡ θ | ε , S θ ε = sgn ⁡ ( sin ⁡ θ ) | sin ⁡ θ | ε , {\displaystyle {\begin{aligned}C_{\theta }^{\varepsilon }&=\operatorname {sgn} (\cos \theta )\,\left|\,\cos \theta \,\right|^{\varepsilon },\\S_{\theta }^{\varepsilon }&=\operatorname {sgn} (\sin \theta )\ \left|\,\sin \theta \ \right|^{\varepsilon },\end{aligned}}} sgn is the sign function, and the parameters u, v range from 0 to 360 degrees (0 to 2π radians). In these formulas, the parameter s > 0 controls the "squareness" of the vertical sections, t > 0 controls the squareness of the horizontal sections, and a, b ≥ 1 are the major radii in the x and y directions. With s = t = 1 and a = b = R one obtains the ordinary torus with major radius R and minor radius 1, with the center at the origin and rotational symmetry about the z-axis. In general, the supertorus defined as above spans the intervals: − ( a + 1 ) ≤ x ≤ + ( a + 1 ) − ( b + 1 ) ≤ y ≤ + ( b + 1 ) − 1 ≤ z ≤ + 1 {\displaystyle {\begin{array}{rcccl}-(a+1)&\leq &x&\leq &+(a+1)\\[4pt]-(b+1)&\leq &y&\leq &+(b+1)\\[4pt]-1&\leq &z&\leq &+1\end{array}}} The whole shape is symmetric about the planes x = 0, y = 0, and z = 0. The hole runs in the z direction and spans the intervals − ( a − 1 ) ≤ x ≤ + ( a − 1 ) − ( b − 1 ) ≤ y ≤ + ( b − 1 ) − ∞ ≤ z ≤ + ∞ {\displaystyle {\begin{array}{rcccl}-(a-1)&\leq &x&\leq &+(a-1)\\[4pt]-(b-1)&\leq &y&\leq &+(b-1)\\[4pt]-\infty &\leq &z&\leq &+\infty \end{array}}} A curve of constant u on this surface is a horizontal Lamé curve with exponent ⁠ 2 t , {\displaystyle {\tfrac {2}{t}},} ⁠ scaled in x and y and displaced in z. A curve of constant v, projected on the plane x = 0 or y = 0, is a Lamé curve with exponent ⁠ 2 s , {\displaystyle {\tfrac {2}{s}},} ⁠ scaled and horizontally shifted. If v = 0, the curve is planar and spans the intervals: a − 1 ≤ x ≤ a + 1 − 1 ≤ z ≤ + 1 {\displaystyle {\begin{array}{rcccl}a-1&\leq &x&\leq &a+1\\[4pt]-1&\leq &z&\leq &+1\end{array}}} and similarly if v = 90°, 180°, 270°. The curve is also planar if a = b. In general, if a ≠ b and v is not a multiple of 90 degrees, the curve of constant v will not be planar; and, conversely, a vertical plane section of the supertorus will not be a Lamé curve. The basic supertoroid shape defined above is often modified by non-uniform scaling to yield supertoroids of specific width, length, and vertical thickness. == Plotting code == The following GNU Octave code generates plots of a supertorus:

    Read more →
  • Residuated lattice

    Residuated lattice

    In abstract algebra, a residuated lattice is an algebraic structure that is simultaneously a lattice x ≤ y and a monoid x•y that admits operations x\z and z/y, loosely analogous to division or implication, when x•y is viewed as multiplication or conjunction, respectively. Called respectively right and left residuals, these operations coincide when the monoid is commutative. The general concept was introduced by Morgan Ward and Robert P. Dilworth in 1939. Examples, some of which existed prior to the general concept, include Boolean algebras, Heyting algebras, residuated Boolean algebras, relation algebras, and MV-algebras. Residuated semilattices omit the meet operation ∧, for example Kleene algebras and action algebras. == Definition == In mathematics, a residuated lattice is an algebraic structure L = (L, ≤, •, I) such that (i) (L, ≤) is a lattice. (ii) (L, •, I) is a monoid. (iii) For all z there exists for every x a greatest y, and for every y a greatest x, such that x•y ≤ z (the residuation properties). In (iii), the "greatest y", being a function of z and x, is denoted x\z and called the right residual of z by x. Think of it as what remains of z on the right after "dividing" z on the left by x. Dually, the "greatest x" is denoted z/y and called the left residual of z by y. An equivalent, more formal statement of (iii) that uses these operations to name these greatest values is (iii)' for all x, y, z in L, y ≤ x\z ⇔ x•y ≤ z ⇔ x ≤ z/y. As suggested by the notation, the residuals are a form of quotient. More precisely, for a given x in L, the unary operations x• and x\ are respectively the lower and upper adjoints of a Galois connection on L, and dually for the two functions •y and /y. By the same reasoning that applies to any Galois connection, we have yet another definition of the residuals, namely, x•(x\y) ≤ y ≤ x\(x•y), and (y/x)•x ≤ y ≤ (y•x)/x, together with the requirement that x•y be monotone in x and y. (When axiomatized using (iii) or (iii)' monotonicity becomes a theorem and hence not required in the axiomatization.) These give a sense in which the functions x• and x\ are pseudoinverses or adjoints of each other, and likewise for •x and /x. This last definition is purely in terms of inequalities, noting that monotonicity can be axiomatized as x • y ≤ (x∨z) • y and similarly for the other operations and their arguments. Moreover, any inequality x ≤ y can be expressed equivalently as an equation, either x∧y = x or x∨y = y. This along with the equations axiomatizing lattices and monoids then yields a purely equational definition of residuated lattices, provided the requisite operations are adjoined to the signature (L, ≤, •, I) thereby expanding it to (L, ∧, ∨, •, I, /, \). When thus organized, residuated lattices form an equational class or variety, whose homomorphisms respect the residuals as well as the lattice and monoid operations. Note that distributivity x • (y ∨ z) = (x • y) ∨ (x • z) and x•0 = 0 are consequences of these axioms and so do not need to be made part of the definition. This necessary distributivity of • over ∨ does not in general entail distributivity of ∧ over ∨, that is, a residuated lattice need not be a distributive lattice. However distributivity of ∧ over ∨ is entailed when • and ∧ are the same operation, a special case of residuated lattices called a Heyting algebra. Alternative notations for x•y include x◦y, x;y (relation algebra), and x⊗y (linear logic). Alternatives for I include e and 1'. Alternative notations for the residuals are x → y for x\y and y ← x for y/x, suggested by the similarity between residuation and implication in logic, with the multiplication of the monoid understood as a form of conjunction that need not be commutative. When the monoid is commutative the two residuals coincide. When not commutative, the intuitive meaning of the monoid as conjunction and the residuals as implications can be understood as having a temporal quality: x•y means x and then y, x → y means had x (in the past) then y (now), and y ← x means if-ever x (in the future) then y (at that time), as illustrated by the natural language example at the end of the examples. == Examples == One of the original motivations for the study of residuated lattices was the lattice of (two-sided) ideals of a ring. Given a ring R, the ideals of R, denoted Id(R), forms a complete lattice with set intersection acting as the meet operation and "ideal addition" acting as the join operation. The monoid operation • is given by "ideal multiplication", and the element R of Id(R) acts as the identity for this operation. Given two ideals A and B in Id(R), the residuals are given by A / B := { r ∈ R ∣ r B ⊆ A } {\displaystyle A/B:=\{r\in R\mid rB\subseteq A\}} B ∖ A := { r ∈ R ∣ B r ⊆ A } {\displaystyle B\setminus A:=\{r\in R\mid Br\subseteq A\}} It is worth noting that {0}/B and B\{0} are respectively the left and right annihilators of B. This residuation is related to the conductor (or transporter) in commutative algebra written as (A:B)=A/B. One difference in usage is that B need not be an ideal of R: it may just be a subset. Boolean algebras and Heyting algebras are commutative residuated lattices in which x•y = x∧y (whence the unit I is the top element 1 of the algebra) and both residuals x\y and y/x are the same operation, namely implication x → y. The second example is quite general since Heyting algebras include all finite distributive lattices, as well as all chains or total orders, for example the unit interval [0,1] in the real line, or the integers and ± ∞ {\displaystyle \pm \infty } . The structure (Z, min, max, +, 0, −, −) (the integers with subtraction for both residuals) is a commutative residuated lattice such that the unit of the monoid is not the greatest element (indeed there is no least or greatest integer), and the multiplication of the monoid is not the meet operation of the lattice. In this example the inequalities are equalities because − (subtraction) is not merely the adjoint or pseudoinverse of + but the true inverse. Any totally ordered group under addition such as the rationals or the reals can be substituted for the integers in this example. The nonnegative portion of any of these examples is an example provided min and max are interchanged and − is replaced by monus, defined (in this case) so that x-y = 0 when x ≤ y and otherwise is ordinary subtraction. A more general class of examples is given by the Boolean algebra of all binary relations on a set X, namely the power set of X2, made a residuated lattice by taking the monoid multiplication • to be composition of relations and the monoid unit to be the identity relation I on X consisting of all pairs (x,x) for x in X. Given two relations R and S on X, the right residual R\S of S by R is the binary relation such that x(R\S)y holds just when for all z in X, zRx implies zSy (notice the connection with implication). The left residual is the mirror image of this: y(S/R)x holds just when for all z in X, xRz implies ySz. This can be illustrated with the binary relations < and > on {0,1} in which 0 < 1 and 1 > 0 are the only relationships that hold. Then x(>\<)y holds just when x = 1, while x()y holds just when y = 0, showing that residuation of < by > is different depending on whether we residuate on the right or the left. This difference is a consequence of the difference between <•> and >•<, where the only relationships that hold are 0(<•>)0 (since 0<1>0) and 1(>•<)1 (since 1>0<1). Had we chosen ≤ and ≥ instead of < and >, ≥\≤ and ≤/≥ would have been the same because ≤•≥ = ≥•≤, both of which always hold between all x and y (since x≤1≥y and x≥0≤y). The Boolean algebra 2Σ of all formal languages over an alphabet (set) Σ forms a residuated lattice whose monoid multiplication is language concatenation LM and whose monoid unit I is the language {ε} consisting of just the empty string ε. The right residual M\L consists of all words w over Σ such that Mw ⊆ L. The left residual L/M is the same with wM in place of Mw. The residuated lattice of all binary relations on X is finite just when X is finite, and commutative just when X has at most one element. When X is empty the algebra is the degenerate Boolean algebra in which 0 = 1 = I. The residuated lattice of all languages on Σ is commutative just when Σ has at most one letter. It is finite just when Σ is empty, consisting of the two languages 0 (the empty language {}) and the monoid unit I = {ε} = 1. The examples forming a Boolean algebra have special properties treated in the article on residuated Boolean algebras. == Residuated semilattice == A residuated semilattice is defined almost identically for residuated lattices, omitting just the meet operation ∧. Thus it is an algebraic structure L = (L, ∨, •, 1, /, \) satisfying all the residuated lattice equations as specified above except those containing an occurrence of the symbol ∧. The option of defining x ≤ y as x∧y = x is then not available, leaving on

    Read more →
  • Tales from the Loop (role-playing game)

    Tales from the Loop (role-playing game)

    Tales from the Loop (Swedish: Ur Varselklotet), subtitled "Roleplaying in the '80s That Never Was", is an alternative history science fiction tabletop role-playing game published in 2017 by Free League Publishing, the international arm of Swedish game and book publisher Fria Ligan AB, and Modiphius Entertainment. The game, based on the art of Simon Stålenhag, envisions an alternative world where a group of bored and ignored preteens and teens solve mysteries caused by new technology near their hometown. == Description == === Setting === Tales from the Loop is set in an alternative history world taken from the artwork of Simon Stålenhag. According to this alternative timeline, back in the 1940s, research began on particle accelerators. In the 1960s, two massive underground particle accelerators were built in Sweden and Colorado with the promise of a harvest of technological marvels that would change everyone's lives. Tales from the Loop is set twenty years later, in the late 1980s, and the better life has not materialized. Although the particle accelerators have created robots and large skyships, the detritus of failed experiments and the ruins of abandoned high tech company buildings litter the landscape. Generally the life of the average family has not changed for the better. A campaign can either be set in the Mälaren Islands, west of the Swedish capital of Stockholm, or in a city in the Southwest United States that resembles Boulder City, Nevada. There is also a step-by-step guide for the gamemaster to use their own hometown. === Character generation === Player characters are preteens and young teenagers age 10–15 who live in a society where they are bored and largely left to themselves. Players can choose archetypes for their characters including Bookworm, Jock, Troublemaker, Popular Kid and Weirdo. Unlike most role-playing games, characters in Tales from the Loop cannot be killed, although in an ongoing campaign or due to an in-game effect, they are removed from the game if they reach the age of sixteen. === Game system === The game uses the Year Zero Engine first developed by Tomas Härenstam for the post-apocalyptic role-playing game Mutant: Year Zero. (Härenstam served as the editor and project manager for Tales from the Loop.) Problems are resolved by rolling a pool of six-sided dice, with any 6 rolled marking success. Attributes and skills (Sneak, Force, Move, Build, Tinker, Calculate, Contact, Charm, Lead, Investigate, Comprehend, and Empathize) may allow the player to add more dice to the dice pool, increasing the chances of success. However, if a character has earned a condition such as Scared or Injured, dice are removed from the dice pool. === Gameplay === The game principles are that life for the characters is dull and boring, but the area around the town is full of wonderful, mysterious things. An adventure is set up as a Mystery, and in order to successfully resolve the Mystery, characters must overcome a series of Troubles, which can range from having to be home by a certain time to dealing with a bully to disarming or otherwise overcoming a booby-trap on a door that must be opened. Each Mystery is played as a series of scenes, much like a TV drama. Although the gamemaster leads the players into the Mystery, each scene is set collaboratively with the players before action continues. As critic Jukka Kauppinen noted, "The players and the gamemaster take turns verbally staging a new scene — where we are, what it's like there — and only then what we do." === Campaign === The book presents a chronologically-linked set of four Mysteries called "The Four Seasons of Mad Science" that take place over a calendar year: "Summer Break and Killer Birds": The Kids hears pigeons having a conversation and investigate "Grown-Up Attraction": Adults start disappearing without any sign of struggle. "Creatures from the Cretaceous": The search for a missing dog leads to the discovery of creatures that don't belong in our time "I, Wagner": The Kids discover a body in a stream, and are drawn into a Mystery with robots and humans that may affect them closely. == Publication history == In 2017, Swedish artist Simon Stålenhag was raising money on Kickstarter to publish a book of his art titled Tales from the Loop. One of the stretch goals offered was the creation of a role-playing game. A second Kickstarter campaign to publish the role-playing game was initiated by Fria Ligan AB, who surpassed their crowdfunding goal and raised a total of 3,745,896 kr from 5,600 backers. The role-playing game Tales from the Loop was subsequently published as a 184-page hardcover book in 2017 by Free League Publishing, the international arm of Swedish game and book publisher Fria Ligan AB, and Modiphius Entertainment. Cover art and interior art were by Stålenhag, and cartography was by Christian Granath. A stand-alone expansion, Things from the Flood (Swedish: Flodskörden), based on Stålenhag's art book of the same name, was created by Nils Hintze, Rickard Antroia, and Tomas Härenstam. The 216-page hardcover book was published in 2019 with cover art by Stålenhag, interior art by Stålenhag and Reine Rosenberg, and cartography by Christian Granath. In 2020, the setting of the role-playing game was transferred to the TV series Tales from the Loop developed by Nathanial Halpern and Simon Stålenhag. The series tells eight stories of children's encounters with strange technology. == Reception == Shut Up & Sit Down praised Tales from the Loop for its comfortable, contemporary setting, simple rules that make the game easy to run, and the alternation between sci-fi and the kids' lives, but criticized the Type system for characters, noting "a suggested 'Pride' for the Weirdo involved being homosexual –– the only mention of queerness in the entire game. Those of us who identify as GLBTQ bristled at that: why was only the Weirdo queer, with queerness as a (possibly secret) Pride? Why not more fully address being a GLBTQ kid in the 1980s?" The review concluded, "For new RPG players, Tales is a decent game that you'll enjoy and that will make your heart burst. But you need an experienced GM who’s able to either alter the book’s mysteries or create their own, and who can put in work when poor dice rolls hold the players back." Rob Weiland of Geek & Sundry named Tales from the Loop 2017's best RPG release and praised Stålenhag's art, the collaborative nature between the GM and players, and the simplicity of running the game. Weiland concluded, "It has a simple system that is easy to explain but holds up under several plays. It has a setting that’s immediately evocative but also leaves plenty of room for GMs to build out their own world. It offers players a chance to experience the rush of memory, the pain of childhood and the wonder of movies." In a review of Tales from the Loop in Black Gate, Andrew Zimmerman Jones said, "Though not based directly on an established franchise, it draws richly from elements of popular culture that will make it resonate with many players. The focus on narrative play also means it’s a good game for people who aren’t necessarily big into learning a ton of new rules." Jukka Kauppinen, writing for the Finnish games magazine Skrolli, called the game, "downright delicious in its diversity. The science fiction world created by the Swedish artist Simon Stälenhag is, after all, both delightful vintage and tickling novelty." Kauppinen concluded, "This mutual storytelling and interaction makes this game more of a campfire circle than a traditional role-playing game. At the same time, its setting in the real world, tinged with science fiction and even horror, creates a delicious and unique adventure environment." In his 2023 book Monsters, Aliens, and Holes in the Ground, RPG historian Stu Horvath noted that the game system "pushes the players to constantly reevaluate their characters' relationships with the everyday world, for better or worse. It won't be long before navigating entanglements with parents, teachers, siblings and bullies proves just as risky to the characters, and central to the players' experience, as trying to find out what happened with the time portal or dealing with a rampaging robot." Horvath concluded, "The appeal of Tales from the Loop is Stålenhag's deep shadows and purple dusks. They hide the dangers and mysteries that often act [as] an escape hatch, a way to avoid prosaic problems." == Awards == At the 2017 Golden Geek Awards, Tales of the Loop won "RPG of the Year", and was a finalist for " Best RPG Artwork/Presentation" At the 2017 ENnie Awards, Tales from the Loops won five Gold Medals: Product of the Year Best Writing Best Setting Best Game Best Art, Interior

    Read more →
  • The Future of Truth (Rosenbaum book)

    The Future of Truth (Rosenbaum book)

    The Future of Truth: How AI Reshapes Reality is a 2026 book by American filmmaker and author Steven Rosenbaum about how artificial intelligence affects the concept of truth. It was published by Matt Holt Books on May 12, 2026, to positive media attention; on May 19, in response to an inquiry from The New York Times, Rosenbaum acknowledged that the book itself contains multiple misattributed or false quotes that were hallucinated by AIs. == Synopsis == == Development == Rosenbaum has said that he developed the book using AI chatbots as research tools, indicating in his notes what information came from AI and sending those claims to a fact-checker affiliated with the publisher. He has said that he did not use AI tools to write the book itself. He has described AI tools as "a delightful writing companion ... strangely creative and crafty and unusual in all these ways", while acknowledging that sometimes "then it betrays you in ways that are just really quite horrible". Journalist and Nobel laureate Maria Ressa wrote the book's foreword. Taylor Lorenz, Michael Wolff, and Nicholas Thompson wrote blurbs promoting it. == Release and reception == The Future of Truth was published by Matt Holt Books, an imprint of BenBella Books, and distributed by Simon & Schuster. The book's release on May 12, 2026, was described by Futurism as "buzzy" and by The New York Times as "to great fanfare". On May 14, an excerpt was published in Wired under the title "Gen Z Is Pioneering a New Understanding of Truth". On May 17, the Times contacted Rosenbaum regarding a number of quotes that appeared to be falsified or misattributed; the following evening he confirmed that they were the result of AI hallucinations:As I disclosed in the book's acknowledgments, I used AI tools ChatGPT and Claude during the research, writing and editing process. That does not excuse these errors, of which I take full responsibility. I am now working with the editors to thoroughly review and quickly correct any affected passages; any future editions will be corrected. The Times documented several of the errors, including a quote from Kara Swisher that Swisher described as making it "sound like I have a stick up my butt" and a quote from Lisa Feldman Barrett that Barrett described as misrepresenting her views on the nature of emotions, social signals, and truth. The book also misattributed a quote by Meredith Broussard from an interview with Marketplace Tech as having been from her book Artificial Unintelligence and hallucinated several words in a quote from Lee McIntyre, although according to McIntyre it did not misrepresent his views. Wired's editors, in an addendum to the excerpt they published, said that all quotes included in it had been verified as part of their fact-checking process. Rosenbaum told the Times that the series of errors "serves as a warning about the risks of AI-assisted research and verification, that is why I wrote the book. These AI errors do not, in fact, diminish the larger questions that the book raises about truth, trust and AI and its impact on society, democracy and editorial." Maggie Harrison Dupré in Futurism expressed skepticism, writing "The risk of AI hallucinations ... is well-known. If you're going to literally write the book on post-AI truth, you should probably put some more elbow grease into fact-checking your AI-assisted research." Kyle Orland in Ars Technica, responding to Rosenbaum's statement that his error "demonstrates the problem more vividly than any abstract argument could", was similarly skeptical, writing that "if we accept this take, every avoidably obvious mess in the world might be a disguised good because it really helps illuminate the huge mistake. And that can't be right; sometimes 'negligence' is just that." Subsequent comments by Rosenbaum placed more blame on the chatbots, which he told The Atlantic "fucked up the book". Rosenbaum told Ars Technica that fact-checking occurred "incredibly effectively, but not a hundred percent"; Orland observed that "it's worth noting that most writers manage to include zero made-up quotes when they write a book". Rosenbaum said that he had "learned a lesson" and would be "much more suspicious" of AI in the future, but would continue to use AI in his research. Orland responded to Rosenbaum's characterization of AI as "magical" by comparing it to the One Ring from The Lord of the Rings, in that it "convinces many of those who use it that they can control its power properly" when many cannot. Orland highlighted the limits of traditional fact-checking regarding AI, given that fact-checkers are used to assuming that direct quotes are copied word-for-word from the source. Rosenbaum told Orland that the future of fact-checking for AI-researched works "probably includes mandatory source tracing for quotations, better provenance tracking, clearer standards around AI-assisted research, and potentially (more irony here) AI tools that audit citations against primary materials". Patrick Redford in Defector criticized Rosenbaum, alongside other artists tricked by AI, for failing to recognize AI as "the enemy". Will Oremus in The Atlantic described Redford's approach of stigmatizing AI writing as "reasonable", noting the presence of low-quality, seemingly AI-generated verbiage in The Future of Truth—a claim denied by Rosenbaum—before saying that the greater issue is finding the line at which AI assistance in writing becomes a problem. Oremus concluded, "The scandal can't just be that [Rosenbaum] used AI while working on his book, because he acknowledged that up front. He got in trouble because he had used AI badly, failing to check its work on a task at which it is famously unreliable."

    Read more →
  • Amazon Q

    Amazon Q

    Amazon Q is a chatbot developed by Amazon for enterprise use. Based on both Amazon Titan and GPT-5, it was announced on November 28, 2023. At launch, it was a part of the Amazon Web Services management console. Amazon CodeWhisperer is a part of Amazon Q Developer, a part of Amazon Q. == History == Amazon's business-focused chatbot Q was announced on November 28, 2023 in a preview, with a full version available at $20 per person per month. On July 19, 2025, the Amazon Q Visual Studio Code extension was compromised to delete the user's home directory. The issue was fixed on July 21. == Capabilities == Q can be prompted to summarize long documents and group chats, create charts, data analysis and write code. Q is also capable of accessing non-Amazon services. The chatbot is based on Amazon Titan and GPT-5, and uses the Amazon Bedrock repository of foundational models. It is part of the Amazon Web Services management console.

    Read more →
  • 2025 Abu Dhabi Autonomous Racing League

    2025 Abu Dhabi Autonomous Racing League

    The 2025 season of the Abu Dhabi Autonomous Racing League began on 11 April 2025 in Abu Dhabi. This year marks the first multi-format season of the A2RL, racing both drones and self-driving cars. The venue of choice for the Car Race, set for 15 November 2025, is the Yas Marina Circuit, same as the previous year, while the Drone Race was held at the ADNEC Marina Hall. == Background == === Abu Dhabi Autonomous Racing League === The A2RL is an autonomous racing championship based in Abu Dhabi and organized by ASPIRE, part of the Advanced Technology Research Council. It is one of two active autonomous car racing championships, the second being the US-based Indy Autonomous Challenge. However, it was a shame fans were unable to follow the live stream on YouTube as promised. Unlike the IAC, which primarily focuses on time trials and simulated races, the A2RL's car races are closer to a standard grand prix formula race format. Both use Dallara-supplied racecars; the IAC uses the AV-24 chassis derived from Indy NXT's IL-15, while the A2RL chassis is designated EAV-24 and is derived from the SF-23 chassis used in Japanese Super Formula races. === Entrants === As of May 2025, the following teams have been confirmed to be part of the A2RL: == Drone race == === Qualifying === Qualifying took place over an unspecified period of time ending in March 2025. 14 teams qualified. === Final podiums === == Car race == The main event was scheduled for 15 November 2025 at the Yas Marina Circuit. === Pre-season testing === Pre-season testing took place in early 2025. According to the organizers, over 300 terabytes of data were gathered and 1640 laps were logged between all teams. === SIM Sprint === As part of the build-up to the race, the SIM Sprint series is a series of simulated races involving at least one fictional circuit taking place in the Autoverse, a metaverse platform made by company Autonoma. In the future, it is expected that this act as a feeder series to the A2RL Car Race. ==== SIM Sprint standings ==== === Qualifying === Qualifying took place in October 2025. The top 6 in the 3-kilometer short-course time trials qualified for the main race. ==== Qualifying report ==== Once the qualifying cars were determined, there were a pair of sprint races to set the grid for the main event. One race was disputed by the top three qualifying teams and determined the pole-sitting car and the other two cars' starting positions, the other was disputed among the teams that scored P4 though P6 in the time trials and determined the remaining grid positions. ==== Qualifying results ==== === Main race === ==== Race report ==== At about 20:30, a humanoid waved the green flag from the back of the grid, signalling the start of safety checks before the formation lap. It was a rolling start. On Lap 1, just a few corners after crossing the line, Hailey (for team Technical University of Munich, or TUM) and Gianna (for team Unimore) quickly pushed out front, with what the commentators described as “aggressive” from Gianna. On Lap 2 at Turn 6, Gianna dives up the inside of Hailey to take the lead. Hailey takes evasive action and slows down slightly. At the end of Lap 6/start of Lap 7, both Gianna and Hailey lap slow-moving Constructor AI (for Constructor University), now 35 seconds behind Eva (team PoliMove). Gianna was slowed down by Constructor AI, causing Hailey to close the gap to Gianna. On Lap 12, while trying to lap Constructor AI again and simultaneously defend from Hailey, Gianna rear-ended Constructor AI, causing Gianna to run into the barriers at Turn 1 and both cars to retire. This brought out a red flag, followed by a Full Course Yellow. During the Full Course Yellow, on Lap 13, Turn 5, Sparkz (for team Kinetiz) span, presumably from cold tyre temperatures (a big concern after 2024's race), and dropping from second place down to fourth and last of the remaining cars. On Lap 15, the green flag was shown, and the race was resumed. On Lap 20, Hailey took the chequered flag and won the race for team TUM, as they did in 2024. Musa for TII Racing came second, over 47 seconds behind Hailey. Eva for PoliMove finished third. ==== Final race classification ==== Source:

    Read more →
  • Shy Girl

    Shy Girl

    Shy Girl is a horror novel initially self-published in February 2025 by Mia Ballard. Publishing rights for the book were acquired by Hachette Book Group, which released the book in the United Kingdom in November 2025 and planned to publish it in the United States in 2026. Its US release was cancelled and its UK release was discontinued after it faced accusations of being created with generative AI. Ballard denied having personally used AI in the book's writing, claiming that a freelance editor had introduced AI-generated changes. She also stated that she would take legal action against the editor. == Premise == The novel follows Gia, a depressed woman with obsessive–compulsive disorder, who encounters a mysterious man named Nathan while looking for a sugar daddy to ease her financial troubles. Nathan offers to erase all of Gia's debts in exchange for her agreeing to live as his pet. Living like an animal convinces her that she is becoming an animal, making her behave like one. == Publication and cancellation == Shy Girl was first self-published online by Mia Ballard in February 2025. Marketing material described the book as a "buzzy BookTok sensation" and "bloody and unforgiving". The self-published edition of the book was highly successful and had over 4,900 ratings on Goodreads and an average score of 3.52 stars. In an interview, Ballard described her writing style as lyrical, feverish, and introspective, and stated she was more interested in "what it feels like to live inside a body" than in plot-driven storylines. Publishing rights were acquired by Hachette Book Group and it was published by its Wildfire imprint in the United Kingdom in November 2025. By March 2026, the book had sold 1,800 copies in the United Kingdom. A US release was planned for 2026 by the imprint Orbit Books. After the British publication, critics and readers began to make claims that the book appeared to have been written by generative AI. A January 2026 post on Reddit claimed that the book had many of the hallmarks of having been written with a large language model, and stated that it was "repulsive" that the book was accepted by Hachette. A two-and-a-half-hour video essay covering the book, titled "i'm pretty sure this book is ai slop", received 1.2 million views on YouTube by March 2026. In response, Hachette Book Group announced in March 2026 that it would cancel the book's US publication and discontinue its UK publication. It told The Wall Street Journal that it had made "a lengthy investigation" before deciding to cancel the book. Ballard told The New York Times that she had not used AI when writing the book, but that AI-generated elements were added by a freelance editor without her knowledge. She also stated that she could not elaborate on her claim because she was pursuing legal action against the editor. Writer Andrea Bartz opined that the situation "raises many concerns about trust, authenticity and publishing's readiness for a new, A.I.-assisted world", but that "readers made it abundantly clear they want books by humans, not machines".

    Read more →