IF 6.3 3区计算机科学

IEEE Wireless Communications Letters Pub Date : 2025-07-01 DOI: 10.1109/lwc.2025.3584370

Mingtong Zhang, Haixia Zhang, Wenjie Liu, Hui Ding, Dongfeng Yuan

引用次数: 0

A modified genetic algorithm for large-scale and joint satellite mission planning 大型联合卫星任务规划的改进遗传算法

IF 5 3区计算机科学

Egyptian Informatics Journal Pub Date : 2025-07-01 DOI: 10.1016/j.eij.2025.100713

Qingbiao Zheng , Yuanwen Cai , Peng Wang

{"title":"A modified genetic algorithm for large-scale and joint satellite mission planning","authors":"Qingbiao Zheng , Yuanwen Cai , Peng Wang","doi":"10.1016/j.eij.2025.100713","DOIUrl":"10.1016/j.eij.2025.100713","url":null,"abstract":"<div><div>In the context of global space technology’s rapid advancements, an increasing number of Earth observation satellites are being deployed to perform remote sensing missions, including target identification and regional surveillance. However, the inherent limitations of individual satellite systems — such as restricted observational coverage, temporal constraints, and resource capacities — necessitate collaborative multi-constellation operations to fulfill complex mission demands. This integration introduces a large-scale, multi-dimensional optimization challenge characterized by conflicting objectives (e.g., maximizing mission success rates and observational utility) and intricate constraints (e.g., satellite payload limitations and task-specific requirements). To address these complexities, we propose an enhanced hybrid genetic algorithm (GA) framework that integrates three complementary strategies: (1) an adaptive parameter tuning mechanism to balance exploration–exploitation trade-offs during evolution dynamically, (2) a tabu search-based local optimization module to refine solution quality while avoiding premature convergence, and (3) an elitist preservation protocol to retain high-performance candidates across generations. Simulation experiments conducted on representative mission scenarios demonstrate that the proposed methodology achieves superior performance compared to conventional algorithms, particularly in scenarios requiring stringent resource allocation and real-time responsiveness. The results validate the ability of the framework to solve large-scale satellite mission planning problems within relevant constraints effectively.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"31 ","pages":"Article 100713"},"PeriodicalIF":5.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144517746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mitigating moral hazard in financial leasing: The role of open banking 缓解融资租赁中的道德风险：开放银行的作用

IF 7.5 1区计算机科学

Expert Systems with Applications Pub Date : 2025-07-01 DOI: 10.1016/j.eswa.2025.128831

Wenyi Zhang , Chen Bi , Feng Yang , Dawei Wang

{"title":"Mitigating moral hazard in financial leasing: The role of open banking","authors":"Wenyi Zhang , Chen Bi , Feng Yang , Dawei Wang","doi":"10.1016/j.eswa.2025.128831","DOIUrl":"10.1016/j.eswa.2025.128831","url":null,"abstract":"<div><div>Small and medium-sized manufacturers usually lack cashes to upgrade equipment that plays a role in manufacturing transformation. Financial leasing has emerged as an innovative instrument to address this challenge by rent installment with controlling equipment operations. To examine moral hazard arising from separation of ownership and control rights in leasing businesses, we consider a pull supply chain consisting of a capital-constrained manufacturer, a retailer providing production funds, and a lessor offering leased equipment. Our game-theoretical analysis shows the lessor’s screening ability and maintenance fees do not directly affect the manufacturer’s production quantity or the retailer’s wholesale price, regardless of open banking adoption. Moreover, while open banking reduces financial inclusion by restricting loans to unreliable lessees, it enables the lessor to set lower interest rates for reliable ones. The induced transaction transparency shows a moral hazard paradox where the reduced financial costs may outweigh the maintenance loss, and the manufacturer benefits from open banking. Conversely, the retailer is reluctant to open banking due to reduced transaction feasibility. We further find that the manufacturer is willing to share revenue with the retailer when the coefficient is moderate under open banking. Additionally, the lessor can monetize open banking data to incentivize manufacturer participation, creating a self-reinforcing loop of lower interest rates, higher data monetization, and expanded profit redistribution. Our findings show that a simple “one-size-fits-all” policy, armed with data-embedded revenue-sharing contracts can enhance social welfare despite financial inclusion.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"294 ","pages":"Article 128831"},"PeriodicalIF":7.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144518121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Combinatorial Average Energy Controllability (CAEC) for Analyzing Interaction of Functional Brain Networks 用于分析脑功能网络相互作用的组合平均能量可控性

IF 2.2 4区计算机科学

IET Control Theory and Applications Pub Date : 2025-07-01 DOI: 10.1049/cth2.70048

Sana Motallebi, Mohammad Javad Yazdanpanah, Abdol-Hossein Vahabie

{"title":"Combinatorial Average Energy Controllability (CAEC) for Analyzing Interaction of Functional Brain Networks","authors":"Sana Motallebi, Mohammad Javad Yazdanpanah, Abdol-Hossein Vahabie","doi":"10.1049/cth2.70048","DOIUrl":"https://doi.org/10.1049/cth2.70048","url":null,"abstract":"<p>Understanding how different functional brain networks interact is crucial for revealing the complexity of brain function and behavior. This study addresses this gap by investigating how brain transitions occur between functional brain networks, focusing on the controllability of brain structural subsets. Previous studies on brain controllability have primarily focused on whole-brain connectivity networks, which do not adequately capture the transition abilities of weakly connected regions. To address this issue, we introduce a new metric—combinatorial average energy controllability (CAEC)—which assesses the influence of functional networks based on their ability to modulate other networks using low-energy control inputs. By employing manifold learning and geodesic distance calculations, we aggregate influence vectors to provide a comprehensive view of energy propagation capacities in less connected functional networks, complementing conventional average controllability measures. Our findings demonstrate that even regions with weak connections can propagate input energy, while some moderately connected ones do not, and strong connections preserve their distribution abilities. Additionally, we utilize optimal control cost calculations to compare with CAEC results, revealing how the brain's structure and connections affect its function. This study offers new insights into how increased activity in different functional networks influences brain activity, with implications for understanding cognitive processes and addressing neurological disorders.</p>","PeriodicalId":50382,"journal":{"name":"IET Control Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cth2.70048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144520091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IPMN: Invertible privacy-preserving mask network with intellectual property protection IPMN：具有知识产权保护的可逆保密掩码网络

IF 3.8 2区计算机科学

Journal of Information Security and Applications Pub Date : 2025-07-01 DOI: 10.1016/j.jisa.2025.104149

Yang Yang , Xiangjie Huang , Han Fang , Weiming Zhang

{"title":"IPMN: Invertible privacy-preserving mask network with intellectual property protection","authors":"Yang Yang , Xiangjie Huang , Han Fang , Weiming Zhang","doi":"10.1016/j.jisa.2025.104149","DOIUrl":"10.1016/j.jisa.2025.104149","url":null,"abstract":"<div><div>Facial information is widely used in security fields like identity authentication. But the large number of facial images online makes them vulnerable to unauthorized capture, posing privacy and security risks. Existing face privacy protection methods aim to mitigate these risks. However, many of these methods lack reversibility, making it impossible to restore the original face when needed. Additionally, they often neglect model intellectual property (IP) protection, leaving methods vulnerable to unauthorized stealing. Therefore, to address the shortcomings of existing face privacy protection methods in IP protection, this paper proposes an invertible privacy protection mask network with IP protection. The proposed method consists of two main parts: facial privacy protection and IP protection. For facial privacy protection, the mask generator replaces facial features with other faces and generates the mask, which is then embedded with the watermark to generate the watermarked mask. This watermarked mask conceals the original face by the putting on mask network, and the original face can be restored by the putting off mask network. For IP protection, the watermark extractor network is a key component that can extract the watermark from images of the sender, receiver and attacker to verify the method’s IP. Experimental results show that the proposed method has good effects in both privacy protection and IP protection, providing double security for face privacy protection.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"93 ","pages":"Article 104149"},"PeriodicalIF":3.8,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144524298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Geometric covering using random fields 使用随机场的几何覆盖

IF 0.9 4区计算机科学

Theoretical Computer Science Pub Date : 2025-07-01 DOI: 10.1016/j.tcs.2025.115431

Amit Shahar , Daniel Keren , Felipe Gonçalves , Gal Yehuda

{"title":"Geometric covering using random fields","authors":"Amit Shahar , Daniel Keren , Felipe Gonçalves , Gal Yehuda","doi":"10.1016/j.tcs.2025.115431","DOIUrl":"10.1016/j.tcs.2025.115431","url":null,"abstract":"<div><div>A set of vectors <span><math><mi>S</mi><mo>⊆</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> is <span><math><mo>(</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mi>ε</mi><mo>)</mo></math></span>-clusterable if there are <span><math><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> balls of radius <em>ε</em> that cover <em>S</em>. A set of vectors <span><math><mi>S</mi><mo>⊆</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> is <span><math><mo>(</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mi>δ</mi><mo>)</mo></math></span>-far from being clusterable if there are at least <span><math><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> vectors in <em>S</em>, with all pairwise distances at least <em>δ</em>. We propose a probabilistic algorithm to distinguish between these two cases. Our algorithm reaches a decision by only looking at the extreme values of a <em>scalar valued</em> hash function, defined by a <em>random field</em>, on <em>S</em>; hence, it is especially suitable in distributed and online settings. An important feature of our method is that the algorithm is oblivious to the number of vectors: in the online setting, for example, the algorithm stores only a constant number of scalars, which is independent of the stream length.</div><div>We introduce random field hash functions, which are a key ingredient in our paradigm. Random field hash functions generalize <em>locality-sensitive hashing</em> (LSH). In addition to the LSH requirement that “nearby vectors are hashed to similar values”, our hash function also guarantees that the “hash values are (nearly) independent random variables for distant vectors”. We formulate necessary conditions for the kernels which define the random fields applied to our problem, as well as a measure of kernel optimality, for which we provide a bound. Then, we propose a method to construct kernels which approximate the optimal one.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1052 ","pages":"Article 115431"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144523321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A spatiotemporal dynamic fusion network for surgical action recognition 一种用于手术动作识别的时空动态融合网络

IF 5.5 2区计算机科学

Neurocomputing Pub Date : 2025-07-01 DOI: 10.1016/j.neucom.2025.130808

Gui-Bin Bian, Yaqin Peng, Zhen Li, Qiang Ye, Ruichen Ma

{"title":"A spatiotemporal dynamic fusion network for surgical action recognition","authors":"Gui-Bin Bian, Yaqin Peng, Zhen Li, Qiang Ye, Ruichen Ma","doi":"10.1016/j.neucom.2025.130808","DOIUrl":"10.1016/j.neucom.2025.130808","url":null,"abstract":"<div><div>Surgical action recognition is crucial and tough in intelligent surgical robots, enabling these systems to accurately identify and interpret the ongoing actions within a surgical procedure. By recognizing the action state in real-time, the robot can provide immediate feedback and make adjustments to ensure the precision and safety of the surgery. However, it faces several challenges, such as the temporal complexity of surgical actions, the fine operation steps and subtle changes in surgical movements. Thus, a dynamic attention mechanism has been proposed to capture the temporal correlation between the current frame and the previous frames from video sequence. Furthermore, a spatiotemporal dynamic fusion network comprising two specialized modules has been proposed. The first module, Double Bi-level Routing Attention (DBRA), is designed to extract the most pertinent spatial and temporal features. While the other module, CNN-LSTM, is dedicated to delivering comprehensive spatiotemporal information. Experiments have been conducted on both a neurosurgical dataset Neuro67 and a public dataset Suturing to demonstrate the performance of the proposed method. The results indicate that the proposed method has achieved superior performance on the hard issue, achieving AP on Neuro67 and ACC on Suturing of 76.9% and 85.5%, leading by 6.7% and 1.2% respectively, with the modules effectively focusing on dependency relationships both within regions of a frame and across frames in video sequence.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"649 ","pages":"Article 130808"},"PeriodicalIF":5.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144523755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improved PHY-Layer Authentication Utilizing Radiation Pattern Feature for 6G-IoT Systems 利用辐射模式特征改进的6G-IoT系统物理层认证

IF 10.6 1区计算机科学

IEEE Internet of Things Journal Pub Date : 2025-07-01 DOI: 10.1109/jiot.2025.3584617

Changjian Qin, Mu Niu, Ji He, Pinchang Zhang

引用次数: 0

A Two-Layer RSMA Framework With Balanced Clustering Design for Cell-Free Massive MIMO Systems 无小区大规模MIMO系统的两层均衡聚类RSMA框架

IF 10.6 1区计算机科学

IEEE Internet of Things Journal Pub Date : 2025-07-01 DOI: 10.1109/jiot.2025.3584822

Ziheng Li, Tong Wang, Lin Gao, Yufei Jiang, Zhihua Yang

引用次数: 0

Waveform-Domain Complementary Moving Target Detection Utilizing Complementary Signal Sets for Multi-Interrupted Sampling Repeater Jamming Suppression 利用互补信号集抑制多中断采样中继器干扰的波形域互补运动目标检测