检索结果-内蒙古大学图书馆

SAND: semi-automated adaptive network defense via programmable rule generation and deployment

Science China(Information Sciences) 2022年第7期65卷 121-138页

作者： Haoyu CHEN Deqing ZOU Hai JIN Shouhuai XU Bin YUAN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and Technology Department of Computer Science University of Colorado at Colorado Springs

Cyber security is dynamic as defenders often need to adapt their defense postures. The state-ofthe-art is that the adaptation of network defense is done manually(i.e., tedious and error-prone). The ideal solution is to automate adaptive network defense, which is however a difficult problem. As a first step towards automation, we propose investigating how to attain semi-automated adaptive network defense(SAND). We propose an approach extending the architecture of software-defined networking, which is centered on providing defenders with the capability to program the generation and deployment of dynamic defense rules enforced by network defense tools. We present the design and implementation of SAND, as well as the evaluation of the prototype implementation. Experimental results show that SAND can achieve agile and effective dynamic adaptations of defense rules(less than 15 ms on average for each operation), while only incurring a small performance overhead.

关键词： network defense Network defense adaptive defense automated defense programmable defense security services software-defined networking security management

来源：评论

学校读者我要写书评

暂无评论

TransRec++:Translation-based sequential recommendation with heterogeneous feedback

引用

Frontiers of Computer Science 2022年第2期16卷 190-192页

作者： Zhuo-Xin ZHAN Ming-Kai HE Wei-Ke PAN Zhong MING National Engineering Laboratory for Big Data System Computing Technology Shenzhen UniversityShenzhen 518060China College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China

1 Introduction Nowadays,recommender systems are widely used because of the information overload problem on the *** are a variety of feedback in recommender systems,such as explicit feedback,implicit feedback,sequential feedback,*** them,modeling of heterogeneous sequential feedback,which contains not only different types of feedback such as examinations and purchases but also the sequential information,is an emerging and important problem receiving more and more *** sequential feedback is relatively easy to be collected in a deployed system and is also able to provide more information than the homogeneous feedback,which is thus expected to be helpful in improving the recommendation accuracy.

关键词： feedback recommendation sequential

来源：评论

学校读者我要写书评

暂无评论

MalScan: Android Malware Detection Based on Social-Network Centrality Analysis

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Wu, Yueming Suo, Wenqi Feng, Siyue Zou, Deqing Yang, Wei Liu, Yang Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Jinyinhu Laboratory Wuhan430074 China University of Texas at Dallas United States Nanyang Technological University Singapore Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

Malware scanning of an app market is expected to be scalable and effective. However, existing approaches use syntax-based features that can be evaded by transformation attacks or semantic-based features which are usually extracted by expensive program analysis. Therefore, to address the scalability challenges of traditional heavyweight static analysis, we propose a graph-based lightweight approach MalScan for Android malware detection. MalScan considers the function call graph as a complex social network and employs centrality analysis on sensitive application program interfaces (APIs) to express the semantic characteristics of the graph. On this basis, machine learning algorithms and ensemble learning algorithms are applied to classify the extracted features. We evaluate MalScan on datasets of 104,892 benign apps and 108,640 malwares, and the results of experiments indicate that MalScan outperforms six state-of-the-art detectors and can quickly detect Android malware with an f-value as high as 99%. In addition, there are also significant improvements in the robustness of Android app evolution and robustness to obfuscation. Finally, we conduct an exhaustive statistical study of over one million applications in the Google-Play app market and successfully identify 498 zero-day malware, which further validates the feasibility of MalScan on market-wide malware scanning. © 2004-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Full-Space Wireless Sensing Enabled by Multi-Sector Intelligent Surfaces

引用

IEEE Transactions on Wireless Communications 2025年

作者： Zhang, Yumeng Shao, Xiaodan Li, Hongyu Clerckx, Bruno Zhang, Rui Hong Kong University of Science and Technology Electronic and Computing Engineering Hong Kong Hong Kong University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada Internet of Things Thrust Guangdong Guangzhou511400 China Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom Kyung Hee University Seoul Korea Republic of The Chinese University of HongKong School of Science and Engineering Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China National University of Singapore Department of Electrical and Computer Engineering Singapore117583 Singapore

The multi-sector intelligent surface (IS), benefiting from a smarter wave manipulation capability, has been shown to enhance channel gain and offer full-space coverage in communications. However, the benefits of multi-sector IS in wireless sensing remain unexplored. This paper introduces the application ofmulti-sector IS for wireless sensing/localization. Specifically, we propose a new self-sensing system, where an active source controller uses the multi-sector IS geometry to reflect/scatter the emitted signals towards the entire space, thereby achieving full-space coverage for wireless sensing. Additionally, dedicated sensors are installed aligned with the IS elements at each sector, which collect echo signals fromthe target and cooperate to sense the target angle. In this context, we develop a maximum likelihood estimator of the target angle for the proposed multi-sector IS self-sensing system, along with the corresponding theoretical limits defined by the Craḿer-Rao Bound. The analysis reveals that the advantages of the multi-sector IS self-sensing system stem from two aspects: enhancing the probing power on targets (thereby improving power efficiency) and increasing the rate of target angle (thereby enhancing the transceiver's sensitivity to target angles). Finally, our analysis and simulations confirm that the multi-sector IS self-sensing system, particularly the 4-sector architecture, achieves full-space sensing capability beyond the single-sector IS configuration. Furthermore, similarly to communications, employing directive antenna patterns on each sector's IS elements and sensors significantly enhances sensing capabilities. This enhancement originates from both aspects of improved power efficiency and target angle sensitivity, with the former also being observed in communications while the latter being unique in sensing. © 2002-2012 IEEE.

关键词： Directive antennas

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Qing Liu Qian Gao Jun Fan Zhiqiang Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Ltd Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN— a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model’s effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets.

关键词： Measurement Bridges Contrastive learning Signal processing data processing Vectors Space exploration Resource management Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

Flip Learning: Weakly Supervised Erase to Segment Nodules in Breast Ultrasound

arXiv

引用

arXiv 2025年

作者： Huang, Yuhao Chang, Ao Dou, Haoran Tao, Xing Zhou, Xinrui Cao, Yan Huang, Ruobing Frangi, Alejandro F. Bao, Lingyun Yang, Xin Ni, Dong National-Regional Key Technology Engineering Laboratory for Medical Ultrasound School of Biomedical Engineering Shenzhen University Medical School Shenzhen University Shenzhen China Lab Shenzhen University Shenzhen China Marshall Laboratory of Biomedical Engineering Shenzhen University Shenzhen China School of Computing University of Leeds Leeds United Kingdom Shenzhen RayShape Medical Technology Co. Ltd Shenzhen China Division of Informatics Imaging and Data Science School of Health Sciences University of Manchester Manchester United Kingdom Department of Computer Science School of Engineering University of Manchester Manchester United Kingdom Department of Electrical Engineering Department of Cardiovascular Sciences KU Leuven Belgium Alan Turing Institute London United Kingdom NIHR Manchester Biomedical Research Centre Manchester Academic Health Science Centre Manchester United Kingdom Department of Ultrasound Affiliated Hangzhou First People’s Hospital School of Medicine Westlake University China School of Biomedical Engineering and Informatics Nanjing Medical University Nanjing China

Accurate segmentation of nodules in both 2D breast ultrasound (BUS) and 3D automated breast ultrasound (ABUS) is crucial for clinical diagnosis and treatment planning. Therefore, developing an automated system for nodule segmentation can enhance user independence and expedite clinical analysis. Unlike fully-supervised learning, weakly-supervised segmentation (WSS) can streamline the laborious and intricate annotation process. However, current WSS methods face challenges in achieving precise nodule segmentation, as many of them depend on inaccurate activation maps or inefficient pseudo-mask generation algorithms. In this study, we introduce a novel multi-agent reinforcement learning-based WSS framework called Flip Learning, which relies solely on 2D/3D boxes for accurate segmentation. Specifically, multiple agents are employed to erase the target from the box to facilitate classification tag flipping, with the erased region serving as the predicted segmentation mask. The key contributions of this research are as follows: 1) Adoption of a superpixel/supervoxel-based approach to encode the standardized environment, capturing boundary priors and expediting the learning process. 2) Introduction of three meticulously designed rewards, comprising a classification score reward and two intensity distribution rewards, to steer the agents’ erasing process precisely, thereby avoiding both under- and over-segmentation. 3) Implementation of a progressive curriculum learning strategy to enable agents to interact with the environment in a progressively challenging manner, thereby enhancing learning efficiency. Extensively validated on the large in-house BUS and ABUS datasets, our Flip Learning method outperforms state-of-the-art WSS methods and foundation models, and achieves comparable performance as fully-supervised learning algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of Computer Science & technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Resource investment for DDoS attack resistant SDN: a practical assessment

引用

Science China(Information Sciences) 2023年第7期66卷 112-129页

作者： Bin YUAN Fan ZHANG Jun WAN Huan ZHAO Shui YU Deqing ZOU Qiangsheng HUA Hai JIN School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Shenzhen Huazhong University of Science and Technology Research Institute School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab School of Computer Science University of Technology Sydney

Software-defined networks(SDNs) present a novel network architecture that is widely used in various datacenters. However, SDNs also suffer from many types of security threats, among which a distributed denial of service(DDoS) attack, which aims to drain the resources of SDN switches and controllers,is one of the most common. Once the switch or controller is damaged, the network services can be *** defense schemes against DDoS attacks have been proposed from the perspective of attack detection;however, such defense schemes are known to suffer from a time consuming and unpromising accuracy, which could result in an unavailable network service before specific countermeasures are taken. To address this issue through a systematic investigation, we propose an elaborate resource-management mechanism against DDoS attacks in an SDN. Specifically, by considering the SDN topology, we leverage the M/M/c queuing model to measure the resistance of an SDN to DDoS attacks. Network administrators can therefore invest a reasonable number of resources into SDN switches and SDN controllers to defend against DDoS attacks while guaranteeing the quality of service(QoS). Comprehensive analyses and empirical data-based experiments demonstrate the effectiveness of the proposed approach.

关键词： SDN security DDoS attacks resource management queueing theory QoS

来源：评论

学校读者我要写书评

暂无评论

A Tutorial on Six-Dimensional Movable Antenna Enhanced Wireless Networks: Synergizing Positionable and Rotatable Antennas

arXiv

引用

arXiv 2025年

作者： Shao, Xiaodan Mei, Weidong You, Changsheng Wu, Qingqing Zheng, Beixiong Wang, Cheng-Xiang Li, Junling Zhang, Rui Schober, Robert Zhu, Lipeng Zhuang, Weihua Shen, Xuemin Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada Chengdu611731 China Shenzhen518055 China Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Microelectronics South China University of Technology Guangzhou511442 China National Mobile Communications Research Laboratory School of Information Science and Engineering Southeast University Nanjing211189 China School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Guangdong Shenzhen518172 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore Erlangen91054 Germany

Six-dimensional movable antenna (6DMA) is a new and revolutionary technique that fully exploits the wireless channel spatial variations at the transmitter/receiver by flexibly adjusting the three-dimensional (3D) positions and/or 3D rotations of antennas/antenna surfaces (sub-arrays), thereby improving the performance of wireless networks cost-effectively without the need to deploy additional antennas. It is thus expected that the integration of new 6DMAs into future sixth-generation (6G) wireless networks will fundamentally enhance antenna agility and adaptability, and introduce new degrees of freedom (DoFs) for system design. Despite its great potential, 6DMA faces new challenges to be efficiently implemented in wireless networks, including corresponding architectures, antenna position and rotation optimization, channel estimation, and system design from both communication and sensing perspectives. In this paper, we provide a tutorial on 6DMA-enhanced wireless networks to address the above issues by unveiling associated new channel models, hardware implementations and practical position/rotation constraints, as well as various appealing applications in wireless networks. Moreover, we discuss two special cases of 6DMA, namely, rotatable 6DMA with fixed antenna position and positionable 6DMA with fixed antenna rotation, and highlight their respective design challenges and applications. We further present prototypes developed for 6DMA-enhanced communication along with experimental results obtained with these prototypes. Finally, we outline promising directions for further investigation. Copyright © 2025, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer Science & technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：