检索结果-南通市图书馆

Small World Model-Based Polylogarithmic Routing Using Mobile Nodes

Journal of computer science & Technology 2008年第3期23卷 327-342页

作者：吴杰杨书慧 Department of computer science and Engineering Florida Atlantic University Department of computer science Rensselear Polytechnic Institute

The use of mobile nodes to improve network system performance has drawn considerable attention recently The movement-assisted model considers mobility as a desirable feature, where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes. The application of such a model has been used in several emerging networks, including mobile ad hoc networks （MANETs）, wireless sensor networks （WSNs）, and delay tolerant networks （DTNs）. It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing, prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors, and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network. Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay, average number of relays, and moving distance. In this paper, we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals, including delay, the number of relays, and moving distance. The model is based on the small-world model where each static node has ＂short＂ link connections to its nearest neighbors and ＂long＂ link connections to other nodes following a certain probability distribution. Short links are regular wireless connections whereas long links are implemented using mobile nodes. Various issues are considered, including trade-offs between delay and average number of relays, selection of the number of mobile nodes, and selection of the number of long links. The effectiveness of the proposed model is evaluated analytically as well as through simulation.

关键词： delay tolerant network (DTN) mobile ad hoc network (MANET) routing simulation small-world model wireless sensor network (WSN)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Static tainting extraction approach based on information flow graph for personally identifiable information

引用

science China(Information sciences) 2020年第3期63卷 156-172页

作者： Yi LIU Lejian LIAO Tian SONG School of computer science and Technology Beijing Institute of Technology College of Mathematics and computer science Yan'an University

Personally identifiable information(PII) is widely used for many aspects such as network privacy leak detection, network forensics, and user portraits. Internet service providers(ISPs) and administrators are usually concerned with whether PII has been extracted during the network transmission process. However,most studies have focused on the extractions occurring on the client side and server side. This study proposes a static tainting extraction approach that automatically extracts PII from large-scale network traffic without requiring any manual work and feedback on the ISP-level network traffic. The proposed approach does not deploy any additional applications on the client side. The information flow graph is drawn via a tainting process that involves two steps: inter-domain routing and intra-domain infection that contains a constraint function(CF) to limit the "over-tainting". Compared with the existing semantic-based approach that uses network traffic from the ISP, the proposed approach performs better, with 92.37% precision and 94.04%recall. Furthermore, three methods that reduce the computing time and the memory overhead are presented herein. The number of rounds is reduced to 0.0883%, and the execution time overhead is reduced to 0.0153%of the original approach.

关键词： personally identifiable information network privacy leak detection static tainting network traffic analysis information flow graph inter-domain routing intra-domain infection constraint function

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A Specific-Targeting Asymmetric Group Key Agreement for Cloud Computing

引用

Chinese Journal of Electronics 2018年第4期27卷 866-872页

作者： TAN Yu'an ZHENG Jiamin ZHANG Qikun ZHANG Xiaosong LI Yuanzhang ZHANG Quanxin School of computer science and Technology Beijing Institute of Technology institute of computer and Communication Engineering Zhengzhou University of Light Industry Department of computer science and Technology Tangshan University

When the information is exchanged and transmitted among the group members in mobile cloud environment, the group members may distribute different security domains. The information exchanged among group members may have different secret levels in this environment. When a person has some secret information, he only wants to share these information with some people who have the appropriate level of security permissions, other than all the members in the group. Aiming at these needs,we propose a flexible Asymmetric group key agreement(AGKA) protocol that information exchange and transmission are specific-targeting. The paper adopts bilinear mapping and two-way anonymous authentication technology to hide personal identity authentication information, and uses storage and computing migration technology to reduce the resource consumption of mobile terminal, and also proposes the secret key factor oriented extraction and combinations technology to achieve multi-level three-dimensional complex space security information exchange requirements and meet the lightweight computing. The analysis proves that the protocol has good safety performance and low resource consumption.

关键词： Asymmetric group key agreement(AGKA) Specific-targeting information exchange Key self-certified Mobile cloud

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Relative difficulty distillation for semantic segmentation

引用

science China(Information sciences) 2024年第9期67卷 126-145页

作者： Dong LIANG Yue SUN Yun DU Songcan CHEN Sheng-Jun HUANG MIIT Key Laboratory of Pattern analysis and Machine Intelligence College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Shenzhen Research institute Nanjing University of Aeronautics and Astronautics

Current knowledge distillation(KD) methods primarily focus on transferring various structured knowledge and designing corresponding optimization goals to encourage the student network to imitate the output of the teacher network. However, introducing too many additional optimization objectives may lead to unstable training, such as gradient conflicts. Moreover, these methods ignored the guidelines of relative learning difficulty between the teacher and student networks. Inspired by human cognitive science, in this paper, we redefine knowledge from a new perspective — the student and teacher networks' relative difficulty of samples, and propose a pixel-level KD paradigm for semantic segmentation named relative difficulty distillation(RDD). We propose a two-stage RDD framework: teacher-full evaluated RDD(TFE-RDD) and teacher-student evaluated RDD(TSE-RDD). RDD allows the teacher network to provide effective guidance on learning focus without additional optimization goals, thus avoiding adjusting learning weights for multiple losses. Extensive experimental evaluations using a general distillation loss function on popular datasets such as Cityscapes, Cam Vid, Pascal VOC, and ADE20k demonstrate the effectiveness of RDD against state-ofthe-art KD methods. Additionally, our research showcases that RDD can integrate with existing KD methods to improve their upper performance bound. Codes are available at https://***/sunyueue/***.

关键词： knowledge distillation semantic segmentation relative difficulty sample weighting prediction discrepancy

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Secure Speculation via Speculative Secret Flow Tracking

引用

Journal of computer science & Technology 2023年第2期38卷 422-438页

作者：崔宏伟杨春程旭 School of computer science Engineering Research Center of Microprocessor and System Peking UniversityBeijing 100871China

Speculative execution attacks can leak arbitrary program data under malicious speculation,presenting a severe security *** on two key observations,this paper presents a software-transparent defense mechanism called speculative secret flow tracking(SSFT),which is capable of defending against all cache-based speculative execution attacks with a low performance ***,we observe that the attacker must use array or pointer variables in the victim code to access arbitrary memory ***,we propose a strict definition of secret data to reduce the amount of data to be ***,if the load is not data-dependent and control-dependent on secrets,its speculative execution will not leak any ***,this paper introduces the concept of speculative secret flow to analyze how secret data are obtained and propagated during speculative *** tracking speculative secret flow in hardware,SSFT can identify all unsafe speculative loads(USLs)that are dependent on ***,SSFT exploits three different methods to constrain USLs’speculative execution and prevent them from leaking secrets into the cache and translation lookaside buffer(TLB)*** paper evaluates the performance of SSFT on the SPEC CPU 2006 workloads,and the results show that SSFT is effective and its performance overhead is very *** defend against all speculative execution attack variants,SSFT only incurs an average slowdown of 4.5%(Delay USL-L1Miss)or 3.8%(Invisible USLs)compared to a non-secure *** analysis also shows that SSFT maintains a low hardware overhead.

关键词： cache side channel attack hardware speculative execution attack security

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Online Fault-Tolerant Tracking Control With Adaptive Critic for Nonaffine Nonlinear systems

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期 215-227页

作者： Ding Wang Lingzhi Hu Xiaoli Li Junfei Qiao IEEE the School of Information science and Technology Beijing Key Laboratory of Computational Intelligence and Intelligent SystemBeijing Laboratory of Smart Environmental Protection and Beijing Institute of Artificial Intelligence Beijing University of Technology

In this paper, a fault-tolerant-based online critic learning algorithm is developed to solve the optimal tracking control issue for nonaffine nonlinear systems with actuator ***, a novel augmented plant is constructed by fusing the system state and the reference trajectory, which aims to transform the optimal fault-tolerant tracking control design with actuator faults into the optimal regulation problem of the conventional nonlinear error system. Subsequently, in order to ensure the normal execution of the online learning algorithm, a stability criterion condition is created to obtain an initial admissible tracking policy. Then, the constructed model neural network(NN) is pretrained to recognize the system dynamics and calculate trajectory control. The critic and action NNs are constructed to output the approximate cost function and approximate tracking control,respectively. The Hamilton-Jacobi-Bellman equation of the error system is solved online through the action-critic framework. In theoretical analysis, it is proved that all concerned signals are uniformly ultimately bounded according to the Lyapunov *** tracking control law can approach the optimal tracking control within a finite approximation error. Finally, two experimental examples are conducted to indicate the effectiveness and superiority of the developed fault-tolerant tracking control scheme.

关键词：

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Uncertainty-optimized deep learning model for small-scale person re-identification

引用

science China(Information sciences) 2019年第12期62卷 20-32页

作者： Cairong ZHAO Kang CHEN Di ZANG Zhaoxiang ZHANG Wangmeng ZUO Duoqian MIAO Department of computer science and Technology Tongji University institute of Automation Chinese Academy of Sciences School of computer science and Technology Harbin Institute of Technology

In recent years, deep learning has developed rapidly and is widely used in various fields, such as computer vision, speech recognition, and natural language processing. For end-to-end person re-identification,most deep learning methods rely on large-scale datasets. Relatively few methods work with small-scale datasets. Insufficient training samples will affect neural network accuracy significantly. This problem limits the practical application of person re-identification. For small-scale person re-identification, the uncertainty of person representation and the overfitting problem associated with deep learning remain to be *** the uncertainty is difficult owing to complex network structures and the large number of hyperparameters. In this study, we consider the uncertainty of pedestrian representation for small-scale person re-identification. To reduce the impact of uncertain person representations, we transform parameters into distributions and conduct multiple sampling by using multilevel dropout in a testing process. We design an improved Monte Carlo strategy that considers both the average distance and shortest distance for matching and ranking. When compared with state-of-the-art methods, the proposed method significantly improve accuracy on two small-scale person re-identification datasets and is robust on four large-scale datasets.

关键词： person re-identification uncertainty analysis deep learning

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Reusing Service Process Fragments with a Consensus Between Service Providers and Users

引用

Chinese Journal of Electronics 2016年第4期25卷 648-657页

作者： YANG Rong LI Bing WANG Jian LI Zengyang HU Yan College of computer science and Technology Hubei University of Science and Technology International School of Software Wuhan University State Key Laboratory of Software Engineering & School of computer Wuhan University science and Technology on Integrated Information system Laboratory Institute of SoftwareUniversity of Chinese Academy of Sciences

Recent years have witnessed a rapid growth in using Web services for data publishing and sharing among *** improve the efficiency of software development and economize on human and material resources,service reuse is viewed as a powerful means which will not only reuse atomic services,but also reuse arbitrary granularities of Service process fragments(SPFs).However,effectively reusing arbitrary granularities of SPFs has not been solved yet,let alone taking diverse Qo S preferences of service providers and users into *** this paper,we propose a novel method of SPF reuse,named SCKY,based on the Cocke-Kasami-Younger(CKY) *** first present an extended CKY to do *** we address how to do SPF-query by a probability CKY,i.e.,return a SPF with maximum emergence ***,we explore the SPF-query with a consensus of Qo S preferences between service providers and *** a set of experiments,the effectiveness and robustness of our approach are evaluated.

关键词： Cocke-Kasami-Younger algorithm Service reuse Service process fragment Qo S preferences

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

High throughput VLSI architecture for H.264/AVC context-based adaptive binary arithmetic coding(CABAC) decoding

引用

Journal of Zhejiang University-science C(computers and Electronics) 2013年第6期14卷 449-463页

作者： Kai HUANG De MA Rong-jie YAN Hai-tong GE Xiao-lang YAN institute of VLSI Design Zhejiang University State Key Laboratory of computer science Institute of SoftwareChinese Academy of Sciences Hangzhou C-Sky Micro-system Company

Context-based adaptive binary arithmetic coding(CABAC) is the major entropy-coding algorithm employed in H.264/*** this paper,we present a new VLSI architecture design for an H.264/AVC CABAC decoder,which optimizes both decode decision and decode bypass engines for high throughput,and improves context model allocation for efficient external memory *** on the fact that the most possible symbol(MPS) branch is much simpler than the least possible symbol(LPS) branch,a newly organized decode decision engine consisting of two serially concatenated MPS branches and one LPS branch is proposed to achieve better parallelism at lower timing path cost.A look-ahead context index(ctxIdx) calculation mechanism is designed to provide the context model for the second MPS branch.A head-zero detector is proposed to improve the performance of the decode bypass engine according to UEGk encoding *** addition,to lower the frequency of memory access,we reorganize the context models in external memory and use three circular buffers to cache the context models,neighboring information,and bit stream,respectively.A pre-fetching mechanism with a prediction scheme is adopted to load the corresponding content to a circular buffer to hide external memory *** results show that our design can operate at 250 MHz with a 20.71k gate count in SMIC18 silicon technology,and that it achieves an average data decoding rate of 1.5 bins/cycle.

关键词： H.264/AVC Context-based adaptive binary arithmetic coding(CABAC) Decoder VLSI

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：