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

ASRNet: Adversarial Segmentation and Registration Networks for Multispectral Fundus Images

computer Systems Science & Engineering 2021年第3期36卷 537-549页

作者： Yanyun Jiang Yuanjie Zheng Xiaodan Sui Wanzhen Jiao Yunlong He Weikuan Jia School of Information Science and Engineering Shandong Normal UniversityJinan250358China Key Laboratory of Intelligent Computing&Information Security in Universities of Shandong Shandong Provincial Key Laboratory for Novel Distributed Computer Software TechnologyInstitute of Biomedical SciencesShandong Normal UniversityJinan250358China Shandong Provincial Hospital Affiliated to Shandong University Jinan250021China INSA Lyon University of LyonCNRSInsermVilleurbanne69621CedexFrance

Multispectral imaging (MSI) technique is often used to capture imagesof the fundus by illuminating it with different wavelengths of light. However,these images are taken at different points in time such that eyeball movementscan cause misalignment between consecutive images. The multispectral imagesequence reveals important information in the form of retinal and choroidal bloodvessel maps, which can help ophthalmologists to analyze the morphology of theseblood vessels in detail. This in turn can lead to a high diagnostic accuracy of several diseases. In this paper, we propose a novel semi-supervised end-to-end deeplearning framework called “Adversarial Segmentation and Registration Nets”(ASRNet) for the simultaneous estimation of the blood vessel segmentation andthe registration of multispectral images via an adversarial learning process. ASRNet consists of two subnetworks: (i) A segmentation module S that fulfills theblood vessel segmentation task, and (ii) A registration module R that estimatesthe spatial correspondence of an image pair. Based on the segmention-drivenregistration network, we train the segmentation network using a semi-supervisedadversarial learning strategy. Our experimental results show that the proposedASRNet can achieve state-of-the-art accuracy in segmentation and registrationtasks performed with real MSI datasets.

关键词： Deep learning deformable image registration image segmentation multispectral imaging(MSI)

来源：评论

学校读者我要写书评

暂无评论

SWRR:The Link Scheduling Algorithm Based on Weighted Round-Robin

引用

computers, Materials & Continua 2019年第6期59卷 965-982页

作者： Tianbo Lu Ru Yan Chao Li Lihua Yin Hao Chen Xieyu Zou School of Software Engineering Beijing University of Posts and TelecommunicationsBeijing100876China Key Laboratory of Trustworthy Distributed Computing and Service(Beijing University of Posts and Telecommunications) Ministry of EducationBeijing100876China Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou510006China Department Computer Science and Engineering The University of Texas at ArlingtonArlington76091USA

With the rapid development of the Internet,people pay more and more attention to the protection of *** second-generation onion routing system Tor is the most commonly used among anonymous communication systems,which can be used to protect user privacy *** recent years,Tor’s congestion problem has become the focus of attention,and it can affect Tor’s performance even user ***,we investigate the causes of Tor network congestion and summarize some link scheduling algorithms proposed in recent *** we propose the link scheduling algorithm SWRR based on WRR(Weighted Round Robin).In this process,we design multiple weight functions and compare the performance of these weight functions under different congestion conditions,and the appropriate weight function is selected to be used in our algorithms based on the experiment ***,we also compare the performance of SWRR with other link scheduling algorithms under different congestion conditions by experiments,and verify the effectiveness of the algorithm SWRR.

关键词： Weighted Round-Robin Tor congestion control link scheduling anonymous communication

来源：评论

学校读者我要写书评

暂无评论

LMR-CBT: learning modality-fused representations with CB-Transformer for multimodal emotion recognition from unaligned multimodal sequences

引用

Frontiers of computer Science 2024年第4期18卷 39-47页

作者： Ziwang FU Feng LIU Qing XU Xiangling FU Jiayin QI School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing 100876China Key Laboratory of Trustworthy Distributed Computing and Service(BUPT) Beijing 100876China Shanghai International School of Chief Technology Officer East China Normal UniversityShanghai 200062China School of Computer Science and Technology East China Normal UniversityShanghai 200062China School of Cyberspace Security Guangzhou UniversityGuangdong 510006China

Learning modality-fused representations and processing unaligned multimodal sequences are meaningful and challenging in multimodal emotion *** approaches use directional pairwise attention or a message hub to fuse language,visual,and audio ***,these fusion methods are often quadratic in complexity with respect to the modal sequence length,bring redundant information and are not *** this paper,we propose an efficient neural network to learn modality-fused representations with CB-Transformer(LMR-CBT)for multimodal emotion recognition from unaligned multi-modal ***,we first perform feature extraction for the three modalities respectively to obtain the local structure of the ***,we design an innovative asymmetric transformer with cross-modal blocks(CB-Transformer)that enables complementary learning of different modalities,mainly divided into local temporal learning,cross-modal feature fusion and global self-attention *** addition,we splice the fused features with the original features to classify the emotions of the ***,we conduct word-aligned and unaligned experiments on three challenging datasets,IEMOCAP,CMU-MOSI,and *** experimental results show the superiority and efficiency of our proposed method in both *** with the mainstream methods,our approach reaches the state-of-the-art with a minimum number of parameters.

关键词： modality-fused representations cross-model blocks multimodal emotion recognition unaligned multimodal sequences computational affection

来源：评论

学校读者我要写书评

暂无评论

TeeSwap: Private Data Exchange using Smart Contract and Trusted Execution Environment 23

TeeSwap: Private Data Exchange using Smart Contract and Trus...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Chen, Peng Shi, Peichang Xu, Jie Fu, Xiang Li, Linhui Zhong, Tao Xiang, Liangliang Kong, Jinzhu College of Computer National University of Defense Technology National Key Laboratory of Parallel and Distributed Processing Changsha410073 China Zhejiang Lab Hangzhou311100 China Kylin Software Co. Ltd Changsha410073 China

ISBN: (纸本)9781665494571

With importance of data value is approved, data-sharing will create more and greater value has become consensus. However, data exchange has to use a trusted third party(TTP) as an intermediary in an untrusted network environment, which may lead to leakage of data privacy. In this paper, we design a system named TeeSwap, which uses smart contract to complete data exchange, and at the same time uses cryptographic algorithms and trusted execution environment (TEE) to ensure privacy in process of data transmission, verification and contract execution. Meanwhile, TeeSwap can ensure the credibility, fairness, integrity and privacy while data are shared in our system. In the end, we implement contracts about data market and data exchange. When confirming the data transaction, data market contract can automatically generate and deploy exchange contract, which can complete the data exchange authoritatively. © 2021 IEEE.

关键词： Data privacy Smart contracts Data communication Cryptography

来源：评论

学校读者我要写书评

暂无评论

RBCP: A Reputation-based Blockchain Consensus Protocol for Internet of Things 24

RBCP: A Reputation-based Blockchain Consensus Protocol for I...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Shang, Jiaze Lu, Tianbo Cai, Yingjie Luo, Shuang Jin, Zhaoxin School of Computer Science National Pilot Software Enginerring School Beijing University of Posts and Telecommunications Beijing China Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing China

ISBN: (纸本)9798350319934

The application of blockchain in the Internet of Things (IoT) solves the problem of centralization, enables data interaction of IoT nodes in untrusted environments. However, most of the blockchain consensus protocols are computationally expensive and poorly scalable, which cannot meet the current demand for low power consumption and low latency of IoT devices. Meanwhile, IoT nodes suffer from many malicious attacks. An effective reputation evaluation scheme is valuable for establishing a trusted, secure IoT environment with certain applications. In this paper, we propose RBCP, a novel reputation-based blockchain consensus protocol, and apply it to the IoT. The protocol divides IoT nodes into multiple regions, and consensus nodes in each region are selected based on real-time updated reputation values, which are used to participate in light PoW consensus and finally propose blocks. Then, we model the deposits and profits of the nodes as Stackelberg game and analyze the relationship between them. To evaluate our proposed protocol, we compare it with existing consensus protocols through several experiments. Our experimental results show that RBCP has advantages in terms of TPS, consensus time, and communication consumption, proving that it has low latency and less consensus time under the premise of sufficient security. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Graph Convolutional Network with Long Time Memory for Skeleton-based Action Recognition 26

Graph Convolutional Network with Long Time Memory for Skelet...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Qi, Yanpeng Pang, Chen Liu, Yiliang Liu, Hong Lyu, Lei Shandong Normal University School of Information Science and Engineering Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China Shandong Provincial Academy of Education Recruitment and Examination Jinan China

ISBN: (纸本)9798350331684

Skeleton-based action recognition task has been widely studied in recent years. Currently, the most popular researches use graph convolutional network (GCN) to solve this task by modeling human joints data as spatio-temporal graph. However, a large number of long-term temporal motion relationships cannot be effectively captured by GCN. Thus, recurrent neural network (RNN) is introduced to solve this defect. In this work, we propose a model namely graph convolutional network with long time memory (GCN-LTM). Specifically, there are two task streams in our proposed model: GCN stream and RNN stream, respectively. The GCN stream aims to capture the spatial motion relationships as well as the RNN stream focuses on extracting the long-term temporal patterns. In addition, we introduce the contrastive learning strategy to better facilitate feature learning between these two streams. The multiple ablation experiments have verified the feasibility of our proposed model. Numerous experiments show that the proposed model is superior to the current state-of-the-art method under two large-scale datasets including NTU-RGBD and NTU-RGBD-120. © 2023 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

An RBF neural network–based dynamic virtual network embedding algorithm

An RBF neural network–based dynamic virtual network embeddi...

引用

作者： Zheng, Xiangwei Zhang, Yuang Zhang, Hui Xue, Qingshui School of Information Science and Engineering Shandong Normal University Jinan250014 China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan250014 China School of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai201418 China

Network virtualization is a promising technology, which is used to solve the existing shortcomings of the Internet architecture and in which virtual network (VN) embedding plays a vital role in resource allocation. However, current virtual network embedding algorithms mainly deal with static VN embedding;the allocations of network resources are constant and excessive in the VN requests' lifetime. In reality, the user's resource requirements usually change with time;hence, static VN embedding algorithms can lead to low utilization of substrate resources and reduction of the operators' revenues. To solve the aforementioned problem, we focus on the virtual network embedding considering dynamic demands in this paper. We apply supervised radial basis function (RBF) neural network to predict the changes of virtual requests and dynamically reallocate substrate resources by adjusting already allocated resources. Simulation experiments show that compared with the static algorithms, dynamic VN embedding schemes with supervised RBF can more accurately predict the demand changes of virtual networks, which adaptively adjusts resources allocation and management and therefore improves resource utilization of substrate networks. © 2018 John Wiley & Sons, Ltd.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

An adaptive video watermarking algorithm

An adaptive video watermarking algorithm

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Yang, Feng Tan, Kai School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan 250014 China School of Information Science and Engineering Shandong Normal University Jinan 250014 China

ISBN: (纸本)9781467321068

An adaptive data hiding method is proposed that encapsulates forbidden zone data hiding in order to improve the robustness of watermark under the premise of ensuring the subjective quality of host video and the invisibility of watermark. The algorithm based on human visual masking characteristics calculates each block's variance and energy and then selects the range of forbidden zone and the embedding strength according to two above values. This method is tested with H.264/AVC compression and strong common signal processing attacks, such as Gaussian filtering, to compare with the original algorithm. The simulation results indicate that the proposed method is more robust against attacks such as noise and compression and can be successfully utilized in video data hiding applications. © 2012 IEEE.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Prolonging Time Synchronized Mesh Protocol network's lifetime by adjusting transmission range and routing graph

Prolonging Time Synchronized Mesh Protocol network's lifetim...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Yao Zhen Hui-chuan Duan Lin Qi School of Information Science and Engineering Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University Jinan China School of Information Science and Engineering Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China School of Information Science and Engineering Shandong Normal University Provincial Key Laboratory for Novel Distributed Computer Software Technology. Jinan China

The Time Synchronized Mesh Protocol (TSMP) uses time synchronization, graph-routing and pre-scheduling of pair-wise communication while cycling through all available pre-divided channels to manage the whole network. With the collision-free network we study the energy-hole problem and discuss how to fix or improve this problem with mathematical analyses. When knowing where the reason lies, we propose an algorithm which can enable the nodes to choose their transmission range and next hop relay in order to adjust energy consumption of nodes in different position of the network. With this ability nodes that have less energy can reduce their work, so do the nodes in the region nearer the sink, thus the lifetime of the network can be prolonged. At last we evaluate this algorithm by means of the NS2 stimulation tools, and the simulation result shows that we finally get a network with relatively longer lifetime.

关键词： Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Parallel computing for large-scale author name disambiguation in medline 21

Parallel computing for large-scale author name disambiguatio...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：