Long-term conversational agents rely on personal memory to maintain coherence and personalization, yet practical systems must operate under context budgets and cope with evolving or contradictory user information. We frame persona memory as a retrieval problem over a growing memory store, and propose REMAP, a reflection-guided memory editing approach for online alignment of persona facts that selectively writes and revises memory entries based on the current dialogue evidence and retrieved related items. The method aims to preserve salient facts while reducing redundancy and resolving apparent conflicts, enabling more efficient context utilization over extended interaction horizons. Experiments on multi-session dialogue datasets show consistent gains in persona-consistent retrieval and response continuity over commonly used memory strategies, while achieving more selective memory updates under comparable operational overhead.

The rapid advancement of urbanization in recent decades has attracted extensive application of cellular automata (CA)-based models to simulate urban growth for planning and decision-making. However, the inaccurate representation of heterogeneous spatial interactions between urban units and the neglect of autocorrelated growth patterns in urbanization lead to unreliable simulation results of CA-based models. To address these two limitations, this study proposes a novel CA-based model integrated with Transformer network and Local Moran’s I, namely TL-CA. The Transformer network is built to quantify heterogeneous interaction between neighbors using the self-attention mechanism. Subsequently, Local Moran’s I is employed to implicitly guide the network in learning spatially autocorrelated patterns of urban growth through auxiliary learning. Finally, the development potential estimated from driving factors, i.e. the network output, is incorporated into CA to simulate urban growth. Land use data from Wuhan (2000–2020) are selected to verify TL-CA’s performance. The results demonstrate that TL-CA achieves the highest simulation accuracy, with an average increase in the figure of merit (FoM) of 9.97%. Attention visualization and residual analysis explain the model’s effectiveness in modeling heterogeneous interactions and autocorrelated growth. Additionally, TL-CA exhibits high computational efficiency and low resource consumption, with sufficient potential to support larger-scale research.

This paper reports a new general framework of focused web crawling based on "relational subgroup discovery". Predicates are used explicitly to represent the relevance clues of those unvisited pages in the crawl frontier, and then first-order classification rules are induced using subgroup discovery technique. The learned relational rules with sufficient support and confidence will guide the crawling process afterwards. We present the many interesting features of our proposed first-order focused crawler, together with preliminary promising experimental results.

Link context has been exploited extensively ever since the advent of the World Wide Web, but the approach to extracting precise link context has not been fully explored and many state-of-the-art extraction methods are based on simplistic heuristics and require ad-hoc parameters. In this paper, we propose a novel two-step extraction model, which aims to systematically derive link context of quality as high as anchor text. In the macroscopic analysis step, a systematic web page structure analysis is performed to locate the content cohesive text region and potential relevant header or header like tags. In the microscopic extraction step, an English parser is used to extract the relevant sentence fragments in the text region and the nearest heading text is encompassed if the need arises. Preliminary experimental results proved our approach's effectiveness.