Issue Ebook
cover story
Current Issue
Issue 10, 2026
Editors-in-Chief
Yunhe Pan, Aiguo Fei
Advisor Xicheng Lu
ISSN 3069-8928
CN 33-1439/TP
IF (2025 JCR) 3.3
| Submit Now |
- Current Issue
- Cover Articles
- Archive
- Virtual Issues
- Online First
Volume 27 Issue 10，2026
Regular Papers
Abstract：Graphic visual art is undergoing a profound transformation driven by generative artificial intelligence (AI). This transformation extends beyond technological innovation, reshaping the paradigms of artistic image creation. This paper examines human-centered interactive systems for artistic image creation, aiming to bridge the gap between technology-oriented and art-oriented research. We identify three core challenges in interactive generative art creation: controllability, integrity, and creativity, and analyze in depth the underlying trade-offs among them. Building on this analysis, we systematically review the evolution of generative models, approaches to integrating artistic knowledge, and the emergence of collaborative agentic AI systems. Looking ahead, we emphasize the need to develop human–AI collaborative frameworks that offer greater controllability, preserve human creative agency, and ensure regulatory compliance, while exploring a wide range of potential applications. This study proposes a unified analytical framework that connects AI technologies, human–AI interaction processes, and the integration and innovation of artistic image creation. It further outlines a task-oriented roadmap to guide future research and the development of collaborative systems for artistic image creation.Keywords：Cross-media intelligence;Human–AI collaboration;Visual art creation;Interactive systems;Controllability;Integrity;Creativity21|6|0Updated：2026-11-05Regular Papers
Abstract：Technology managers are instrumental in facilitating technology transfer. While large language models (LLMs) have demonstrated potential in this domain, evaluating them on the core cognitive capabilities expected of technology managers remains challenging due to the lack of domain-specific benchmarks. To address this challenge, we construct TMBench, a domain-specific benchmark for evaluating the cognitive capabilities expected of technology managers. It comprises a collection of 3474 questions spanning diverse scenarios, covering three tasks and five question types. We integrate typical metrics with LLM-as-a-Judge using both fixed and entropy-based weights to calculate the corresponding dimensional and composite scores. Leveraging this mechanism, we evaluate nine representative models under varying prompt configurations and temperature settings to investigate their capabilities, characterize their error patterns, and benchmark them against human experts. Our results show heterogeneous capabilities, with no single model ranking first across all three capability levels. For higher-order capabilities, LLMs show more favorable point estimates than the human baseline, but the differences are not statistically significant. Chain-of-thought-based prompting is associated with prompt-sensitive capability profiles, with more favorable open-weight performance in the two higher-order tasks. Error analysis identifies knowledge base, retrieval, and application deficits as the most prevalent error category. Building on these findings, this study provides a reference for model selection, prompt engineering, and targeted optimization when applying LLMs in technology transfer.Keywords：Technology transfer;Technology manager;Benchmark;Large language model (LLM)7|8|0Updated：2026-11-05Regular Papers
Abstract：Area and power need to be considered at all stages of integrated circuit design. Area and power cooperative optimization for mixed polarity Reed‒Muller (MPRM) circuits aims to find the Pareto non-dominated sets with minimum area and power. Existing multiobjective optimization approaches for MPRM circuits have a long runtime and cannot handle large-scale circuits. In this paper, we propose a multi-strategy quantum wolf pack algorithm (MQWPA), which includes quantum encoding, dual-population strategy, dynamic reverse learning strategy, mutation strategy, and termination criterion. Moreover, based on the proposed MQWPA, we propose an efficient area and power optimization approach (EAPOA), which searches for XNOR/OR-based MPRM circuits with Pareto non-dominated solution sets. Experimental results show that compared with state-of-the-art evolutionary algorithms, MQWPA can search for optimal solutions in multiobjective test problems; compared with commonly used Boolean minimization methods, EAPOA has advantages in area and power consumption. After field-programmable gate array technology and standard cell mapping, by selecting area as the optimal cost implementation, we obtain average improvements in the actual area of 16.33% and 2.27%, respectively.Keywords：Cooperative optimization;Mixed polarity Reed‒Muller;Quantum wolf pack algorithm;Pareto non-dominated sets7|4|0Updated：2026-11-05Regular Papers
Abstract：Virtual staining converts label-free autofluorescence (AF) images into hematoxylin and eosin (H&E)-like brightfield contrast for nondestructive pathology. We adapt the unpaired neural Schrödinger bridge (UNSB) framework to AF-to-H&E virtual staining and develop an enhanced UNSB (E-UNSB) model for pathology-oriented image translation. E-UNSB retains the unpaired, unidirectional, and progressive stochastic transport formulation of UNSB while introducing pathology-specific structural regularization to preserve cellular morphology and tissue architecture. In particular, saliency constraints and global feature consistency provide multi-scale structural guidance to reduce distortion during staining generation. Experiments demonstrate improved distributional similarity and morphometric consistency over the evaluated unsupervised baselines. Quantitative downstream analysis further indicates that virtual H&E images retain morphometric features relevant to pathological assessment, supporting their potential for high-throughput multimodal tissue analysis.Keywords：Virtual staining;Unsupervised learning;Schrödinger bridge;Digital pathology;Image processing6|5|0Updated：2026-11-05Regular Papers
Abstract：Industrial anomaly detection is important for intelligent manufacturing since defects can degrade product reliability. Existing methods based on knowledge distillation typically use a single teacher, limiting feature diversity and robustness. Multi-teacher methods often require explicit feature alignment across different network architectures, which may introduce semantic conflicts and weaken anomaly responses. We propose implicit multi-teacher distillation (IMTD) for industrial anomaly detection. IMTD employs three complementary teacher networks, namely ResNet18, ResNet34, and Wide-ResNet50, to capture texture, structural, and semantic representations from different feature spaces. Each teacher is paired with an independent decoder trained only on normal samples, enabling implicit knowledge transfer without cross-architecture feature alignment. A false-negative-aware maximum response aggregation (FN-MRA) module is further introduced to preserve the strongest anomaly evidence during fusion. Experiments on MVTec anomaly detection (MVTec AD), visual anomaly benchmark (VisA), and metal part defect dataset (MPDD) show that IMTD consistently outperforms recent state-of-the-art methods in both image-level and pixel-level anomaly detection. The results demonstrate the effectiveness of combining complementary teachers, implicit reconstruction, and maximum-response aggregation under anomaly-scarce conditions.Keywords：Industrial anomaly detection;Knowledge distillation;Multi-teacher ensemble;Implicit reconstruction;False-negative-aware maximum response aggregation (FN-MRA)7|4|0Updated：2026-11-05Regular Papers
Abstract：This study analyzes the price of anarchy (PoA) for a scheduling game on two hierarchical uniform machines under the parallel processing policy, a coordination mechanism that combines the well-studied ShortestFirst and makespan policies. This scheduling game corresponds to the round-robin scheduling mechanism widely adopted in time-sharing operating systems and network packet processors. This study focuses on makespan minimization. We derive the PoA as a function of the ratio of the speeds of the two machines. We demonstrate that all derived bounds are tight for any ratio, thereby characterizing the inefficiency of Nash equilibria in scheduling games on two uniform machines under parallel processing.Keywords：Scheduling game;Hierarchy;Parallel processing;Price of anarchy (PoA);Nash equilibrium5|4|0Updated：2026-11-05
SEE MORE
0 1 Hybrid-augmented intelligence: collaboration and cognition
0 4 Applications of artificial intelligence in intelligent manufacturing: a review*
0 5 Challenges and opportunities: from big data to knowledge in AI 2.0
0 6 Current trends in the development of intelligent unmanned autonomous systems
0 7 Recent advances in efficient computation of deep convolutional neural networks
0 8 Terahertz time-domain spectroscopy and micro-cavity components for probing samples: a review
0 9 Cross-media analysis and reasoning: advances and directions
SEE MORE
Videos
-
00:02:512023 Issue 1 | Scalability and efficiency challenges for the exascale supercomputing system: practice of a parallel supporting environment on the Sunway exascale prototype system
2023-12-30Play Total： 32 - 00:02:30
2023 Issue 6 | Model division multiple access for semantic communications
2023-12-30Play Total： 23 - 00:02:15
2022 Issue 10 | Discussion on a new paradigm of endogenous security towards 6G networks
2023-12-30Play Total： 11 - 00:02:22
2022 Issue 12 | Technology trends in large-scale high-efficiency network computing
2023-12-30Play Total： 9 - 00:02:48
2022 Issue 6 | Self-deployed execution environment for high performance computing
2022-08-03Play Total： 17 - 00:02:24
2022 Issue 2 | A full-process intelligent trial system for smart court
2022-05-17Play Total： 20 - 00:02:37
2022 Issue 3 | Automatic protocol reverse engineering for industrial control systems with dynamic taint analysis
2022-05-17Play Total： 10 - 00:05:36
P1 Speech by Academician Baoyan Duan
2022-04-17Play Total： 26 - 00:02:27
P2 Speech by Professor Min Sheng, Xidian University
2022-04-17Play Total： 18 - 00:02:37
P3 Speech by Professor Yunsong Li, Xidian University
2022-04-17Play Total： 22
SEE MORE
- Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
- Tel：+86-571-88273162 Email：fitee@zju.edu.cn
- Copyright © 2000 - 2025, Zhejiang University Press 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
0