Researcher profile

Yanbo Zhang

Yanbo Zhang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

Language Game: Talking to Non-Human Systems

Language carries thought and coordination among humans but rarely reaches further along the spectrum of diverse intelligence. Yet non-neural systems -- from gene regulatory networks and microbial consortia to fungi -- are increasingly recognized as substrates of computation, decision-making and memory, making dialogue with non-human intelligence newly conceivable. Today such dialogue is attempted only by proxy: a large language model speaks on the system's behalf, so any intelligence on display originates from the model while the system itself remains silent. Here we ask whether the system can speak in its own voice. Following Wittgenstein, who located meaning in use, we treat communication as a game played with the system. Its internal dynamics are frozen as the nonlinear core of a reinforcement-learning policy, with only linear input and output interfaces trained. Through use and reward, the system's states and responses acquire meaning within the game, so playing becomes speaking. Because different architectures playing the same game optimize the same reward, their behaviors can all be read as pursuit of that reward; the game serves as a lingua franca across otherwise irreconcilable representations. Given a human prompt, a language model routes it to the game whose semantics best match it and designs an environmental state for which the desired action is the rational response, letting the system reply through its own behavior. Applied across diverse gene regulatory networks and reinforcement-learning tasks, the framework yields fluent dialogue without altering any system parameter, shows that well-trained agents of disparate origin converge on similar behavior, and reveals that specific GRN properties make a system easier or harder to talk with -- an inductive bias of the reservoir itself. Our framework opens a new route to conversing with any dynamical system on its own terms.

preprint2026arXiv

Online Ramsey numbers of the claw versus cycles

The online Ramsey number $\tilde r(G,H)$ is defined via a Builder--Painter game on an empty graph with countably many vertices. In each round, Builder reveals an edge, which Painter immediately colors either red or blue. Builder wins once a red copy of $G$ or a blue copy of $H$ appears, and $\tilde r(G,H)$ is the minimum number of edges Builder must reveal to force a win. For a long cycle $C_\ell$, the online Ramsey numbers $\tilde r(G,C_\ell)$ are known only for a few specific choices of $G$. In particular, exact values were determined for $G=P_3$ by Cyman, Dzido, Lapinskas, and Lo (Electron. J. Combin., 2015), while asymptotically tight results were obtained when $G$ is an even cycle by Adamski, Bednarska-Bzdȩga, and Blažej (SIAM J. Discrete Math., 2024). In this paper, we consider the case where $G$ is the claw $K_{1,3}$ and determine the exact value of $\tilde r(K_{1,3},C_\ell)$. We show that \[ \tilde r(K_{1,3},C_\ell)=\left\lfloor \frac{3(\ell+1)}{2} \right\rfloor \quad \text{for all } \ell \ge 13. \]

preprint2022arXiv

Connected size Ramsey numbers of matchings versus a small path or cycle

Given two graphs $G_1, G_2$, the connected size Ramsey number ${\hat{r}}_c(G_1,G_2)$ is defined to be the minimum number of edges of a connected graph $G$, such that for any red-blue edge colouring of $G$, there is either a red copy of $G_1$ or a blue copy of $G_2$. Concentrating on ${\hat{r}}_c(nK_2,G_2)$ where $nK_2$ is a matching, we generalise and improve two previous results as follows. Vito, Nabila, Safitri, and Silaban obtained the exact values of ${\hat{r}}_c(nK_2,P_3)$ for $n=2,3,4$. We determine its exact values for all positive integers $n$. Rahadjeng, Baskoro, and Assiyatun proved that ${\hat{r}}_c(nK_2,C_4)\le 5n-1$ for $n\ge 4$. We improve the upper bound from $5n-1$ to $\lfloor (9n-1)/2 \rfloor$. In addition, we show a result which has the same flavour and has exact values: ${\hat{r}}_c(nK_2,C_3)=4n-1$ for all positive integers $n$.

preprint2019arXiv

DLIMD: Dictionary Learning based Image-domain Material Decomposition for spectral CT

The potential huge advantage of spectral computed tomography (CT) is its capability to provide accuracy material identification and quantitative tissue information. This can benefit clinical applications, such as brain angiography, early tumor recognition, etc. To achieve more accurate material components with higher material image quality, we develop a dictionary learning based image-domain material decomposition (DLIMD) for spectral CT in this paper. First, we reconstruct spectral CT image from projections and calculate material coefficients matrix by selecting uniform regions of basis materials from image reconstruction results. Second, we employ the direct inversion (DI) method to obtain initial material decomposition results, and a set of image patches are extracted from the mode-1 unfolding of normalized material image tensor to train a united dictionary by the K-SVD technique. Third, the trained dictionary is employed to explore the similarities from decomposed material images by constructing the DLIMD model. Fourth, more constraints (i.e., volume conservation and the bounds of each pixel within material maps) are further integrated into the model to improve the accuracy of material decomposition. Finally, both physical phantom and preclinical experiments are employed to evaluate the performance of the proposed DLIMD in material decomposition accuracy, material image edge preservation and feature recovery.