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

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yi Tian Guangping Xu Hongzhang Yang Yue Ni JiaXin Cao Lei Yang School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Roycom (Tianjin) Information Technology Co. Ltd.

Regenerating codes are new network codes proposed to reduce the data required for fault repair, which can improve the recovery efficiency of faulty nodes in data storage systems. However, unlike Reed-Solomon code, which repairs at the granularity of bytes, regenerating codes require data stored in large chunks but leads to severe read amplification, which reads out excess data when degraded read objects and increases degraded read time. That reflects a mutual constraint between improving recovery efficiency and degraded read performance, as manifested in the amplification of data reads, a vital issue considered in this *** solve this problem, we propose a new type of data layout — discrete geometric, which splits the object into a series of geometric sequences of data blocks. They are placed discretely into corresponding containers on the disks at different nodes, with containers of the same size made into a strip for encoding. The discrete characteristic ensures lower repair costs for degraded reads. The geometric characteristic ensures the repair performance of regenerating codes by large blocks, and read amplification can be mitigated through small blocks. To reduce IOPS for discrete geometric, we propose Discrete Geometric-Locally Regenerating Codes (DG-LRCs), guaranteeing lower degraded read latency while improving recovery *** results show that the degraded read time of DG-LRCs compared to regenerating codes combined with geometric partitioning is 22.56% lower at 2Gbpsand 60.56% lower at 4Gbps, and the recovery performance is 7.04 times better than that of RS code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Distractibility Induced trust Management Using BlockChain for Edge Computing

Towards Distractibility Induced trust Management Using Block...

引用

International Conference on Image, Vision and Intelligent systems, ICIVIS 2021

作者： Yang, Haochen Wang, Guanghui Dong, Lifeng He, Xin School of Software Henan University Kaifeng China Henan Provincial Engineering Research Center of Intelligent Data Processing Kaifeng China Henan International Joint Laboratory of Intelligent Network Theory and Key Technology Henan University Kaifeng China Institute of Intelligent Network System Henan University Kaifeng China Henan Jiuyu Tenglong Information Engineering Co. Ltd. Zhengzhou China

ISBN: (纸本)9789811669620

Edge computing solves massive data processing problems by utilizing the storage and computing functions of edge devices. Due to the openness of edge computing, distracted devices inevitably participate in edge computing and affect the network computing performance, which degrades trust management of edge devices. To solve the above issue, this paper proposes a trust management framework based on blockchain for edge computing scenarios (ECTMF). First, the ECTMF framework slices users and provides corresponding services based on different requirements. It evaluates the trustworthiness of end devices and distinguishes distracted devices in edge computing. Then, the Proof of Monitor (PoM) consensus mechanism is proposed to continuously monitor distracted end devices in edge computing. Simulations validate the effectiveness and efficiency of the ECTMF and PoM. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Distributionally Robust Optimization for Computation Offloading in Aerial Access Networks

Distributionally Robust Optimization for Computation Offload...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Guanwang Jiang Ziye Jia Lijun He Chao Dong Qihui Wu Zhu Han Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China School of Software Northwestern Polytechnical University Xi’an China Department of Electrical and Computer Engineering University of Houston Houston TX USA

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

With the rapid increment of multiple users for data offloading and computation, it is challenging to guarantee the quality of service (QoS) in remote areas. To deal with the challenge, it is promising to combine aerial access networks (AANs) with multi-access edge computing (MEC) equipments to provide computation services with high QoS. However, as for uncertain data sizes of tasks, it is intractable to optimize the offloading decisions and the aerial resources. Hence, in this paper, we consider the AAN to provide MEC services for uncertain tasks. Specifically, we construct the uncertainty sets based on historical data to characterize the possible probability distribution of the uncertain tasks. Then, based on the constructed uncertainty sets, we formulate a distributionally robust optimization problem to minimize the system delay. Next, we relax the problem and reformulate it into a linear programming problem. Accordingly, we design a MEC-based distributionally robust latency optimization algorithm. Finally, simulation results reveal that the proposed algorithm achieves a superior balance between reducing system latency and minimizing energy consumption, as compared to other benchmark mechanisms in the existing literature.

关键词： Measurement Uncertainty Multi-access edge computing Simulation Quality of service Linear programming Probability distribution Robustness Delays Optimization

来源：评论

学校读者我要写书评

暂无评论

Linear building pattern recognition via spatial knowledge graph

arXiv

引用

arXiv 2023年

作者： Wei, Zhiwei Xiao, Yi Tong, Ying Xu, Wenjia Wang, Yang Key Laboratory of Network Information System Technology Institute of Electronic Chinese Academy of Sciences Beijing 100830 The Aerospace Information Research Institute Chinese Academic of Sciences Beijing 100830 School of Resources and Environment Science Wuhan University Wuhan 430079 School of Software Engineering Shenzhen Institute of Information Technology Guangdong Shenzhen 518172 School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing 100876

Building patterns are important urban structures that reflect the effect of the urban material and social-economic on a region. Previous researches are mostly based on the graph isomorphism method and use rules to recognize building patterns, which are not efficient. The knowledge graph uses the graph to model the relationship between entities, and specific subgraph patterns can be efficiently obtained by using relevant reasoning tools. Thus, we try to apply the knowledge graph to recognize linear building patterns. First, we use the property graph to express the spatial relations in proximity, similar and linear arrangement between buildings;secondly, the rules of linear pattern recognition are expressed as the rules of knowledge graph reasoning;finally, the linear building patterns are recognized by using the rule-based reasoning in the built knowledge graph. The experimental results on a dataset containing 1289 buildings show that the method in this paper can achieve the same precision and recall as the existing methods;meanwhile, the recognition efficiency is improved by 5.98 times. © 2023, CC BY.

关键词： Buildings

来源：评论

学校读者我要写书评

暂无评论

Global Spatial-Temporal information-based Residual ConvLSTM for Video Space-Time Super-Resolution

引用

IEEE Transactions on Multimedia 2025年

作者： Fu, Congrui Yuan, Hui Jiang, Shiqi Zhang, Guanghui Shen, Liquan Hamzaoui, Raouf Center of Experimental Teaching China Shandong University School of Control Science and Engineering China Ministry of Education Key Laboratory of Machine Intelligence and System Control China Shandong University School of software Shandong Jinan China Shandong University School of Computer Science and Technology China Shanghai University School of Communication and Information Engineering Shanghai China De Montfort University School of Engineering and Sustainable Development LeicesterLE1 9BH United Kingdom

By converting low-frame-rate, low-resolution videos into high-frame-rate, high-resolution ones, space-time video super-resolution techniques can enhance visual experiences and facilitate more efficient information dissemination. We propose a convolutional neural network (CNN) for space-time video super-resolution, namely GIRNet. Our method combines long-term global information and short-term local information from the video to better extract complete and accurate spatial-temporal information. To generate highly accurate features and thus improve performance, the proposed network integrates a feature-level temporal interpolation module with deformable convolutions and a global spatial-temporal information-based residual convolutional long short-term memory (convLSTM) module. In the feature-level temporal interpolation module, we leverage deformable convolution, which adapts to deformations and scale variations of objects across different scene locations. This provides a more efficient solution than conventional convolution for extracting features from moving objects. Our network effectively uses forward and backward feature information to determine inter-frame offsets, leading to the direct generation of interpolated frame features. In the global spatial-temporal information-based residual convLSTM module, the first convLSTM is used to derive global spatial-temporal information from the input features, and the second convLSTM uses the previously computed global spatial-temporal information feature as its initial cell state. This second convLSTM adopts residual connections to preserve spatial information, thereby enhancing the output features. Experiments on the Vimeo90K dataset show that the proposed method outperforms open source state-of-the-art techniques in peak signal-to-noise-ratio (by 1.45 dB, 1.14 dB, and 0.2 dB over STARnet, TMNet, and 3DAttGAN, respectively), structural similarity index(by 0.027, 0.023, and 0.006 over STARnet, TMNet, and 3DAttGAN, respectiv

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Securely Fine-tuning Pre-trained Encoders Against Adversarial Examples

arXiv

引用

arXiv 2024年

作者： Zhou, Ziqi Li, Minghui Liu, Wei Hu, Shengshan Zhang, Yechao Wan, Wei Xue, Lulu Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab. China Cluster and Grid Computing Lab. China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

With the evolution of self-supervised learning, the pre-training paradigm has emerged as a predominant solution within the deep learning landscape. Model providers furnish pre-trained encoders designed to function as versatile feature extractors, enabling downstream users to harness the benefits of expansive models with minimal effort through fine-tuning. Nevertheless, recent works have exposed a vulnerability in pre-trained encoders, highlighting their susceptibility to downstream-agnostic adversarial examples (DAEs) meticulously crafted by attackers. The lingering question pertains to the feasibility of fortifying the robustness of downstream models against DAEs, particularly in scenarios where the pre-trained encoders are publicly accessible to the attackers. In this paper, we initially delve into existing defensive mechanisms against adversarial examples within the pre-training paradigm. Our findings reveal that the failure of current defenses stems from the domain shift between pre-training data and downstream tasks, as well as the sensitivity of encoder parameters. In response to these challenges, we propose Genetic Evolution-Nurtured Adversarial Fine-tuning (Gen-AF), a two-stage adversarial fine-tuning approach aimed at enhancing the robustness of downstream models. Gen-AF employs a genetic-directed dual-track adversarial fine-tuning strategy in its first stage to effectively inherit the pre-trained encoder. This involves optimizing the pre-trained encoder and classifier separately while incorporating genetic regularization to preserve the model’s topology. In the second stage, Gen-AF assesses the robust sensitivity of each layer and creates a dictionary, based on which the top-k robust redundant layers are selected with the remaining layers held fixed. Upon this foundation, we conduct evolutionary adaptability fine-tuning to further enhance the model’s generalizability. Our extensive experiments, conducted across ten self-supervised training methods and six

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Context-aware Bug Reproduction for Mobile Apps

Context-aware Bug Reproduction for Mobile Apps

引用

International Conference on software engineering (ICSE)

作者： Yuchao Huang Junjie Wang Zhe Liu Song Wang Chunyang Chen Mingyang Li Qing Wang Science and Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Intelligent Game Beijing China University of Chinese Academy of Sciences Beijing China Electrical Engineering and Computer Science York University Canada Monash University Melbourne Australia

Bug reports are vital for software maintenance that allow the developers being informed of the problems encountered in the software. Before bug fixing, developers need to reproduce the bugs which is an extremely time-consuming and tedious task, and it is highly expected to automate this process. However, it is challenging to do so considering the imprecise or incomplete natural language described in reproducing steps, and the missing or ambiguous single source of information in GUI components. In this paper, we propose a context-aware bug reproduction approach ScopeDroid which automatically reproduces crashes from textual bug reports for mobile apps. It first constructs a state transition graph (STG) and extracts the contextual information of components. We then design a multi-modal neural matching network to derive the fuzzy matching matrix between all candidate GUI events and reproducing steps. With the STG and matching information, it plans the exploration path for reproducing the bug, and enriches the initial STG iteratively. We evaluate the approach on 102 bug reports from 69 popular Android apps, and it successfully reproduces 63.7% of the crashes, outper-forming the state-of-the-art baselines by 32.6% and 38.3%. We also evaluate the usefulness and robustness of ScopeDroid with promising results. Furthermore, to train the neural matching network, we develop a heuristic-based automated training data generation method, which can potentially motivate and facilitate other activities as user interface operations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Dynamic Broadcasting for Multi-Hop Wireless Networks Under Time-Varying Connectivity and Dynamic SINR

引用

IEEE Transactions on Mobile Computing 2025年

作者： Tian, Xiang Yu, Jiguo Luo, Chuanwen Yu, Dongxiao Wang, Guijuan Feng, Bin Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Beijing Forestry University School of Information Science and Technology Beijing100083 China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Taishan University School of Information Science and Technology 271000 China

Throughput-optimal dynamic broadcasting is an essential cornerstone for the efficient operation of Multi-hop Wireless Networks (MWNs). Most existing algorithms for this problem were developed assuming static interference environments and network connectivity. However, wireless interference environments and network connectivity are inherently time-varying in real-world scenarios, primarily due to uncontrollable interference sources and unreliable links. Such time-varying characteristics make these existing algorithms less robust. In this paper, we study the robust throughput-optimal dynamic broadcasting for MWNs with multi-dimensional time-varying characteristics in terms of interference environments, network connectivity, and data arrival. We model the time-varying link existence states using a random process and characterize the time-varying interference environments through a dynamic variant of the classical Signal-to-Interference-plus-Noise-Ratio (SINR) model. In this variant, the SINR model parameters are dynamically adjusted over time by an adversary. Based on this, we first design a Robust Throughput-optimal Dynamic Broadcast (RTDB) algorithm which makes efficient slot-based max-weight link scheduling, power allocation, and data forwarding decisions in each time slot. We then prove its throughput-optimality in time-varying acyclic directed MWNs under the dynamic SINR model. The effectiveness of RTDB is validated via numerous simulations. © 2002-2012 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Att-TCN: An Advertising Attribution Method Based on Temporal Convolutional Network with Attention Mechanism

Att-TCN: An Advertising Attribution Method Based on Temporal...

引用

International Conference on Computer and Communications (ICCC)

作者： Bowen Xie Yi Sun Zhaowen Lin Baoquan Ma School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China National Engineering Laboratory for Mobile Network Technologies Beijing China National Computer System Engineering Research Institute of China Beijing China National Engineering Laboratory for Industry Control System Information Security Technology Beijing China

Advertising attribution is an effective method to measure the effect of various advertisements in the era of Internet advertising. It enables scientific tracking back and refined operation of advertising by quantitatively evaluating the contribution of different advertising channels to reach the target. It is challenging to predict conversion results based on users' journey data accurately, reflect the impact of ads on user conversions, and appropriately assign attribution values to advertising channels. To achieve the above objectives, we propose an advertising attribution method based on a temporal convolutional network with an attention mechanism (Att-TCN). By mining the hidden information in time and attribution channels using the attention mechanism, our proposed method can improve the accuracy of conversion prediction and thus more rationally assign attribution values across channels. Experimental validation on a real dataset obtained from an operational commercial advertising monitoring company shows that our proposed attribution method has better accuracy than other state-of-the-art attribution methods and gives an open-ended approach to attribution value assignment.

关键词： Target tracking Costs Companies Predictive models Internet Convolutional neural networks Data mining

来源：评论

学校读者我要写书评

暂无评论

Look Inside for More: Internal Spatial Modality Perception for 3D Anomaly Detection

arXiv

引用

arXiv 2024年

作者： Liang, Hanzhe Xie, Guoyang Hou, Chengbin Wang, Bingshu Gao, Can Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Audencia Financial Technology Institute Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Intelligent Manufacturing CATL Ningde China School of Computing and Artificial Intelligence Fuyao University of Science and Technology Fuzhou China School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

3D anomaly detection has recently become a significant focus in computer vision. Several advanced methods have achieved satisfying anomaly detection performance. However, they typically concentrate on the external structure of 3D samples and struggle to leverage the internal information embedded within samples. Inspired by the basic intuition of why not look inside for more, we introduce a straightforward method named Internal Spatial Modality Perception (ISMP) to explore the feature representation from internal views fully. Specifically, our proposed ISMP consists of a critical perception module, Spatial Insight Engine (SIE), which abstracts complex internal information of point clouds into essential global features. Besides, to better align structural information with point data, we propose an enhanced key point feature extraction module for amplifying spatial structure feature representation. Simultaneously, a novel feature filtering module is incorporated to reduce noise and redundant features for further aligning precise spatial structure. Extensive experiments validate the effectiveness of our proposed method, achieving object-level and pixel-level AUROC improvements of 4.2% and 13.1%, respectively, on the Real3D-AD benchmarks. Note that the strong generalization ability of SIE has been theoretically proven and is verified in both classification and segmentation tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：