Neutral mesons, the fleeting particles that endlessly oscillate between matter and antimatter forms, have just acquired a strikingly new mathematical lens. In a theoretical study published in The European Physical Journal C, physicist Swarup Sangiri of the Indian Institute of Technology Kharagpur has constructed a fresh class of geometric objects, called connected sequential Bargmann invariants, that encode how two different decay channels of an entangled meson pair relate to one another inside the projective geometry of quantum states. The work extends an earlier framework and shows that when decay-projected states are wired directly into a cyclic chain of quantum overlaps, the resulting quantities behave in a fundamentally different way near the boundary where CP violation switches off.

To appreciate why this matters, it helps to recall what makes neutral meson systems so special. Particles such as the neutral kaon, the D meson, and the two neutral B mesons are produced as flavor eigenstates but propagate as mixtures of heavy and light eigenstates, conventionally written as combinations of the meson and its antiparticle with coefficients p and q. When the magnitudes of p and q differ, the two propagation eigenstates are no longer orthogonal, and this nonorthogonality is the hallmark of indirect CP violation, the subtle asymmetry between matter and antimatter that was famously discovered in kaons in 1964. Because any physical observable must be independent of arbitrary phase conventions attached to quantum states, the natural language for describing interference in these systems is one of rephasing-invariant quantities.

Bargmann invariants provide exactly that language. For a closed sequence of quantum states, the nth-order Bargmann invariant is the product of overlaps taken around the cycle, and it remains unchanged under independent phase redefinitions of each state. Its phase is a geometric phase, the kind of holonomy familiar from the Berry phase, accumulated along a closed loop in the space of rays. Earlier work had applied this machinery to correlated neutral meson decays, constructing third-order invariants that probe single-channel interference and fourth-order invariants that correlate two decay channels through the heavy and light propagation eigenstates. Those constructions linked the geometric picture to conventional flavor observables, including Jarlskog-type structures, without introducing any new phenomenological parameters.

The new study asks a deceptively simple question: what happens if the two decay-projected states themselves are connected directly inside the cyclic overlap chain? When one meson of an entangled pair, produced for example in the decay of a phi or Upsilon resonance, decays into a channel f, its partner is projected into a conditional state determined by the decay amplitudes. A second channel g prepares a different conditional state. The connected sequential fourth-order Bargmann invariant follows the loop from the heavy eigenstate to the f-conditioned state, then directly to the g-conditioned state through their mutual overlap, then to the light eigenstate, and finally back to the heavy one. The crucial new ingredient is the overlap between the two conditional states, a quantity built purely from the decay amplitudes that measures how similar the two post-selected meson states are in projective Hilbert space.

This change in connectivity has dramatic consequences for how the geometric quantities scale as CP violation becomes small. The previously studied disconnected fourth-order invariant, when normalized by the product of two third-order invariants, produced a ratio that blows up quadratically, scaling as the inverse square of the mixing asymmetry, the difference between the squared magnitudes of p and q. The connected sequential ratio, by contrast, carries only a single factor of that asymmetry in its denominator, so its enhancement near the CP-conserving limit is merely linear. Physically, replacing one propagation-mediated link with a direct overlap between the projected states removes one power of the heavy-light suppression, placing the two classes of geometric correlation in distinct scaling classes.

A second new ratio compares the sequential invariant directly with the disconnected one. This comparison ratio behaves in the opposite manner: it is proportional to the mixing asymmetry itself, vanishing in the exact CP-symmetric limit. Its behavior is governed by a competition between two effects, the shrinking of the heavy-light overlap on one side and the possible alignment of interference phases between the two decay channels on the other. When the conditional states prepared by the two channels become geometrically aligned, the suppression can be weakened, revealing that the connected structure is sensitive not only to mixing asymmetry but also to the relative coherence of the decay projections.

To make these statements precise, the analysis is carried out in terms of the standard rephasing-invariant interference parameters lambda, the products of the mixing ratio q over p and the ratios of decay amplitudes to their CP-conjugates. A systematic small-asymmetry expansion, with the squared magnitudes of p and q written as one half plus or minus a small parameter, shows that the sequential ratio depends explicitly on the phase difference between the two channels through the numerator structure. This dependence has no analogue in the disconnected construction, where the channels communicate only through the propagation eigenstates. It means the connected sequential geometry probes the relative orientation of the decay-conditioned rays themselves, a piece of interference information that conventional observables do not isolate on their own.

The geometric interpretation is perhaps the most elegant part of the story. Both the disconnected and the sequential fourth-order invariants involve the same four rays, the heavy and light propagation eigenstates and the two decay-projected states, yet they define different closed paths through projective Hilbert space. A Bargmann invariant depends not just on which states participate but on how they are stitched together, so rewiring the cycle produces a genuinely different geometric correlation. In the CP-conserving limit the heavy and light eigenstates become orthogonal, one link of every cycle collapses, and the entire cyclic structure degenerates, which is why the invariants vanish there. The formalism thus ties the very existence of these CP-sensitive geometric objects to the nonorthogonality of the propagation eigenstates.

Crucially for experiment, none of this requires new physics inputs. The sequential invariant and both ratios can be written entirely in terms of the mixing parameters and decay amplitudes already extracted from time-dependent flavor analyses at flavor factories such as the KLOE experiment with entangled kaons and the BABAR and Belle measurements with entangled B mesons. The framework simply reorganizes the same accessible information into cyclic geometric quantities. The neutral kaon system, with its small indirect CP violation and long-lived interference phenomena, is flagged as a particularly natural arena where the linear enhancement of the sequential ratio could be pronounced, with candidate channels including two-pion, semileptonic, and multi-pion final states. The B meson systems, including channels like B decays to J/psi kaons and to pion pairs, offer rich phase-dependent interference structures, while the D system, where both mixing and CP violation remain tiny in the Standard Model, could serve as a sensitive testing ground for small deviations from exact symmetry.

The study stops short of claiming a new dynamical observable. The author is careful to note that the sequential construction does not add an extra propagation stage in the manner of conventional cascade CP analyses; it is a reorganization of overlap geometry within a single meson system. Even so, the result establishes a hierarchy of Bargmann invariant structures, from single-channel triangles through disconnected quadrilaterals to directly connected sequential cycles, each capturing a different layer of CP-sensitive interference. As precision flavor physics continues to squeeze ever tighter constraints on the origins of matter-antimatter asymmetry, geometric tools of this kind may reveal correlation patterns hiding in plain sight within data that experiments already collect.

Subject of Research: Geometric Bargmann invariant structures and CP-sensitive interference in correlated neutral meson systems

Article Title: Connected sequential Bargmann invariants and (\mathcal CP~)-sensitive geometric correlation structures in neutral meson systems

Article References: Sangiri, S. (2026). Connected sequential Bargmann invariants and $$\mathcal CP~$$-sensitive geometric correlation structures in neutral meson systems. The European Physical Journal C, 86(9), Article 1056. https://doi.org/10.1140/epjc/s10052-026-16308-5

Image Credits: AI Generated

DOI: 10.1140/epjc/s10052-026-16308-5

Keywords: Bargmann invariants, neutral mesons, CP violation, geometric phase, quantum interference, meson mixing, projective Hilbert space, kaons, B mesons, rephasing invariance, entangled meson pairs, flavor physics

Every time a power grid operator decides how much electricity each generator should produce, a quiet balancing act takes place. Burning less fuel saves money, but it often means allowing more pollution, and cutting emissions usually drives costs up. Engineers have long searched for a way to satisfy both goals at once, a challenge known as combined economic emission dispatch, or CEED. Now, a team of researchers has turned to one of the ocean’s most graceful feeders, the manta ray, for inspiration, and the result is an optimization algorithm that outperforms a crowded field of competitors on both cost and cleanliness.

The study, published in the journal Results in Engineering by Yu-Feng Sun, Jie-Sheng Wang and colleagues, describes an enhanced version of the Manta Ray Foraging Optimization algorithm, or MRFO. The original algorithm, first introduced a few years ago, mimics the cooperative hunting strategies that manta rays use to harvest plankton. Because plankton drifts unpredictably with seasons and weather, manta rays have evolved three distinct foraging behaviors: chain foraging, in which animals line up in arcs so that each one catches food missed by the one ahead; spiral foraging, where the group coils around a dense patch of food; and somersaulting, in which individuals flip back and forth around a promising spot. Translated into mathematics, these behaviors become rules that move a population of candidate solutions around a search space, gradually converging on the best answer.

What makes the CEED problem so stubborn is its mathematical character. The relationship between a generator’s output and its fuel consumption follows a cubic curve, and the emissions of carbon dioxide, nitrogen oxides and sulfur dioxide each follow their own cubic functions. The combined objective is nonlinear, nonconvex and discontinuous, riddled with local minima that can trap classical techniques such as lambda iteration or gradient-based methods. To make matters harder, the problem is genuinely multi-objective, so the researchers converted it into a single objective by applying price penalty factors that fold the cost of each pollutant into one total figure in dollars per hour.

Constraint handling is where many algorithms stumble. Traditional approaches add a fixed penalty whenever a solution violates the power balance requirement, the equation demanding that total generation minus transmission losses equals demand. But a fixed penalty is a blunt instrument. Set it too low and the algorithm happily returns infeasible schedules; set it too high and the search becomes so restricted that it cannot explore properly. Finding the right value through trial and simulation is time-consuming and inefficient. The team’s answer was to make the penalty itself dynamic, drawing on five different mathematical functions: sinusoidal, hyperbolic tangent, arctangent, linear and hyperbolic secant. Each function is raised to an order that changes during the run, so the penalty strength adapts to both the size of the violation and the stage of the optimization. Early on, mild penalties preserve exploration; later, penalties tighten to push solutions toward feasibility.

The second major innovation targets the heart of the MRFO algorithm. In the original design, a parameter called C governs the switch between exploration, casting the net wide across the search space, and exploitation, homing in on the best solution found so far. This parameter rises monotonically from zero to one, a predictable march that can leave the algorithm poorly balanced at certain stages. The researchers replaced it with a chaotic switching factor, drawn from nine well-known chaotic maps including Chebyshev, logistic, tent, sine, Gauss and singer maps, combined with an exponential adjustment function. The result is a parameter that still trends upward but oscillates along the way, periodically reopening the search space and preventing the population from settling prematurely into a local optimum.

To find out which chaotic map worked best, the team ran all nine enhanced variants, named C1MRFO through C9MRFO, through the CEC-2022 benchmark suite of twelve test functions, using a population of thirty and five hundred iterations averaged over thirty independent runs. The Chebyshev-based variant, C1MRFO, emerged as the overall winner, ranking first among the nine and beating the original MRFO, which finished last. Wilcoxon rank-sum tests confirmed that most of the improvements were statistically significant, with p-values below the conventional 0.05 threshold. When C1MRFO was pitted against a roster of state-of-the-art metaheuristics, including the dhole optimization algorithm, evolutionary mating algorithm, dung beetle optimizer, snow geese algorithm, particle swarm optimization, grey wolf optimizer, sparrow search algorithm and marine predators algorithm, it achieved the best final rank, taking first place on many of the test functions while keeping computational times competitive.

The real test, however, came when the algorithm was applied to actual dispatch problems. The researchers simulated a six-unit power system under four load demands of 150, 175, 200 and 225 megawatts. Across all four scenarios, C1MRFO produced the lowest comprehensive total cost, which combines fuel cost with the weighted penalties for carbon dioxide, nitrogen oxide and sulfur dioxide emissions. At 150 megawatts, for example, it reached a total cost of about 10,137 dollars per hour, edging out the grey wolf optimizer and clearly beating algorithms such as the arithmetic optimization algorithm, Harris hawks optimization, whale optimization algorithm, sine cosine algorithm, particle swarm optimization and the lambda iteration method. The pattern held at every load level, with the margin over the weakest classical method growing to thousands of dollars per hour at 225 megawatts.

The dynamic penalty functions delivered a further, striking gain. When the sinusoidal penalty function was applied with the parameter order set to dy5, the total cost at 150 megawatts dropped from roughly 10,137 to 9,065.71 dollars per hour, and similar reductions appeared at the higher loads, reaching 14,621.45 dollars per hour at 225 megawatts. Comparing the five penalty shapes, the sinusoidal function consistently produced the lowest minimum costs, beating the hyperbolic tangent, arctangent, linear and hyperbolic secant alternatives by margins ranging from hundreds to nearly two thousand dollars per hour depending on the load. Notably, when the penalty order was fixed rather than dynamic, performance was worst across the board, confirming that the adaptivity of the penalty, not merely its presence, is what matters.

To verify that each improvement contributes on its own, the team conducted an ablation study on a much larger twenty-unit system with a total demand of 2,500 megawatts. The results formed a clear hierarchy: the original MRFO achieved 61,835.16 dollars per hour, the chaos-enhanced C1MRFO reached 61,826.11, and the fully improved version combining chaos with the optimal sinusoidal dynamic penalty, sin(dy5)MRFO, achieved the best figure of 61,807.36 dollars per hour. All three outperformed the phasor particle swarm optimization benchmark, which came in at 61,895.57 dollars per hour. The stepwise improvement demonstrates that the two enhancements are not redundant but superimpose their benefits, and that the framework scales to systems far larger than the six-unit case.

The authors are careful to note where the work goes next. The current approach converts the multi-objective problem into a single objective through price penalty factors, but future versions could adopt Pareto-based multi-objective optimization to generate full sets of non-dominated trade-off solutions. The test cases also assume deterministic demand, so extending the algorithm to stochastic dispatch with wind and solar integration is another goal, as is combining the dynamic penalty with feasibility-first constraint-handling strategies. For now, the study offers a compelling demonstration that borrowing the foraging logic of a filter-feeding fish, perturbing it with chaos, and teaching it to calibrate its own punishments can squeeze meaningful savings and emission reductions out of one of power engineering’s hardest scheduling problems.

Subject of Research: An improved manta ray foraging optimization algorithm with chaotic switching factors and dynamic penalty functions for solving the combined economic emission dispatch problem in power systems.

Article Title: Manta ray foraging optimization algorithm with dynamic penalty function and chaos switching factor to solve combined economic emission dispatch problem

Article References: Sun, Y.-F., Wang, J.-S., Zhang, X.-Y., Li, Y.-X., Guan, X.-Y., & Liu, X. (2026). Manta ray foraging optimization algorithm with dynamic penalty function and chaos switching factor to solve combined economic emission dispatch problem. Results in Engineering, 32, Article 113383. https://doi.org/10.1016/j.rineng.2026.113383

Image Credits: AI Generated

DOI: Not provided

Keywords: manta ray foraging optimization, combined economic emission dispatch, metaheuristic algorithms, chaotic maps, dynamic penalty function, power system optimization, emission reduction, fuel cost minimization, CEC-2022 benchmarks, swarm intelligence, constraint handling, Results in Engineering

Frost is one of the most punishing adversaries of tea cultivation. A single cold snap can scorch tender leaves, derail an entire season’s harvest, and degrade the delicate chemistry that gives tea its value. For growers and breeders, however, judging how badly a field has been damaged has long been a stubbornly subjective exercise: visual ratings lump continuous injury into crude categories, and laboratory assays destroy the very tissue they measure. A new study published in Plant Methods by Zhengtong He of Shihezi University, Zhiwei Chen of the Tea Research Institute of Shandong Academy of Agricultural Sciences, and colleagues offers a way out, pairing hyperspectral imaging with a purpose-built deep learning model to read frost damage directly from the way leaves reflect light.

The core problem the team confronted is that frost injury is not a binary event but a continuum. Leaves exposed to sub-zero temperatures suffer a cascade of overlapping stresses: photosynthetic pigments degrade, the machinery of photosynthesis falters, and cell membranes and walls break down. Any single measurement captures only a sliver of that cascade. To capture the whole picture, the researchers collected hyperspectral data together with eight key physicochemical indicators from tea plants growing across natural frost damage gradients in the field, rather than in the artificial conditions of a growth chamber. From these multidimensional physiological responses they constructed a composite measure, the tea cold stress response index, or TCSRI, which expresses frost damage severity as a continuous value instead of a coarse visual class.

Building TCSRI is a meaningful advance in itself. Traditional frost assessment often relies on ordinal scales, where an observer assigns a score of mild, moderate, or severe. Such scales throw away information and make it difficult to track recovery or compare cultivars with fine precision. By integrating several physiological dimensions into one index, the team created a target variable that reflects the plant’s actual internal state. The challenge then became predicting that index, and the individual chemical indicators behind it, from spectral data alone, without touching or destroying a single leaf.

Hyperspectral sensing is well suited to this task in principle. Across hundreds of narrow wavelength bands, plant leaves encode a wealth of information: chlorophyll absorption in the visible range, water and structural features in the near infrared. But the data are high-dimensional, with far more spectral channels than samples, a regime that invites overfitting, especially in field studies where collecting ground-truth measurements is laborious. Conventional chemometric approaches, from partial least squares regression to standard machine learning pipelines, often struggle to separate genuine physiological signals from noise, sensor drift, and the confounding effects of leaf surface properties and illumination variation.

The researchers’ answer is a model they call STAMPformer, short for spectral-prior-guided multi-view attention pooling. Its architecture reflects a deliberate design philosophy: rather than letting a neural network rediscover everything from scratch, the model is steered by what spectroscopists already know about how plants respond to stress. At its front end, a parameter-free attention convolution extraction module jointly models both the raw reflectance spectra and their first-order derivatives. Derivative spectra are a classic spectral prior: they accentuate subtle local features such as absorption peaks and shoulders that are easily drowned out in raw reflectance, while suppressing broad baseline drift and noise. By processing both views together, the module sharpens the local spectral signatures that carry physiological meaning.

On top of this extraction stage sits the second innovation, a multi-view attention pooling module. Deep networks processing spectral sequences produce long streams of features, but not all wavelengths matter equally for a given prediction. The pooling module adaptively aggregates sequence features drawn from different feature subspaces, learning to amplify the responses that are most diagnostic of cold stress and to down-weight the rest. This attention mechanism acts like a learned spotlight, and because it operates across multiple subspaces, it can capture complementary patterns that a single attention head might miss. The result is a compact representation tailored to the prediction task at hand, whether that is estimating a specific chemical indicator or the composite TCSRI.

The performance numbers are striking. Across all nine prediction tasks, spanning the eight physicochemical indicators and the TCSRI itself, STAMPformer achieved coefficients of determination above 0.87 and ratios of performance to deviation above 2.80, thresholds generally regarded as indicating reliable quantitative prediction. In other words, from a leaf’s reflectance fingerprint alone, the model could reconstruct the plant’s internal frost-stress state with an accuracy that approaches laboratory measurement, while remaining entirely non-destructive. The team did not stop at headline metrics. Ablation experiments systematically removed each proposed module to confirm that both the attention convolution extraction and the multi-view pooling contributed measurably to the gains, and paired statistical tests across multiple random seeds ensured the improvements were not artifacts of a lucky initialization.

Interpretability was a further priority, and here the study delivers something rarer than raw accuracy. Applying SHAP analysis, a technique that attributes each prediction to the contributions of individual input features, the researchers identified the wavelengths the model relied on most heavily. These key spectral regions correspond to physiologically meaningful processes: pigment degradation, photosynthetic impairment, and the disruption of cellular structure. That alignment between machine attention and plant biology matters on two fronts. It gives spectroscopists confidence that the model has learned genuine stress signatures rather than spurious correlations, and it hands plant physiologists a data-driven map of which parts of the spectrum track which facets of cold injury, potentially guiding future sensor design and breeding assays.

Crucially, the model also proved itself on data it had never seen. Independent external validation, using samples not involved in training, demonstrated that STAMPformer’s predictive ability generalizes beyond its original dataset, addressing one of the most common failure modes of machine learning in agricultural sensing. For a field where models are often tuned and tested on the same plots, this external check is an important credibility marker, suggesting the framework could be deployed across different farms, seasons, and frost events rather than remaining a laboratory curiosity.

The practical implications reach well beyond tea. An accurate, non-destructive, continuous measure of cold damage opens the door to rapid post-frost field surveys, letting growers quantify losses within hours instead of waiting for symptoms to develop or sending samples to a lab. For breeders screening for cold-tolerant germplasm, a spectral readout of TCSRI could accelerate the evaluation of hundreds of candidate lines without destructive sampling. And in the emerging vision of the smart tea garden, where drones and handheld spectrometers roam the rows, a model like STAMPformer could feed real-time frost maps into irrigation, shading, and recovery-management decisions. The authors frame their work as supporting frost monitoring, cold-tolerant germplasm evaluation, and intelligent garden management, and the architecture’s reliance on general spectral priors rather than tea-specific tricks suggests the approach could be adapted to other crops facing abiotic stress. As climate variability makes late-season frosts increasingly erratic, tools that turn light reflected from a leaf into a precise physiological diagnosis may become as essential to the tea garden as the thermometer.

Subject of Research: Hyperspectral deep learning prediction of continuous frost damage severity in tea plants

Article Title: STAMPformer: spectral-prior-guided multi-view attention learning for hyperspectral prediction of continuous frost damage severity in field-grown tea plants

Article References: He, Z., Chen, Z., Ding, Z., Wang, Z., Zhang, F., Zhao, Y., & Dong, C. (2026). STAMPformer: spectral-prior-guided multi-view attention learning for hyperspectral prediction of continuous frost damage severity in field-grown tea plants. Plant Methods. https://doi.org/10.1186/s13007-026-01597-4

Image Credits: AI Generated

DOI: 10.1186/s13007-026-01597-4

Keywords: tea plant, frost damage, hyperspectral imaging, deep learning, attention mechanism, cold stress index, non-destructive prediction, SHAP analysis, precision agriculture, spectral priors, plant physiology, smart farming

It happens every time: Just before major OS releases, the tech web is flooded with how-to and tips articles. The MacVoices Live! panel looks at why and how you can benefit, including how that flood can offer guidance when new operating systems arrive. The discussion then turns to the Mac App Store allowing developers to […]

💾

Et si l’IA ne se contentait plus d’aider les scientifiques, mais commençait à faire de la recherche à leur place ? Anthropic affirme que Claude a identifié un système enzymatique inédit dans l’ADN de bactériophages. Une découverte encore à confirmer, mais qui révèle surtout une ambition plus...

Il cherchait simplement un coin tranquille où camper au Québec lorsqu’une étrange forme circulaire apparue sur Google Maps a attiré son attention. Deux ans plus tard, une expédition menée dans des conditions particulièrement difficiles vient de révéler ce qui se cache réellement autour du lac...

Although Swift serves as Apple's primary language for macOS and iOS application development, the open-source community continues to expand its reach—driving its adoption as a multi-platform language or even a cross-platform one in fields beyond user interface design. Tuesday’s Swift 6.4 release continued that work. Along with the usual assortment of type shortcuts and async adjustments came word that Swift Build is now the default build engine for the Swift Package Manager. Synergies have already ensued! The pairing sets the stage for a faster build process. A developer can write a program in Swift and Swift Build will automatically download and install the required dependencies, testing them for compatibility. It then compiles the code into a CPU-specific binary. The merger also unifies the Swift developer experience regardless of platform. With this integration, a developer can run through the entire build process in their own environment, be it Apple’s Xcode IDE or a beloved command line, and all the steps will be exactly the same for a Linux, macOS, or Windows app. Or the developer can run their builds from VS Code, thanks to a new extension available on the Open VSX Registry. Sweetening the deal, the integrated package comes with a tool to generate an SBOM (Software Bill of Materials) for each app, listing all the dependencies in either the SPDX or CycloneDX format (SE-0509). SBOMs are da bomb when it comes to software auditing and checking for potential security bugs. Swift’s unified toolchain In a way, Swift is following the lead of Rust’s Cargo and Go’s command line, both of which run as unified toolchains, as does Bun for JavaScript. A single integrated workflow can take the place of manually calling one tool after another to schlep some code into production. The Swift Package Manager (SwiftPM), created by Apple in 2015, is a command line automation and dependency management tool. Swift Build itself is a collection of interoperable software development tools that together orchestrate the compilation (using the swiftc compiler), linking and testing of code. SwiftPM can work with any git repository as a source of Swift code, as well as with private repository services such as Bitbucket and JFrog Artifactory. Most notably, SwiftPM works well with the Swift Package Index (SPI), a search service for Swift artifacts created in 2020 and acquired by Apple in June. SPI is currently the de facto repository for many Swifties, housing over 10,400 packages. Many enjoy how the registry tests each dependency for compatibility with each platform and version of Swift. We’d be curious to see if Apple has plans for pulling SPI metadata into SwiftPM. Swift coders not using SwiftPM and Swift Build probably employ Google’s Bazel, Meta’s Buck2, or the venerable CMake to manage their Swiftian assets. Debugging from the source This release streamlines other parts of the build process as well, such as debugging. With Swift 6.4, the default Swift debugger LLDB now has a more storage-efficient way to debug modules, namely by identifying the exact path to the module being used, instead of embedding the entire module into the debugging file, which caused considerable bloat. Now the debugger can follow a pointer and inspect the original module. The release also features interoperability improvements with C++, Java, JavaScript, and even WebAssembly, which gets its own SDK. To start with Swift, go to the Install Swift page. The 6.4 toolchain can be downloaded using the Swiftly command line. ®

Apple is working on an AI server that would use Apple’s high-performance M-series Ultra chips found in Mac desktops. The potential product’s expected release in 2029 would mark the first Apple server to hit the market in nearly two decades—and could capitalize on the surging popularity of Apple hardware among AI developers.

The enterprise server would come in two configurations that include either two or four of Apple’s future M8 Ultra chips, according to The Information. The project reportedly received support from new Apple CEO John Ternus when it began a year ago, back when Ternus led Apple’s hardware engineering efforts.

This revelation coincides with booming sales for Apple’s Mac mini and Mac Studio as AI developers and companies snap up the Mac computers to run AI workloads. The popularity of such computing devices that rely on Apple’s M-series Ultra chips has undoubtedly encouraged Apple’s pursuit of an enterprise server using the same chips.

Read full article

Comments

© Benjamin Fanjoy/Getty Images

Learn about the new Local Lists feature in Apple Maps on iPhone, iPad, and Mac to see what’s trending around you or in a preferred city.

Um grupo ligado ao ecossistema ShinyHunters usou infraestruturas na nuvem e ferramentas de scanning para caçar segredos codificados em aplicações (APK) para Android, obtendo acesso a sistemas empresariais em poucas horas.

The post Um ataque automatizado varreu 1,8 milhões de APKs Android à procura de credenciais expostas appeared first on Tek Notícias.

Doorbell firm aims to replace WhatsApp or Facebook groups with platform where people can post about safety or lost pets

Amazon’s doorbell camera maker Ring is to launch its Neighbours community app in the UK in an attempt to supplant neighbourhood WhatsApp or Facebook groups.

The service is intended as a modern equivalent of a community message board, where neighbours can post about safety, community matters or lost pets.

Continue reading...

© Composite: Ring

© Composite: Ring

© Composite: Ring

Meta is making the platform even better for podcast promotion.

SK Hynix told TechCrunch the company hasn't finalized any plans or arrangements yet.

Fluxnium's fibers can extract uranium directly from seawater, which has enough of the nuclear fuel to power thousands of generations.

Piddington, a village in Oxfordshire, has voted to leave the UK by 91.6% to 8.4% on a turnout of 92%, in a symbolic referendum called in response to plans to house 1,200 migrants in a converted army camp nearby.

The post Piddington Votes to Leave UK Over Migrant Camp Plans appeared first on The Daily Sceptic.

Chimpanzees may be teaching their children skills once thought uniquely human

💾

💾