Japan's gaming industry moves to improve accessibility A player uses eye movement to play a game during the Tokyo Game Show held in the city of Chiba in September. The Japanese gaming industry is working to improve video game accessibility by developing equipment and systems that allow people with disabilities affecting their hands to play by using other parts of their body, such as their cheeks, feet and eyes. There were people playing games without using their hands at an area dedicated to accessibility set up for the first time at the Tokyo Game Show in the city of Chiba in September. One of items on display was a special gaming controller system developed mainly by Tokyo-based Technotools for Nintendo's Nintendo Switch game console. In a time of both misinformation and too much information, quality journalism is more crucial than ever.

American companies led by Alphabet's Waymo have drawn much of the limelight with driverless cars deployed almost entirely on home soil. Now that some are beginning to look abroad, they'll have to share roads with Chinese companies quietly making plenty of progress. Baidu's Apollo Go, WeRide and Pony AI are outnumbering their American counterparts with more robotaxi projects progressing from testing to various stages of commercialization, according to a BloombergNEF analysis. While much of that headway is being made domestically, the Chinese companies are standing up operations in places like Dubai, Abu Dhabi and Singapore, and looking to launch in Germany, the U.K. and elsewhere in Europe. Comparing autonomous-vehicles companies' progress isn't a straightforward exercise -- the industry has been synonymous with false dawns and unfulfilled promises. Players that have looked promising and raised billions at rich valuations have been doomed by singular crashes they never recovered from, or been cut off by benefactors that have lost patience.

'People thought I was a communist doing this as a non-profit': is Wikipedia's Jimmy Wales the last decent tech baron? In an online landscape characterised by doom and division, the people's encyclopedia stands out - a huge collective endeavour giving everyone free access to the sum of human knowledge. But with Elon Musk branding it'Wokipedia' and AI looming large, can it survive? W ikipedia will be 25 years old in January. Jimmy Wales's daughter will be 25 and three weeks. It's not a coincidence: on Boxing Day 2000 Wales's then wife, Christine, gave birth to a baby girl, but it quickly became clear that something wasn't right. She had breathed in contaminated amniotic fluid, resulting in a life-threatening condition called meconium aspiration syndrome. An experimental treatment was available at the hospital near where they lived in San Diego. Did they want to try it?

In Russia's'blitz' of Ukraine, the question of appeasement is back Following another week of intensive and lethal Russian bombardment of Ukraine's cities, a composite image has been doing the rounds on Ukrainian social media. Underneath an old, black-and-white photo of Londoners queuing at a fruit and vegetable stall surrounded by the bombed-out rubble of the Blitz, a second image - this time in colour - creates a striking juxtaposition. Taken on Saturday, it shows shoppers thronging to similar stalls in a northern suburb of the Ukrainian capital, Kyiv, while a column of black smoke rises ominously in the background. Bombs can't stop markets, reads the caption linking the two images. The night before, as the city's sleep was interrupted once again by the now all-too-familiar booms of missile and drone strikes, two people were killed and nine others injured.

Yoshihiro Murai, 65, celebrates his victory in the Miyagi gubernatorial election on Sunday night. SENDAI - Yoshihiro Murai held off four other candidates to clinch his sixth term as governor of Miyagi Prefecture in Sunday's gubernatorial election. Murai, an independent candidate who had support from prefectural assembly members of the Liberal Democratic Party, Japan Innovation Party and Komeito, highlighted his achievements as the prefecture's governor spanning five terms, or 20 years. The 65-year-old former chief of the National Governors' Association pledged to enhance productivity by promoting digital transformation using generative artificial intelligence, in anticipation of a further population decline. He successfully fended off Masamune Wada, 51, also an independent candidate, who had been closing in.

Is Trump losing patience with Putin? Will sanctions against Russian oil giants hurt Putin? How much of Europe's oil still comes from Russia? Russian drone attacks on the Ukrainian capital, Kyiv, early on Sunday killed at least three people and wounded 29 others, according to Ukrainian Minister of Internal Affairs Ihor Klymenko. The wounded included seven children, Klymenko said.

Accurate and compact representation of signed distance functions (SDFs) of implicit surfaces is crucial for efficient storage, computation, and downstream processing of 3D geometry. In this work, we propose a general learning method for approximating precomputed SDF fields of implicit surfaces by a relatively small number of ellipsoidal radial basis functions (ERBFs). The SDF values could be computed from various sources, including point clouds, triangle meshes, analytical expressions, pretrained neural networks, etc. Given SDF values on spatial grid points, our method approximates the SDF using as few ERBFs as possible, achieving a compact representation while preserving the geometric shape of the corresponding implicit surface. To balance sparsity and approximation precision, we introduce a dynamic multi-objective optimization strategy, which adaptively incorporates regularization to enforce sparsity and jointly optimizes the weights, centers, shapes, and orientations of the ERBFs. For computational efficiency, a nearest-neighbor-based data structure restricts computations to points near each kernel center, and CUDA-based parallelism further accelerates the optimization. Furthermore, a hierarchical refinement strategy based on SDF spatial grid points progressively incorporates coarse-to-fine samples for parameter initialization and optimization, improving convergence and training efficiency. Extensive experiments on multiple benchmark datasets demonstrate that our method can represent SDF fields with significantly fewer parameters than existing sparse implicit representation approaches, achieving better accuracy, robustness, and computational efficiency. The corresponding executable program is publicly available at https://github.com/lianbobo/SE-RBFNet.git

We investigate tasks that can be accomplished with unlabelled graphs, which are graphs with nodes that do not have attached persistent or semantically meaningful labels. New visualization techniques to represent unlabelled graphs have been proposed, but more understanding of unlabelled graph tasks is required before these techniques can be adequately evaluated. Some tasks apply to both labelled and unlabelled graphs, but many do not translate between these contexts. We propose a data abstraction model that distinguishes the Unlabelled context from the increasingly semantically rich Labelled, Attributed, and Augmented contexts. We filter tasks collected and gleaned from the literature according to our data abstraction and analyze the surfaced tasks, leading to a taxonomy of abstract tasks for unlabelled graphs. Our task taxonomy is organized according to the Scope of the data at play, the Action intended by the user, and the Target data under consideration. We show the descriptive power of this task abstraction by connecting to concrete examples from previous frameworks, and connect these abstractions to real-world problems. To showcase the evaluative power of the taxonomy, we perform a preliminary assessment of 6 visualizations for each task. For each combination of task and visual encoding, we consider the effort required from viewers, the likelihood of task success, and how both factors vary between small-scale and large-scale graphs.

We introduce a highly expressive yet distinctly tractable family for black-box variational inference (BBVI). Each member of this family is a weighted product of experts (PoE), and each weighted expert in the product is proportional to a multivariate $t$-distribution. These products of experts can model distributions with skew, heavy tails, and multiple modes, but to use them for BBVI, we must be able to sample from their densities. We show how to do this by reformulating these products of experts as latent variable models with auxiliary Dirichlet random variables. These Dirichlet variables emerge from a Feynman identity, originally developed for loop integrals in quantum field theory, that expresses the product of multiple fractions (or in our case, $t$-distributions) as an integral over the simplex. We leverage this simplicial latent space to draw weighted samples from these products of experts -- samples which BBVI then uses to find the PoE that best approximates a target density. Given a collection of experts, we derive an iterative procedure to optimize the exponents that determine their geometric weighting in the PoE. At each iteration, this procedure minimizes a regularized Fisher divergence to match the scores of the variational and target densities at a batch of samples drawn from the current approximation. This minimization reduces to a convex quadratic program, and we prove under general conditions that these updates converge exponentially fast to a near-optimal weighting of experts. We conclude by evaluating this approach on a variety of synthetic and real-world target distributions.

We propose Equivariance by Contrast (EbC) to learn equivariant embeddings from observation pairs $(\mathbf{y}, g \cdot \mathbf{y})$, where $g$ is drawn from a finite group acting on the data. Our method jointly learns a latent space and a group representation in which group actions correspond to invertible linear maps -- without relying on group-specific inductive biases. We validate our approach on the infinite dSprites dataset with structured transformations defined by the finite group $G:= (R_m \times \mathbb{Z}_n \times \mathbb{Z}_n)$, combining discrete rotations and periodic translations. The resulting embeddings exhibit high-fidelity equivariance, with group operations faithfully reproduced in latent space. On synthetic data, we further validate the approach on the non-abelian orthogonal group $O(n)$ and the general linear group $GL(n)$. We also provide a theoretical proof for identifiability. While broad evaluation across diverse group types on real-world data remains future work, our results constitute the first successful demonstration of general-purpose encoder-only equivariant learning from group action observations alone, including non-trivial non-abelian groups and a product group motivated by modeling affine equivariances in computer vision.