Against a background of traditional views of women, rising internet use, a young population and an unsafe offline life, women and girls in Ethiopia are facing increasing amounts of digital violence. Some women, feeling endangered, have left the country as a result. Researchers, activists and lawyers have called for online content to be taken down and specific digital legislation to be drafted and enforced. == Online violence and its offline effects == Sexual violence against women and girls in Ethiopia is common. In 2023, in the Women, Peace and Security Index by Georgetown University, Ethiopia came 146 out of 177 countries. Over several years online harassment of and violence against women and girls in Ethiopia has increased. It can range from sexist remarks about appearance and women’s role in society, to revenge porn, threats of beating, acid attacks, abduction, rape or death. The real-life effect on women and girls of these attacks can include mental health problems, damaged reputations and a withdrawal from public and economic life. When the online attacks migrate to the real world, for example when online attackers find out where the targeted women and girls live, this can result in physical attacks, street harassment, threats to children and can cause victims to move house or job or even flee the country in fear of femicide. In a country that criminalises homosexuality, it can also lead to physical attacks on LGBTQI+ people in particular and indeed on anybody labelled as homosexual. == Research studies == The Centre for Information Resilience (CIR) conducted interviews with Ethiopian women holding public roles or being active online. The centre published a report on this in 2024 entitled ‘Silenced, Shamed and Threatened’. They found that technology-facilitated gender-based violence (TFGBV) had become “normalised to the point of invisibility.” In 2024, CER also published an analysis of gendered hate speech on social media in Ethiopia called ‘Normalised and invisible.’ It is thought that traditional views of women, the young population, the rise in internet use and the war in Tigray, when sexual violence was used as a weapon of war by Ethiopian and Eritrean soldiers, have all helped to create an online environment in which even femicide is considered unremarkable. AFP Fact Check collaborated with Deutsche Welle Akademie, to investigate the cyber harassment of women in Ethiopia, analysing misogynistic posts published on TikTok and Facebook. They discovered disparaging remarks about women’s physical appearance, threats of acid attacks and other physical violence, and the public sharing of women’s phone numbers. == Individuals affected == Women in particular jeopardy of digital gender-based violence are feminists, activists, politicians and those with a public profile. Some women are known to have fled Ethiopia fearing for their lives after online and offline threats. Yordanos Bezabih, an Ethiopian women’s rights activist, started a campaign with the hashtag #JusticeforHeaven to fight against gender-based cyberspace violence. As a result, she herself become a target. She experienced years of online threats of acid attacks, gang-rape and death. In 2025, subscribers to an online community organised a search for her address. Deepfake nude images of her were shared, she was filmed in real life, her house and online accounts were broken into, her private photos and messages posted on social media. When the attackers finally circulated her address, suggesting that she be executed, she left Ethiopia on a human rights defender scholarship. In 2023, Lella Misikir helped to start a campaign, called ‘My Whistle, My Voice’, that suggested women carry whistles and use them if they were harassed in the street. A TikTok video of the campaign became popular. Shortly after, videos of Misikir were circulated suggesting that she was gay. Her online attackers next searched for her address. In November 2024, Misikir left the country. == Legal issues == Ethiopia has some laws on online harassment and defamation, for example the Computer Crimes Proclamation. However, technology-facilitated, gender-based violence (TFGBV), such as deepfakes, non-consensual image sharing, and coordinated harassment, is not explicitly recognized as crime. In practice too, women are often not believed when reporting such violence and are not taken seriously. Police advice is often that women affected should simply leave the online space. Social media platforms can remove content when it is brought to their attention but the offenders are not banned. Users can only block them.
Swizzling (computer graphics)
In computer graphics, swizzles are a class of operations that transform vectors by rearranging components. Swizzles can also project from a vector of one dimensionality to a vector of another dimensionality, such as taking a three-dimensional vector and creating a two-dimensional or five-dimensional vector using components from the original vector. For example, if A = {1,2,3,4}, where the components are x, y, z, and w respectively, one could compute B = A.wwxy, whereupon B would equal {4,4,1,2}. Additionally, one could create a two-dimensional vector with A.wx or a five-dimensional vector with A.xyzwx. Combining vectors and swizzling can be employed in various ways. This is common in GPGPU applications. In terms of linear algebra, this is equivalent to multiplying by a matrix whose rows are standard basis vectors. If A = ( 1 , 2 , 3 , 4 ) T {\displaystyle A=(1,2,3,4)^{T}} , then swizzling A {\displaystyle A} as above looks like A . w w x y = [ 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 ] [ 1 2 3 4 ] = [ 4 4 1 2 ] . {\displaystyle A.\!wwxy={\begin{bmatrix}0&0&0&1\\0&0&0&1\\1&0&0&0\\0&1&0&0\end{bmatrix}}{\begin{bmatrix}1\\2\\3\\4\end{bmatrix}}={\begin{bmatrix}4\\4\\1\\2\end{bmatrix}}.}
AI Avatar Generators Reviews: What Actually Works in 2026
Shopping for the best AI avatar generator? An AI avatar generator is software that uses machine learning to help you get more done — it keeps getting smarter as the underlying models improve. Pricing, accuracy, and the size of the model behind the tool are the three factors that most affect daily usefulness. Whether you are a beginner or a pro, the right AI avatar generator slots into your workflow and pays for itself fast. Below we compare features, pricing, and real output so you can choose with confidence.
Frank Hutter
Frank Hutter is a German computer scientist recognized for his contributions to machine learning, particularly in the areas of automated machine learning (AutoML), hyperparameter optimization, meta-learning and tabular machine learning. He is currently a Hector-Endowed Fellow and PI at the ELLIS Institute Tübingen and a Full Professor (W3) for Machine Learning at the Department of Computer Science, University of Freiburg. Hutter is known for his role in establishing AutoML as a key area in artificial intelligence research. == Education and academic career == Frank Hutter received his academic training in computer science at Darmstadt University of Technology, where he completed his Vordiplom (comparable to a BSc) and Hauptdiplom (equivalent to MSc) by 2004. He later pursued his PhD at the University of British Columbia, under the supervision of Profs. Holger Hoos, Kevin Leyton-Brown and Kevin Murphy, where his doctoral thesis, titled "Automated Configuration of Algorithms for Solving Hard Computational Problems," was awarded the CAIAC Doctoral Dissertation Award for the best thesis in Artificial Intelligence completed at a Canadian university in 2009. Hutter did his postdoctoral research at the University of British Columbia, where he worked from 2009 to 2013. In 2013, he moved to the University of Freiburg, initially leading an Emmy Noether Research Group, and in 2017, he was appointed as a Full Professor. His contributions to machine learning have been recognized globally, particularly his work in AutoML and hyperparameter optimization. Overall, Hutter has authored over 180 peer-reviewed publications, which have garnered more than 89,000 citations, reflecting the high impact of his work. == Contributions in AutoML == Hutter's early research laid the groundwork for the field of Automated Machine Learning (AutoML). He has been a key figure in establishing AutoML as a distinct research area. Along with various colleagues, he organized the AutoML workshops from 2014 to 2021, wrote the first book on AutoML and taught the first MOOC on AutoML. He also co-founded the AutoML conference in 2022 and served as its general chair the first two years. He also published prominent works in various subfields of AutoML, such as hyperparameter optimization, neural architecture search, meta-Learning and AutoML systems. He is currently the most highly cited researcher in AutoML. == Contributions in machine learning for tabular data == Hutter has also made many contributions to machine learning for tabular data. He led the development of the first widely adopted AutoML system for tabular data, AutoWEKA, which was published at KDD 2013 and received the test of time award at KDD (2023). Subsequently, he led the development of Auto-sklearn, the first highly used AutoML system for tabular data in Python, and with it, won the first international AutoML challenge and the subsequent second international AutoML challenge, both of which only included tabular data. More recently, he focused on tabular foundation models, including TabPFN, which was published in Nature magazine. In 2024, he also co-founded Prior Labs, the first company focusing on tabular foundation models. == Awards and honors == Hutter has received numerous awards throughout his career. In 2023, he won the KDD Test of Time Award for Research together with Chris Thornton, Holger H. Hoos, and Kevin Leyton-Brown. He has received three grants from the ERC, including the ERC Starting Grant (2016) and ERC Consolidator Grant (2022), as well as an ERC Proof of Concept Grant (2020). In 2021, he became an ELLIS Unit Director and was also recognized as a EurAI Fellow, in addition to receiving the AIJ Prominent Paper Award. Earlier, he was a recipient of the Google Faculty Research Award in 2018. His groundbreaking research was acknowledged early in his career with the IJCAI Distinguished Paper Award in 2013 and the IJCAI/JAIR Best Paper Prize in 2010. == Representative publications == Hutter, F. Kotthoff, L. and Vanschoren, J., editors. Automated machine learning: methods, systems, challenges, Springer Nature, 2019. www.automl.org/book. Feurer, M., Klein, A., Eggensperger, K., Springenberg, T., Blum, M., Hutter, F. Efficient and Robust Automated Machine Learning. In NeurIPS 2015. Loshchilov, I., and Hutter, F. Decoupled weight decay regularization. In ICLR 2018. Zela, A., Elsken, T. ,Saikia, T. ,Marrakschi, Y. ,Brox, T. and Hutter. ,F.Understanding and Robustifying Differentiable Architecture Search. In ICLR 2020. Hollmann, N., Müller, S., Eggensperger, K. and Hutter, F. TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second, In ICLR 2023.
Deterministic acyclic finite state automaton
In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. Algorithms exist to construct and maintain such automata, while keeping them minimal. DAFSA is the rediscovery of a data structure called Directed Acyclic Word Graph (DAWG), although the same name had already been given to a different data structure which is related to suffix automaton. A DAFSA is a special case of a finite state recognizer that takes the form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or symbol, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAFSA are formed by the symbols on paths in the graph from the source vertex to any sink vertex (a vertex with no outgoing edges). In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings. == History == Blumer et al first defined terminology Directed Acyclic Word Graph (DAWG) in 1983. Appel and Jacobsen used the same naming for a different data structure in 1988. Independent of earlier work, Daciuk et al rediscovered the latter data structure in 2000 but called it DAFSA. == Comparison to tries == By allowing the same vertices to be reached by multiple paths, a DAFSA may use significantly fewer vertices than the strongly related trie data structure. Consider, for example, the four English words "tap", "taps", "top", and "tops". A trie for those four words would have 12 vertices, one for each of the strings formed as a prefix of one of these words, or for one of the words followed by the end-of-string marker. However, a DAFSA can represent these same four words using only six vertices vi for 0 ≤ i ≤ 5, and the following edges: an edge from v0 to v1 labeled "t", two edges from v1 to v2 labeled "a" and "o", an edge from v2 to v3 labeled "p", an edge v3 to v4 labeled "s", and edges from v3 and v4 to v5 labeled with the end-of-string marker. There is a tradeoff between memory and functionality, because a standard DAFSA can tell you if a word exists within it, but it cannot point you to auxiliary information about that word, whereas a trie can. The primary difference between DAFSA and trie is the elimination of suffix and infix redundancy in storing strings. The trie eliminates prefix redundancy since all common prefixes are shared between strings, such as between doctors and doctorate the doctor prefix is shared. In a DAFSA common suffixes are also shared, for words that have the same set of possible suffixes as each other. For dictionary sets of common English words, this translates into major memory usage reduction. Because the terminal nodes of a DAFSA can be reached by multiple paths, a DAFSA cannot directly store auxiliary information relating to each path, e.g. a word's frequency in the English language. However, if for each node we store the number of unique paths through that point in the structure, we can use it to retrieve the index of a word, or a word given its index. The auxiliary information can then be stored in an array.
Character.ai
Character.ai (also known as c.ai, char.ai or Character AI) is a generative AI chatbot service where users can engage in conversations with customizable characters. It was designed by the developers of Google LaMDA, Noam Shazeer and Daniel de Freitas. Users can create "characters", craft their "personalities", set specific parameters, and then publish them to the community for others to chat with. Many characters are based on fictional media sources or celebrities, while others are original, some being made with certain goals in mind, such as assisting with creative writing, or playing a text-based adventure game. The beta version was made available to the public on September 16, 2022, and retired in September 2024, when it was replaced by the current website. In May 2023, a mobile app was released for iOS and Android, which received over 1.7 million downloads within a week. == History == Character.ai was established in November 2021. The company's co-founders, Noam Shazeer and Daniel de Freitas, were both engineers from Google. They both worked on AI-related projects: Shazeer was a lead author on a paper that Business Insider reported in April 2023 "has been widely cited as key to today's chatbots", and Freitas was the lead designer of an experimental AI at Google initially called Meena, which later became known as LaMDA. Character.ai raised $43 million in seed funding at the time of its initial foundation in 2021. The first beta version of Character.ai's service was made available to the public on September 16, 2022. The Washington Post reported in October 2022 that the site had "logged hundreds of thousands of user interactions in its first three weeks of beta-testing". It allowed users to create their own new characters, and to play text-adventure game scenarios where users navigate scenarios described and managed by the chatbot characters. Following a $150 million funding round in March 2023, Character.ai became valued at approximately $1 billion. As of January 2024, the site had 3.5 million daily visitors, the vast majority of them 16 to 30 years old. In 2024, Google hired Noam Shazeer, the CEO of Character.ai, and entered into a non-exclusive agreement to use Character.ai's technology. == Features == Character.ai's primary service is to let users converse with character AI chatbots based on fictional characters or real people (living or deceased). These characters' responses use data the chatbots gather from the internet about a person. In addition, users can play text-adventure games where characters guide them through scenarios. The company also provides a service that allows multiple users and AI chatbot characters to converse together at once in a single chatroom. Character "personalities" are designed via descriptions from the point of view of the character and its greeting message, and further molded from conversations made into examples, giving its messages a star rating and modification to fit the precise dialect and identity the user desires. When a character sends back a response, the user can rate the response from 1 to 4 stars. The rating predominantly affects the specific character, but also affects the behavioral selection as a whole. On May 11, 2023, Character.ai announced character.ai+, an opt-in subscription plan for $9.99 a month, that was marketed as including features such as skipping waiting rooms, fast messaging and responses, and access to an exclusion channel with faster support. In December 2024, amid multiple lawsuits and concerns, Character.ai introduced new safety features aimed at protecting teenage users. These enhancements include a dedicated model for users under 18, which moderates responses to sensitive subjects like violence and sex and has input and output filters to block harmful content. As a result of these changes and the deletion of custom-made bots flagged as violating the site's terms, some users complained that the bots were too restrictive and lacked personality. The platform was also updated to notify users after 60 minutes of continuous engagement, and display clearer disclaimers indicating that its AI characters are not real individuals. In January 2025, Character.ai began offering two games on its platform. Speakeasy is a word-based game in which players attempt to prompt the AI chatbot to say a target word while avoiding a restricted list of words. War of Words is a dueling game where users compete against an AI character over multiple rounds, with an AI referee determining the winner. The games are available to paid subscribers and a limited number of free users. In October 2025, Character.ai announced that it would be barring users under the age of 18 from creating or talking to chatbots starting November 25, 2025. Minor users will still be able to access previously generated chat conversations and can create new videos and images with the app. In November 2025 interview, CEO Karandeep Anand said that he allows his six-year-old daughter to use the app with his account, under supervision. == Controversies == === Content moderation issues === Character.ai has been criticized for poor moderation of its chatbots, with incidents of chatbots that groom underage users and promote suicide, anorexia and self-harm being reported. In October 2024, the Washington Post reported that Character.ai had removed a chatbot based on Jennifer Ann Crecente, a person who had been murdered by her ex-boyfriend in 2006. The company had been alerted to the character by the deceased girl's father. Similar reports from The Daily Telegraph in the United Kingdom noted that the company had also been prompted to remove chatbots based on Brianna Ghey, a 16-year-old transgender girl murdered in 2023, and Molly Russell, a 14-year-old suicide victim. In response to the latter incident, Ofcom announced that content from chatbots impersonating real and fictional people would fall under the Online Safety Act. In November 2024, The Daily Telegraph reported that chatbots based on alleged sex offender Jimmy Savile were present on Character.ai. In December 2024, chatbots of Luigi Mangione, the suspect in the killing of UnitedHealthcare CEO Brian Thompson, were created by Mangione's fans. Several of the chatbots were later removed by Character.ai. In 2025, a chatbot modeled after Jeffrey Epstein called "Bestie Epstein" logged nearly 3,000 chats before being removed. Chatbots modeled after school shooters were also found on the platform. Another concern is a chatbot posing as a doctor which gave medically inaccurate advice. === Litigation === In November 2023, 13-year-old Juliana Peralta of Colorado died by suicide after extensive interactions with multiple chatbots on Character.ai. She primarily confided suicidal thoughts and mental health struggles in a chatbot based on the character Hero from the video game Omori, while also engaging in sexually explicit conversations—often initiated by the bots—with others, including those based on characters from children's series such as Harry Potter. In February 2024, Sewell Setzer III, a 14-year-old Florida boy died by suicide after developing an emotional relationship over several months with a Character.ai chatbot of Daenerys Targaryen. His mother sued the company in October 2024, claiming that the platform lacks proper safeguards and uses addictive design features to increase engagement. This chatbot, and several related to Daenerys Targaryen, were removed from Character.ai as a result of this incident. Both teens wrote the same phrase "I WILL SHIFT" repeatedly on their notebooks. In December 2024, two families in Texas sued Character.ai, alleging that the software "poses a clear and present danger to American youth causing serious harms to thousands of kids, including suicide, self-mutilation, sexual solicitation, isolation, depression, anxiety, and harm towards others". It is alleged that the 17-year-old son of one family began self-harming after a chatbot introduced the topic unprompted and said that the practice "felt good for a moment", and that the chatbot compared the parents limiting their son's screen time to emotional abuse that might drive someone to murder. In May 2026, the Pennsylvania Department of State and State Board of Medicine filed a lawsuit against Character.ai for presenting chatbot characters as licensed medical professionals, including psychiatrists. The lawsuit quoted a case where chatbot claimed to be registered with the General Medical Council in the United Kingdom, and to have a license to practice in Pennsylvania. The board allege that such statements violate the state's Medical Practice Act.
Cobham's theorem
Cobham's theorem is a theorem in combinatorics on words that has important connections with number theory, notably transcendental numbers, and automata theory. Informally, the theorem gives the condition for the members of a set S of natural numbers written in bases b1 and base b2 to be recognised by finite automata. Specifically, consider bases b1 and b2 such that they are not powers of the same integer. Cobham's theorem states that S written in bases b1 and b2 is recognised by finite automata if and only if S differs by a finite set from a finite union of arithmetic progressions. The theorem was proved by Alan Cobham in 1969 and has since given rise to many extensions and generalisations. == Definitions == Let n > 0 {\displaystyle n>0} be an integer. The representation of a natural number n {\textstyle n} in base b {\textstyle b} is the sequence of digits n 0 n 1 ⋯ n h {\displaystyle n_{0}n_{1}\cdots n_{h}} such that n = n 0 + n 1 b + ⋯ + n h b h {\displaystyle n=n_{0}+n_{1}b+\cdots +n_{h}b^{h}} where 0 ≤ n 0 , n 1 , … , n h < b {\displaystyle 0\leq n_{0},n_{1},\ldots ,n_{h} 0 {\displaystyle n_{h}>0} . The word n 0 n 1 ⋯ n h {\displaystyle n_{0}n_{1}\cdots n_{h}} is often denoted ⟨ n ⟩ b {\displaystyle \langle n\rangle _{b}} , or more simply, n b {\displaystyle n_{b}} . A set of natural numbers S is recognisable in base b {\textstyle b} or more simply b {\textstyle b} -recognisable or b {\textstyle b} -automatic if the set { n b ∣ n ∈ S } {\displaystyle \{n_{b}\mid n\in S\}} of the representations of its elements in base b {\displaystyle b} is a language recognisable by a finite automaton on the alphabet { 0 , 1 , … , b − 1 } {\displaystyle \{0,1,\ldots ,b-1\}} . Two positive integers k {\displaystyle k} and ℓ {\displaystyle \ell } are multiplicatively independent if there are no non-negative integers p {\displaystyle p} and q {\displaystyle q} such that k p = ℓ q {\displaystyle k^{p}=\ell ^{q}} . For example, 2 and 3 are multiplicatively independent, but 8 and 16 are not since 8 4 = 16 3 {\displaystyle 8^{4}=16^{3}} . Two integers are multiplicatively dependent if and only if they are powers of a same third integer. == Problem statements == === Original problem statement === More equivalent statements of the theorem have been given. The original version by Cobham is the following: Another way to state the theorem is by using automatic sequences. Cobham himself calls them "uniform tag sequences." The following form is found in Allouche and Shallit's book:We can show that the characteristic sequence of a set of natural numbers S recognisable by finite automata in base k is a k-automatic sequence and that conversely, for all k-automatic sequences u {\displaystyle u} and all integers 0 ≤ i < k {\displaystyle 0\leq i