arXiv subjects

Zhouming Wu

Publications and source records attributed to Zhouming Wu.

3 recordsLinked to original sources

arXiv2026

The software space of science

Science advances not only through the accumulation of facts but also through the evolution of tools. Crucially, tools are rarely used in isolation. They form tool portfolios, combinations shaped by a discipline's workflows and analytical demands. Software, near-ubiquitous in modern research and traceable across the published literature, offers a unique window to study tool use in science. Here, we map the software space of science by analyzing mentions to software from 1.3 million publications from 2004 to 2021. We construct a network of 520 software tools linked by disciplinary co-usage, with link strength weighted by proximity based on revealed comparative advantage. This network reveals a structured landscape in which tools cluster into 8 functional communities, including computing and statistics, wet lab instrumentation, and several bioinformatics specializations, with each discipline occupying a distinct position reflecting its characteristic tool portfolios. The breadth of a discipline's tool portfolio is shaped by the nature of its research workflow: fields combining experimental and computational tasks draw on multiple communities, while those with narrower methodological demands concentrate in one. These structural differences are stable across the observation period. At the same time, across all broad disciplinary categories, disciplinary tool portfolios are crystallizing, settling on a common set of tools.

cs.DL↗

arXiv2024

On the convergence of fictitious play algorithm in repeated games via the geometrical approach

As the earliest and one of the most fundamental learning dynamics for computing NE, fictitious play (FP) has being receiving incessant research attention and finding games where FP would converge (games with FPP) is one central question in related fields. In this paper, we identify a new class of games with FPP, i.e., $3\times3$ games without IIP, based on the geometrical approach by leveraging the location of NE and the partition of best response region. During the process, we devise a new projection mapping to reduce a high-dimensional dynamical system to a planar system. And to overcome the non-smoothness of the systems, we redefine the concepts of saddle and sink NE, which are proven to exist and help prove the convergence of CFP by separating the projected space into two parts. Furthermore, we show that our projection mapping can be extended to higher-dimensional and degenerate games.

math.OC↗

arXiv2024

An Optimal Pricing Formula for Smart Grid based on Stackelberg Game

The dynamic pricing of electricity is one of the most crucial demand response (DR) strategies in smart grid, where the utility company typically adjust electricity prices to influence user electricity demand. This paper models the relationship between the utility company and flexible electricity users as a Stackelberg game. Based on this model, we present a series of analytical results under certain conditions. First, we give an analytical Stackelberg equilibrium, namely the optimal pricing formula for utility company, as well as the unique and strict Nash equilibrium for users' electricity demand under this pricing scheme. To our best knowledge, it is the first optimal pricing formula in the research of price-based DR strategies. Also, if there exist prediction errors for the supply and demand of electricity, we provide an analytical expression for the energy supply cost of utility company. Moreover, a sufficient condition has been proposed that all electricity demands can be supplied by renewable energy. When the conditions for analytical results are not met, we provide a numerical solution algorithm for the Stackelberg equilibrium and verify its efficiency by simulation.

math.OC↗