The generation of safety-critical scenarios in simulation has become increasingly crucial for safety evaluation in autonomous vehicles (AV) prior to road deployment in society. However, current approaches largely rely on predefined threat patterns or rule-based strategies, which limit their ability to expose diverse and unforeseen failure modes. To overcome these, we propose ScenGE, a framework that can generate plentiful safety-critical scenarios by reasoning novel adversarial cases and then amplifying them with complex traffic flows. Given a simple prompt of a benign scene, it first performs Meta-Scenario Generation, where a large language model (LLM), grounded in structured driving knowledge (e.g., traffic regulations, real-world accident records), infers an adversarial agent whose behavior poses a threat that is both plausible and deliberately challenging. This meta-scenario is then specified in executable code for precise in-simulator control. Subsequently, Complex Scenario Evolution uses background vehicles to amplify the core threat introduced by Meta-Scenario. It builds an adversarial collaborator graph to identify key agent trajectories for optimization. These perturbations are designed to simultaneously reduce the ego vehicle's maneuvering space and create critical occlusions. Extensive experiments conducted on multiple reinforcement learning (RL) based AV models show that ScenGE uncovers more severe collision cases (+31.96%) on average than SoTA baselines. Additionally, our ScenGE can be applied to large model based AV systems and deployed on different simulators; we further observe that adversarial training on our scenarios improves the model robustness. We hope our paper can build up a critical step towards building public trust and ensuring their safe deployment.

Abstract The deployment of artificial intelligence (AI) technology in various emerging network applications has spawned a large number of computing tasks, which require dynamic collaboration of multi-dimensional resources from the perspective of communication and computing to meet service requirements such as ultra-low latency, ultra-high reliability, and ultra-fast response. In this paper, we introduce a Computing Integration Networking (CIN) architecture, which built to integrate ubiquitous heterogeneous resources in the Internet into a distributed pool, enabling CIN paradigm to fully utilize all available heterogeneous resources and provide efficient customized services evolving both communication and computation. Owing to network function virtualization (NFV) technology, computing services can be implemented as service chains, which are composed of ordered virtual network functions. We then design a service chain-driven CIN architecture with “three layers and three domains” characteristics, which consists of generalized service layer, mapping adaption layer and converged network layer. The designed architecture enables the adaptability for users, flexibility for CIN, and profitability for providers. Furthermore, we outline key technologies such as measurement and modeling of multi-dimensional heterogeneous resources, fine-grained multi-dimensional awareness, multi-dimensional identification networking and heterogeneous resources allocation. In addition, we formulate the heterogeneous resource joint optimization problem and verify the effectiveness of the designed scheme. Furthermore, we explore open issues based on our review and indicate potential research trends of the new computing paradigm.

How to recommend an effective prescription with intelligent assistant treatment remains a key issue in Traditional Chinese Medicine (TCM). To address this issue, various intelligent assistant treatment methods have been developed in recent years. However, existing methods barely integrate together knowledge graphs of TCM and the characteristics of individual differences between patients, which play very important roles in the prescription recommendation of TCM. For this reason, this work proposes a novel framework of TCM prescription recommendation, referred to as CETCMKG , which integrates the TCM knowledge graph to improve the accuracy and interpretability of prescription recommendation. More specifically, features of herb and symptom nodes are learned by combining the graph embedding models and graph convolutional neural networks. During the prediction and recommendation phase, multi-head attention mechanisms and multi-layer perceptrons jointly analyze symptom patterns to guide herb selection. Following this analysis, the performance of CETCMKG is rigorously evaluated through comparative experiments, demonstrating its superiority over existing state-of-the-art prescription recommendation methods in TCM.

The development of text-to-image (T2I) generative models, that enable the creation of high-quality synthetic images from textual prompts, has opened new frontiers in creative design and content generation. However, this paper reveals a significant and previously unrecognized ethical risk inherent in this technology and introduces a novel method, termed the Cognitive Morphing Attack(CogMorph), which manipulates T2I models to generate images that retain the original core subjects but embeds toxic or harmful contextual elements. This nuanced manipulation exploits the cognitive principle that human perception of concepts is shaped by the entire visual scene and its context, producing images that amplify emotional harm far beyond attacks that merely preserve the original semantics. To address this, we first construct an imagery toxicity taxonomy spanning 10 major and 48 sub-categories, aligned with human cognitive-perceptual dimensions, and further build a toxicity risk matrix resulting in 1,176 high-quality T2I toxic prompts. Based on this, ourCogMorphfirst introduces Cognitive Toxicity Augmentation, which develops a cognitive toxicity knowledge base with rich external toxic representations for humans (e.g., fine-grained visual features) that can be utilized to further guide the optimization of adversarial prompts. In addition, we present Contextual Hierarchical Morphing, which hierarchically extracts critical parts of the original prompt (e.g., scenes, subjects, and body parts), and then iteratively retrieves and fuses toxic features to inject harmful contexts. Extensive experiments on multiple open-source T2I models and black-box commercial APIs (e.g., DALL$\cdot$E-3) demonstrate the efficacy ofCogMorphwhich significantly outperforms other baselines by large margins (+20.62% on average). Our codes are available athttps://github.com/raykr/CogMorph.Warning: This paper contains harmful imagery that might be offensive to some readers.

This article revisits the federated policy gradient algorithm with environment heterogeneity for finding the optimal policy in multiagent reinforcement learning (RL). Toward this direction, personalized federated RL methods have been presented recently. However, existing personalized federated policy gradient methods may confine the personalized capacity of local policy models. In order to tackle this challenge, this article develops a provably convergent personalized federated first-order policy gradient algorithm, referred to as PfoPG, which learns a personalized policy model by adaptively mixing optimal global and local policies. Moreover, the momentum-based importance sampling is also introduced into PfoPG to improve its convergence speed. Meanwhile, this article rigorously analyzes the nonasymptotic convergence behavior of PfoPG. More specifically, PfoPG converges to a stationary policy with rateO(1/K), whereKdenotes the number of iterations. Compared to the state-of-the-art federated policy gradient methods, PfoPG can improve the convergence rate fromO(1/K2/3) toO(1/K). Finally, we verify the effectiveness of PfoPG by various experiments based on the multiagent particle environment.

The emergence of multimodal large language models has redefined the agent paradigm by integrating language and vision modalities with external data sources, enabling agents to better interpret human instructions and execute increasingly complex tasks. However, in this paper, we identify a critical yet previously overlooked security vulnerability in multimodal agents: cross-modal prompt injection attacks. To exploit this vulnerability, we propose CrossInject, a novel attack framework in which attacker embeds adversarial perturbations across multiple modalities to align with target malicious content, allowing external instructions to hijack the agents' decision-making process and execute unauthorized tasks. Our approach incorporates two key coordinated components. First, we introduce Visual Latent Alignment, where we optimize adversarial features to the malicious instructions in the visual embedding space based on a text-to-image generative model, ensuring that adversarial images subtly encode cues for malicious task execution. Subsequently, we present Textual Guidance Enhancement, where a large language model is leveraged to construct the black-box defensive system prompt through adversarial meta-prompting and generate a malicious textual command based on it that steers the agents' output toward better compliance with attacker's requests. Extensive experiments demonstrate that our method outperforms state-of-the-art attacks, achieving at least a +30.1% increase in attack success rates across diverse tasks. Furthermore, we validate our attack's effectiveness in real-world multimodal autonomous agents, highlighting its potential implications for safety-critical applications. Code can be found in https://github.com/Larry0454/CrossInject.

Decentralized actor-critic (AC) is one of the most dominant algorithms for dealing with multiagent reinforcement learning (MARL) problems. However, exploration-efficient, sample-efficient, and communication-efficient are difficult to achieve simultaneously by existing decentralized AC methods. For this reason, this article develops a decentralized multiagent AC algorithm by incorporating entropy regularization to improve exploration with theoretical guarantees, referred to as multi-agent AC algorithm with entropy regularization (MACE). Moreover, we rigorously prove that MACE can achieve sample complexity $\mathcal {O}(\epsilon ^{-2}\ln \epsilon ^{-1})$ and communication complexity of $\mathcal {O}(\epsilon ^{-1}\ln \epsilon ^{-1})$ , which match the best complexities at present. Finally, the performance of MACE is also evaluated on reinforcement learning (RL) tasks. The experimental results show that the proposed algorithm achieves better exploration efficiency than state-of-the-art decentralized AC-type algorithms.

Much effort has been devoted to building multi-modal knowledge graphs by visualizing entities on images, but ignoring the multi-modal information of the relation between entities. Hence, in this paper, we aim to construct a new large-scale multi-modal knowledge graph with triplet facts grounded on images that reflect not only entities but also their relations. To achieve this purpose, we propose a novel pipeline method, including triplet fact filtering, image retrieving, entity-based image filtering, relation-based image filtering, and image clustering. In this way, a multi-modal knowledge graph named ImgFact is constructed, which contains 247,732 triplet facts and 3,730,805 images. In experiments, the manual and automatic evaluations prove the reliable quality of our ImgFact. We further use the obtained images to enhance model performance on two tasks. In particular, the model optimized by our ImgFact achieves an impressive 8.38% and 9.87% improvement over the solutions enhanced by an existing multi-modal knowledge graph and VisualChatGPT on F1 of relation classification. We release ImgFact and its instructions at https://github.com/kleinercubs/ImgFact.

Integrated Sensing and Communication (ISAC) introduces greater challenges to network transmission in terms of delay, bandwidth, and reliability. Achieving stable and efficient congestion control is a critical issue in emerging ISAC scenarios. However, many traditional congestion control algorithms primarily focus on transmission efficiency but perform poorly in ensuring fairness between different data flows. To address this limitation, this paper proposes a queuing-aware fair congestion control (Q-FCC) solution for ISAC. In particular, Q-FCC incorporates a queue status monitoring module which can provide real-time feedback on the queuing delays at targeted network switches. Additionally, this paper analyzes the traditional BBR algorithm and identifies an inherent flaw: longer RTT flows have a higher bandwidth gain coefficient compared to shorter RTT flows, leading to unfairness. Based on this insight, Q-FCC introduces bandwidth gain factor. Q-FCC uses the queue status monitoring module to categorize data flows into three types and interacts with bursty flow endpoints via ACK packets to assist them in calculating the bandwidth gain factor, which enables the control of the transmission rate. Finally, the algorithm was implemented in the Linux kernel. The results of the semi-physical simulation show that Q-FCC outperforms the traditional BBR and CUBIC algorithms in terms of bandwidth fairness and transmission stability, respectively.

The rapid progress in Deep Learning (DL) and Large Language Models (LLMs) has exponentially increased demands of computational power and bandwidth. This, combined with the high costs of faster computing chips and interconnects, has significantly inflated High Performance Computing (HPC) construction costs. To address these challenges, we introduce the Fire-Flyer AI-HPC architecture, a synergistic hardware-software co-design framework and its best practices. For DL training, we deployed the Fire-Flyer 2 with 10,000 PCIe A100 GPUs, achieved performance approximating the DGX-A100 while reducing costs by half and energy consumption by $40 \%$. We specifically engineered HFReduce to accelerate allreduce communication and implemented numerous measures to keep our Computation-Storage Integrated Network congestion-free. Through our software stack, including HaiScale, 3FS, and HAI-Platform, we achieved substantial scalability by overlapping computation and communication. Our system-oriented experience from DL training provides valuable insights to drive future advancements in AI-HPC.

Abstract Weed recognition is an inevitable problem in smart agriculture, and to realise efficient weed recognition, complex background, insufficient feature information, varying target sizes and overlapping crops and weeds are the main problems to be solved. To address these problems, the authors propose a real‐time semantic segmentation network based on a multi‐branch structure for recognising crops and weeds. First, a new backbone network for capturing feature information between crops and weeds of different sizes is constructed. Second, the authors propose a weight refinement fusion (WRF) module to enhance the feature extraction ability of crops and weeds and reduce the interference caused by the complex background. Finally, a Semantic Guided Fusion is devised to enhance the interaction of information between crops and weeds and reduce the interference caused by overlapping goals. The experimental results demonstrate that the proposed network can balance speed and accuracy. Specifically, the 0.713 Mean IoU (MIoU), 0.802 MIoU, 0.746 MIoU and 0.906 MIoU can be achieved on the sugar beet (BoniRob) dataset, synthetic BoniRob dataset, CWFID dataset and self‐labelled wheat dataset, respectively.

Federated meta-learning (ML) is a promising optimization framework for the intelligent Internet of Things (IoT). However, the generalization ability of existing federated ML is limited because it is a bilayer structure, which has a more complex loss landscape. Moreover, the loss landscape of bilevel optimization has more saddle points and sharp points, which may lead to different generalization performances. Therefore, how to choose an optimal point is crucial for improving the generalization ability of federated ML. For this reason, this article proposes a provable federated ML algorithm by using the sharpness-aware minimization technique, referred to as FedAvg-sharp-MAML (FSM). Furthermore, we rigorously analyse the convergence and generalization bound of FSM. Specifically, when local iteration rounds$T=1$, the rate of$O(1/K)$can be achieved, where K is the number of global iterations. Furthermore, this rate can match the Per-Fedavg method. Meanwhile, we achieve a better generalization bound than the state of the art federated ML, where PAC-Bayesian generalization bounds are introduced in our analysis. Finally, we conduct some experiments to verify the performance of FSM. The experimental results show that the FSM has good generalization performance compared to the existing federated ML algorithms.

In multiagent reinforcement learning, policy evaluation is a central problem. To solve this problem, decentralized temporal-difference (TD) learning is one of the most popular methods, which has been investigated in recent years. However, existing decentralized variants of TD learning often suffer from slow convergence due to the sensitive selection of learning rates. Inspired by the great success of adaptive gradient methods in the training of deep neural networks, this article proposes a decentralized adaptive TD$(\lambda )$learning algorithm for general$\lambda $with linear function approximation, referred to asD-AMSTD$(\boldsymbol {\lambda })$, which can mitigate the selective sensitivity of learning rates. Furthermore, we establish the finite-time performance bounds ofD-AMSTD$(\boldsymbol {\lambda })$under the Markovian observation model. The theoretical results show thatD-AMSTD$(\boldsymbol {\lambda })$can linearly converge to an arbitrarily small size of neighborhood of the optimal weight. Finally, we verify the efficacy ofD-AMSTD$(\boldsymbol {\lambda })$through a variety of experiments. The results show thatD-AMSTD$(\boldsymbol {\lambda })$outperforms existing decentralized TD learning methods.

Semantic communication (SC) is one of the promising solutions for future wireless communications due to its superior transmission efficiency. However, the semantic information cannot be transmitted accurately under noisy channels by the existing methods. For this reason, we propose a fairness-based transmission strategy for STAR-RIS assisted SC systems. On this basis, we investigate two operating protocols of STAR-RIS, energy splitting (ES) and mode switching (MS). More specifically, we maximize the minimum signal-to-noise ratio (SNR) of the users by jointly optimizing the active beamforming and the passive beamforming under the constraint of limited power at the base station (BS). To tackle this max-min optimization problem, for ES, we develop a double-loop iterative algorithm by using the successive convex approximation (SCA) and penalty function methods. For MS protocol, we further add an additional penalty in the objective function to address the optimization problem. Moreover, we rigorously prove that the proposed algorithm can converge to a locally optimal solution. At last, we conduct various experiments to verify the performance of the proposed algorithms. Simulation experiments demonstrate that our algorithm outperforms other benchmark methods in fairness and semantic similarity.

Adaptive gradient algorithms have recently become extremely popular because they have been applied successfully in training deep neural networks, such as Adam, AMSGrad, and AdaBound. Despite their success, however, the distributed variant of the adaptive method, which is expected to possess a rapid training speed at the beginning and a good generalization capacity at the end, is rarely studied. To fill the gap, a distributed adaptive subgradient algorithm is presented, called D-AdaBound, where the learning rates are dynamically bounded by clipping the learning rates. Moreover, we obtain the regret bound of D-AdaBound, in which the objective functions are convex. Finally, we confirm the effectiveness of D-AdaBound by simulation experiments on different datasets. The results show the performance improvement of D-AdaBound relative to existing distributed online learning algorithms.

We consider decentralized large-scale continuous submodular constrained optimization problems over networks, where the goal is to maximize a sum of nonconvex functions with diminishing returns property. However, the computations of the projection step and the whole gradient can become prohibitive in high-dimensional constrained optimization problems. For this reason, a decentralized randomized block-coordinate Frank-Wolfe algorithm is proposed for submoduar maximization over networks by local communication and computation, which adopts the randomized block-coordinate descent and the Frank-Wolfe technique. We also show that the proposed algorithm converges to an approximation fact$(1-e^{-p_{\max }/p_{\min }})$of the global maximal points at a rate of$\mathcal {O}(1/T)$by choosing a suitable stepsize, where$T$is the number of iterations. In addition, we confirm the theoretical results by experiments.

This paper considers a decentralized online submodular maximization problem over time-varying networks, where each agent only utilizes its own information and the received information from its neighbors. To address the problem, we propose a decentralized Meta-Frank-Wolfe online learning method in the adversarial online setting by using local communication and local computation. Moreover, we show that an expected regret bound of $O(\sqrt{T})$ is achieved with $(1-1/e)$ approximation guarantee, where $T$ is a time horizon. In addition, we also propose a decentralized one-shot Frank-Wolfe online learning method in the stochastic online setting. Furthermore, we also show that an expected regret bound $O(T^{2/3})$ is obtained with $(1-1/e)$ approximation guarantee. Finally, we confirm the theoretical results via various experiments on different datasets.

Named Data Networking (NDN) can effectively deal with the rapid development of mobile video services. For NDN, selecting a suitable forwarding interface according to the current network status can improve the efficiency of mobile video communication and can also avoid attacks to improve communication security. For this reason, we propose a stochastic adaptive forwarding strategy based on deep reinforcement learning (SAF-DRL) for secure mobile video communications in NDN. For each available forwarding interface, we introduce the twin delayed deep deterministic policy gradient algorithm to obtain a more robust forwarding strategy. Moreover, we conduct various numerical experiments to validate the performance of SAF-DRL. Compared with BR, RFA, SAF, and AFSndn forwarding strategies, the results show that SAF-DRL can reduce the delivery time and the average number of lost packets to improve the performance of NDN.

Cooperative caching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperative caching mechanisms are performed in an arbitrary graph topology, leading to the complex cooperative operation. For this reason, hierarchical CCN has received widespread attention, which provides simple cooperative operation due to the explicit affiliation between nodes. In this study, the authors propose a heuristic cooperative caching algorithm for maximising the average provider earned profit under the two‐level CCN topology. This algorithm divides the cache space of control nodes into two fractions for caching contents which are downloaded from different sources. One fraction caches duplicated contents and the other caches unique contents. The optimal value of the split factor can be obtained by maximising the earned profit. Furthermore, they also propose a replacement policy to support the proposed caching algorithm. Finally, simulation results show that the proposed caching algorithm can perform better than some traditional caching strategies.

Many problems in the Internet of Things (IoT) can be regarded as online optimization problems. For this reason, an online-constrained problem in IoT is considered in this article, where the cost functions change over time. To solve this problem, many projected online optimization algorithms have been widely used. However, the projections of these algorithms become prohibitive in problems involving high-dimensional parameters and massive data. To address this issue, we propose a Frank- Wolfe Adam online learning algorithm called Frank-Wolfe Adam (FWAdam), which uses a Frank-Wolfe method to eschew costly projection operations. Furthermore, we first give the convergence analysis of the FWAdam algorithm, and prove its regret bound to O(T3/4) when cost functions are convex, where T is a time horizon. Finally, we present simulated experiments on two data sets to validate our theoretical results.

The information name replaces traditional IP address as the identity of the network transmission is a typical feature of Information-Centric Networking (ICN). Therefore, designing efficient lookup algorithms of information names becomes a new challenge. For this reason, we propose an efficient name lookup structure for ICN, called Learned Bloom-Filter Lookup, which combines Recurrent Neural Networks (RNN) with standard Bloom filter to improve lookup efficiency. In our scheme, RNN trains the element set and non-element set, which are used to obtain the pre-filtering of names. Moreover, we look up the contents by using the backup Bloom filter, which can improve the accuracy of the search. In addition, we evaluate the performance of the proposed algorithm by experimental simulations. Compared with the Bloom-Hash method, our results show that our method can reduce the false positive rate. Furthermore, the memory required by our method is less than the Bloom-Hash method.

With the rapid development of the Internet of Things (IoT) in 4G/5G deployments, the massive amount of network data generated by users has exploded, which has not only brought a revolution to human’s living, but also caused some malicious actors to utilize these data to attack the privacy of ordinary users. Therefore, it is crucial to identify the entity users behind multiple virtual accounts. Due to the low precision of user identification in the many-to-many mechanism of user identification, a random forest confirmation algorithm based on stable marriage matching (RFCA-SMM) is proposed in this study. It consists of three key steps: we first employ the stable marriage matching model to calculate the similarity between multiple users and utilize a scoring model to calculate the overall similarity of the users, after which candidate matching pairs are selected; second, we construct the random forest model that exploits a user similarity vector training set; afterward, the candidate matching pairs combine the secondary confirmation of the random forest model, which both improve the precision of the many-to-many user identification and protect private user data in the IoT. Extensive experiments are provided to demonstrate that the proposed algorithm improves precision rate, recall rate, and F-Measure (F1), as well as Area Under Curve (AUC).

Mobile Microlearning, a novel fusion form of the mobile Internet, cloud computing, and microlearning, becomes more prevalent in recent years. However, its high deployment and operational costs make energy saving in cloud become a concerning issue. In this paper, to save energy consumption, a resource deployment approach to cloud service provision for Mobile Microlearning is proposed. Chinese Lexical Analysis System and Dynamic Term Frequency-Inverse Document Frequency (D-TF-IDF) are adopted to implement resource classification. Resources are deployed to the 2-tier cloud architecture according to the classification results. Grey Wolf Optimization (GWO) algorithm is used to forecast real-time energy consumption per byte. The simulation results show that, compared to traditional algorithm, the classification accuracy of small sample categories was significantly improved; the forecast energy consumption value and the standard values are 7.67% in private cloud and 2.93% in public cloud; the energy saving reaches 2.22% to 16.23% in 3G and 7.35% to 20.74% in Wi-Fi.

Computing offloading of mobile devices (MDs) through cloud is a greatly effective way to solve the problem of local resource constraints. However, cloud servers are usually located far away from MDs leading to a long response time. To this end, edge cloud servers (ECSs) provide a shorter response time due to being closer to MDs. In this paper, we propose a computing offloading game for MDs and ECSs. We prove the existence of a Stackelberg equilibrium in the game. In addition, we propose two algorithms, F‐SGA and C‐SGA, for delay‐sensitive and compute‐intensive applications, respectively. Moreover, the response time is reduced by F‐SGA, which makes decisions quickly. An optimal decision is obtained by C‐SGA, which achieves the equilibrium. Both algorithms above proposed can adjust the computing resource and utility of system users according to parameters control in computing offloading. The simulation results show that the game significantly saves the computing resources and response time of both the MD and the ECSs during the computing offloading process.

Routing in mobile ad hoc networks (MANETs) is an extremely challenging issue due to the features of MANETs. In this paper, we present a novel bio-inspired hybrid routing protocol (B-iHRP) supporting multimedia delivery based on zone routing framework, ant colony optimization (ACO) and physarum autonomic optimization (PAO). B-iHRP divides network topology into a series of zones subjectively. Within a zone, the route table of central node is proactively maintained by perceptive ants which can sense link status metrics through cross-layer perception to assess the discovered routes. Among zones, perceptive ants are sent to reactively find routes to destinations as well as assess the discovered routes with the metrics by source nodes. Afterwards, B-iHRP uses PAO to select the optimal one from the found routes and optimize autonomically the local routes during the course of multi-zone communication sessions. Simulation results show how B-iHRP can achieve the effective performance compared to existing state-of-the-art algorithms.

In this paper, we present a novel bio-inspired trusted routing framework (B-iTRF) which composed of trust mechanism and routing strategy. For trust mechanism, B-iTRF monitors neighbors' behavior in real time and then assesses neighbors' trust value based on the priori knowledge. For routing strategy, each node finds routes to the Sink based on ant colony optimization. In the process of path finding, B-iTRF senses and calculates the metrics of the found routes to support the route selection. Moreover, B-iTRF also assesses the availability of route based on Physarum autonomic optimization to maintain the route table. Simulation results show that B-iTRF can achieve the effective performance compared to existing state-of-the-art algorithms.

There is a trade-off between routing efficiency and energy equilibrium for sensor nodes in wireless sensor networks (WSNs). Inspired by the large and single-celled amoeboid organism-slime mold physarum polycephalum, this paper presents a novel physarum-inspired routing protocol (P-iRP) for WSNs to address the above issue. In P-iRP, a sensor node selects its proper next hop by using a proposed physarum-inspired selecting next hop model (PSN), which considers comprehensively the distance, energy residue and location of the next hop. We introduce the PSN's routing selecting strategy and detail PiRP's algorithms. Simulation results show how P-iRP can achieve the effective trade-off between routing efficiency and energy equilibrium compared to existing classical algorithms.

A multispectral image context classification which is based on a stochastic relaxation algorithm and Markov-Gibbs random field is presented. The implementation of the relaxation algorithm is related to a form of optimization programming using annealing. The authors discuss the motivation for a Bayesian context-decision rule, and then use a Markov-Gibbs model to develop a contextual classification algorithm in which maximizing the posterior probability is based on stochastic relaxation. Experimental results that are based on simulated and real multispectral remote sensing images are presented to show how classification accuracy is greatly improved. The algorithm is highly parallel and exploits the equivalence between Gibbs distributions and Markov random fields.>

A new, fast template-matching method using the Singular Value Decomposition (SVD) is presented. This approach involves a two-stage algorithm, which can be used to increase the speed of the matching process. In the first stage, the reference image is orthogonally separated by the SVD and then low-cost pseudo-correlation values are calculated. This reduces the number of computations to 2*N*L instead of N2L2, where L × L is the size of the reference image and N × N is the original image size. At the second stage, a small group of values near the maximum pseudo-correlation is selected. the true correlation for the small number of pixels in this group is them computed precisely in the second stage. Experimental and analytic results are presented to show how the computation complexity is greatly improved.