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

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Xiaojing Jiang, Xuesong Yi, Fengge Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance. © 2023 IEEE.

关键词： knowledge graph knowledge graph completion multimodal fusion

来源：评论

学校读者我要写书评

暂无评论

Designer topological flat bands in one-dimensional armchair graphene antidot lattices

引用

Physical Review B 2024年第11期110卷 115138页

作者： Jianing Wang Weiwei Chen Zhengya Wang Jie Meng Ruoting Yin Miaogen Chen Shijing Tan Chuanxu Ma Qunxiang Li Bing Wang Hefei National Research Center for Physical Sciences at the Microscale Synergetic Innovation Center of Quantum Information & Quantum Physics and New Cornerstone Science Laboratory Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province College of Sciences Hefei National Laboratory

We report a viable strategy to realize topological flat bands in one-dimensional armchair graphene antidot lattices. The quantum destructive interference effect leads to largely quenched intra-antidot hopping with nearly zero values, creating flat bands with a nontrivial topology, as unveiled by an effective Su-Schrieffer-Heeger model under extreme conditions. As a proof of concept, we demonstrate our approach in the on-surface synthesized porous seven-carbon-wide armchair graphene nanoribbons with periodic divacancy-type antidots, and showcase the robust flatness of the designer topological flat bands with a high tunability through strain and structural engineering which are investigated by combining tight-binding and density functional theory calculations with scanning probe microscopy measurements. We show that such available one-dimensional graphene nanoribbons can provide a rich platform for exploiting novel physics at the confluence of strong correlation and topology, opening up new avenues for research in the field of topological materials and their potential applications in quantum devices.

关键词： Electronic structure First-principles calculations Flat bands Symmetry protected topological states Topological materials Atomic force microscopy Density functional theory Scanning techniques Scanning tunneling microscopy Scanning tunneling spectroscopy Su-Schrieffer-Heeger model Tight-binding model

来源：评论

学校读者我要写书评

暂无评论

Simulating Bluetooth virus propagation on the real map via infectious attenuation algorithm and discrete dynamical system

引用

Iran Journal of Computer Science 2024年第4期7卷 755-776页

作者： Zhu, Qingyi Wan, Wentao Gan, Chengquan Fan, Ziqi Yang, Lu-Xing School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing 400065 China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing 400065 China School of Information Technology Deakin University Melbourne 3125 VIC Australia

In recent years, mobile smart devices have gained popularity globally due to their convenience and efficiency. However, this popularity has also attracted the attention of virus creators, resulting in a significant cost to users. Current research on virus propagation primarily focuses on developing anti-virus software and macroscopic modeling. Software development often lags behind and only begins when viruses become a significant threat. In contrast, macroscopic modeling frequently deviates from reality as real networks do not completely conform to the characteristics of scale-free or small-world networks. Furthermore, special factors such as device mobility and signal attenuation must be considered when studying Bluetooth-transmitted viruses. Traditional research methods have shown limited performance in this field. To address these issues, this paper proposes a method that describes the propagation behavior of Bluetooth viruses in smart devices by utilizing an Infectious Attenuation Algorithm (IAA) and real maps. This method incorporates population density, map contours, and user security awareness to construct a unique discrete system. More importantly, we integrate this system into the map of Deyuan Street in Chengdu City and create a visualization system using the Simulation of Urban Mobility (SUMO) simulation software. In this system, the proposed IAA simulates the decay of virus infectivity based on the distance between devices and the attenuation of signal power between them. Our research approach considers the two core elements of infectivity attenuation and maps, making it more realistic and overcoming the lag in software development. Additionally, the introduction of SUMO for visualization simulation enhances the practical significance of our experiments. Finally, we propose feasible prevention strategies based on comparative experiments, data analysis, and theoretical analysis. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2

关键词： Bluetooth virus Discrete dynamical system Infectious attenuation algorithm Population density Real map Security awareness SUMO simulation

来源：评论

学校读者我要写书评

暂无评论

Object detection algorithm based on cosine similarity IoU

Object detection algorithm based on cosine similarity IoU

引用

2022 International Conference on Networking and Network Applications, NaNA 2022

作者： Sugang, Ma Ningbo, Li Guansheng, Peng Yanping, Chen Ying, Wang Zhiqiang, Hou School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an China School of Computer Science and Technology Xidian University Shaanxi Xi'an China Xi'an University of Posts and Telecommunications Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

Aiming at the problem that the traditional IoU-NMS algorithm has poor filtering of redundant boxes with high confidence scores in RetinaNet, an object detection algorithm based on cosine similarity IoU is proposed. Based on the original IoU calculation method, the cosine similarity between the detection boxes is calculated by the vector to better evaluate the similarity between them, which removes redundant boxes with high confidence scores and retain more accurate detection boxes. Meanwhile, CBAM is added to the ResNet-50 network to extract richer semantic information. the detection accuracy of the PASCAL VOC dataset reaches 80.6%, which is 2.1% higher than the benchmark algorithm. © 2022 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Polyp Segmentation Neural Network with Simple Encoding Structure and Reverse Attention Module 13

Polyp Segmentation Neural Network with Simple Encoding Struc...

引用

13th International Conference on Information Technology in Medicine and Education, ITME 2023

作者： Wang, Jie Li, Zuoyong Xu, Haiping Cheng, Xuesong Teng, Shenghua College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou350121 China Fujian Key Laboratory of Medical Big Data Engineering Fujian Provincial Hospital Fuzhou350001 China College of Mathematics and Data Science Minjiang University Fuzhou350121 China

ISBN: (纸本)9798350319156

Colorectal cancer is a common malignancy. In colonoscopy images, computer-assisted polyp segmentation helps doctors diagnose and treat disorders more precisely. In recent years, some methods based on deep convolutional neural networks have made significant breakthroughs in this task. However, only a few algorithms explicitly consider the effect of light intensity on segmentation performance, which results in algorithms needing to be more robust for complex samples. This paper proposes a neural network combining a simple encoding structure with a reverse attention module. Specifically, the model uses HarDNet68 as the backbone network, adds a camouflage identification module (CIM) to enhance the capture of polyp details on the underlying features, and finally utilizes adaptive feature fusion with the reverse attention module (RAM). The proposed model effectively addresses the challenge of poor segmentation quality in colonoscopy images caused by inconsistent illumination. Extensive experiments on five datasets show that the proposed model performs well in polyp segmentation. © 2023 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance and QoS for Concurrent GPU B+trees by Combining-Based Synchronization 23

Boosting Performance and QoS for Concurrent GPU B+trees by C...

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Weihua Zhao, Chuanlei Peng, Lu Lin, Yuzhe Zhang, Fengzhe Lu, Yunping School of Computer Science Fudan University China Institute of Big Data Fudan University China State Key Laboratory of Mathematical Engineering and Advanced Computing China Parallel Processing Institute Fudan University China Department of Computer Science Tulane University United States

ISBN: (纸本)9798400700156

Concurrent B+trees have been widely used in many systems. With the scale of data requests increasing exponentially, the systems are facing tremendous performance pressure. GPU has shown its potential to accelerate concurrent B+trees performance. When many concurrent requests are processed, the conflicts should be detected and resolved. Prior methods guarantee the correctness of concurrent GPU B+trees through lock-based or software transactional memory (STM)-based approaches. However, these methods complicate the request processing logic, increase the number of memory accesses and bring execution path divergence. They lead to performance degradation and variance in response time increasing. Moreover, previous methods do not guarantee linearizability among concurrent requests. In this paper, we design a combined-based concurrency control framework, called Eirene, for GPU B+tree to reduce the overhead of conflict detection and resolution. First, a combining-based synchronization method is designed to combine and issue requests. It combines the requests with the same key, constructs their dependence, decides the issued request, and determines their return values. Since only one request for each key is issued, key conflicts are eliminated. Then, an optimistic STM method is used to reduce structure conflicts. The query and the update requests are partitioned into different kernels. For the update kernels, STM is involved only when the number of the retry reaches a threshold. Finally, a locality-aware warp reorganization optimization is proposed to improve memory behavior and reduce conflicts by exploiting the locality among requests. Evaluations on an NVIDIA A100 GPU show that Eirene is efficient (a throughput of 2.4 billion per second) and can guarantee linearizability. Compared to the state-of-the-art GPU B+tree, it can achieve a speedup of 7.43X and reduce the response time variance from 36% to 5%. © 2023 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for Efficient Gridless Line Spectrum Estimation With Applications in Tomographic SAR Imaging

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for...

引用

作者： Shi, Ruizhe Zhang, Zhe Qiu, Xiaolan Ding, Chibiao University of Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering Beijing100190 China Suzhou Aerospace Information Research Institute Suzhou Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou Jiangsu215123 China CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Beijing100190 China

This article presents a novel efficient method for gridless line spectrum estimation problems with single snapshot and sparse signals, namely the gradient descent least-squares (GDLS) method. Conventional single-snapshot (a.k.a. single-measure vector or SMV) line spectrum estimation methods either rely on smoothing techniques that sacrifice the range and/or azimuth resolution or adopt the sparsity constraint and utilize the compressed sensing (CS) method by defining prior grids and resulting in the off-grid problem. Recently emerged atomic norm minimization (ANM) methods achieved gridless SMV line spectrum estimation, but its computational complexity is extremely high;thus, it is practically infeasible in real applications with large problem scales. Our proposed GDLS method reformulates the line spectrum estimations problem into a least-squares (LSs) estimation problem and solves the corresponding objective function via a gradient descent algorithm in an iterative fashion with efficiency. The convergence guarantee, computational complexity, and performance analysis for evenly distributed antenna array cases are discussed in this article. Numerical simulations show that the proposed GDLS algorithm outperforms the state-of-the-art methods, for example, CS and ANM, in terms of estimation performances. It can completely avoid the off-grid problem, and its computational complexity is significantly lower than ANM. Our method has been tested in tomographic SAR (TomoSAR) imaging applications via simulated and real experimental data. Results show the great potential of the proposed method in terms of better cloud point performance and eliminating the gridding effect. © 1980-2012 IEEE.

关键词： Spectrum analysis

来源：评论

学校读者我要写书评

暂无评论

A Dual-Notch Ultra-Wideband Filter with High Selectivity and Miniaturization Based on Open Stubs

A Dual-Notch Ultra-Wideband Filter with High Selectivity and...

引用

International Conference on Microwave and Millimeter Wave Technology Proceedings

作者： Ya He Mingming Gao CongYing Wang Yan He ZhenZhi Yang WenXin Yang College of Electronics and Information Engineering Liaoning Technicial University Huludao Liaoning Province China Liaoning Key Laboratory of Radio Frequency and Big Data for Intelligent Applications

ISBN: (数字)9798350389968

ISBN: (纸本)9798350389975

This manuscript introduces the design of an ultra-wideband (UWB) microstrip line filter implemented through a novel multimode resonator comprising open-circuited stubs. The multimode resonator has three open-circuited stubs, two short lines, and a high-impedance microstrip line. The filter demonstrates a 3dB bandwidth ranging from 3.72 to 11.23 GHz, centered at 7.48 GHz. Asymmetric coupling techniques and split-ring resonators on both sides of the multimode resonator introduce notches at 8.62-8.73 GHz and 9.21-9.64 GHz. The UWB filter designed in this study exhibits a low insertion loss of merely 0.51 dB. The notches demonstrate remarkable attenuation, achieving 29.90 dB and 24.31 dB, respectively, highlighting superior notch suppression performance. Additionally, the filter's compact structure fulfills miniaturization requirements, possessing a size of only 0.61*0.20 $(\lambda_{g}*\lambda_{g})$ .

关键词： Couplings Microstrip filters Microwave technology Microstrip resonators Resonator filters Millimeter wave technology Resonant frequency

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Wang, Hongfei Wan, Caixue 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 Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China 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

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON THE REWARDS AND PUNISHMENTS OF URBAN SEWAGE TREATMENT UNDER THE UNCERTAINTY THEORY

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2024年第3期86卷 111-124页

作者： Ruixi, Yuan Lin, Zhang Li, Cun-Lin Masron, Tajul Ariffin Yang, Bao-Jun School of management North Minzu University Yinchuan750021 China Universiti Sains Malaysia Pinang 13500 Malaysia School of Mathematics and Information Science Guangzhou University Guangzhou510006 China School of Management The Key Laboratory of Intelligent Information and Big Data Processing of NingXia North Minzu University Yinchuan750021 China School of Management Universiti Sains Malaysia Pinang 13500 Malaysia School of Business Northinzu University Yinchuan750021 China

This paper fills a gap in urban sewage treatment decision-making by exploring reward and punishment mechanisms within the uncertainty theory framework. Addressing challenges in characterizing sewage treatment capacity due to incomplete information, the study integrates incentive and punishment mechanisms in a decision-making model. Results indicate that government rewards encourage companies to treat more sewage, but a nuanced relationship exists between rewards, treatment capacity, and expected returns. The study emphasizes the need for a balanced approach, suggesting a focus on technology enhancement over sole reliance on rewards. Examining a double-headed sewage market, the research establishes an uncertain Cournot game model, providing insights into sewage treatment dynamics under asymmetric information. In conclusion, the paper contributes to practical reward and punishment strategies in sewage treatment policies, offering theoretical support for effective decision-making in urban sewage management within a concise framework.. © 2024, Politechnica University of Bucharest. All rights reserved.

关键词： Sewage treatment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：