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

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jia, Yan Dou, Yong Qiao, Peng Cheng, Yuqing Xu, Kele He, Zhouyu National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology Changsha China National University of Defense Technology College of Systems Engineering Changsha China

ISBN: (纸本)9798350386226

Accurate and efficient airway segmentation is essential for evaluating pulmonary diseases, aiding diagnosis, reducing the preoperative burden of airway identification, and minimizing patient discomfort during prolonged surgeries. However, current pulmonary airway reconstruction techniques are hindered by two major challenges: difficulty in accurately reconstructing fine airway branches due to the tendency to overlook small targets, and insufficient structural connectivity leading to frequent branch discontinuities within the airway tree. These limitations directly affect the clinical applicability of reconstructed airways. To overcome these challenges, a novel 3D pulmonary airway segmentation multi-task framework is proposed, designed to enhance the performance of existing backbone models. This approach integrates Anatomical Prior-Based Multi-Task Learning (AP-MTL) through the use of Gaussian-constructed connectivity-enhanced isosurfaces, significantly improving the network's ability to maintain airway continuity. Additionally, a Class-Balanced CT Density Distribution Reconstruction mechanism (DDR-CB) is introduced, further refining the model's capability to detect and segment fine airway branches. As a result of these enhancements, the model demonstrates a 11.5% average improvement in segmentation accuracy and connectivity compared to the baseline. The source code is publicly accessible at https://***/inexhaustible419/APMTLAirwaySegment. © 2024 IEEE.

关键词： Pulmonary diseases

来源：评论

学校读者我要写书评

暂无评论

Ladder: A Blockchain Model of Low-Overhead Storage 3rd

Ladder: A Blockchain Model of Low-Overhead Storage

引用

3rd International Conference on Blockchain and Trustworthy Systems, Blocksys 2021

作者： Chen, Peng Zhang, Xunhui Liu, Hui Xiang, Liangliang Shi, Peichang National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811679926

Emerging blockchain accounting mechanism allow mutually distributed parties to transport trusted information and ensure the correctness of data. Every blockchain node stores the complete block locally. Although this measure improves security, it causes huge storage overhead. We present Ladder, a multi-level low-overhead storage model for blockchain, which can greatly reduce the storage overhead of nodes while ensuring that the blockchain cannot be tampered easily and the block information is complete. Ladder distinguishes the retrieved frequency and importance of different blocks by value-density, dividing them into Hot-Blocks, Warm-Blocks and Cold-Blocks adopting different storage strategies respectively. Through experimental verification of time and space cost of different storage strategies, Ladder can greatly reduce the local storage overhead of nodes. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Research of context situation awareness technology

Research of context situation awareness technology

引用

作者： Shi, Dianxi Wu, Zhendong Ding, Bo Yan, Huining National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546698

Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation to provide better services is a challenging issue. In this paper, we focused on this challenge on the basis of the mobile cloud computing architecture. An abstract model is proposed in this paper to uniformly collect the context and send them to cloud. A rule-based large-scale context aggregation algorithm is also proposed which utilizes the MapReduce computing paradigm. Finally, a large-scale context management framework based on the abstract model and the context aggregation algorithm is proposed, and a real-time traffic demo is implemented to verify the validity of the framework. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

HAF: a hybrid annotation framework based on expert knowledge and learning technique

引用

Science China(Information Sciences) 2022年第1期65卷 276-278页

作者： Zhixing LI Yue YU Tao WANG Gang YIN Xinjun MAO Huaimin WANG Key Laboratory of Parallel and Distributed Computing National University of Defense Technology College of Computer National University of Defense Technology

Dear editor,The increasing awareness of the potential value hidden in data has resulted in many data mining studies being conducted. In the domain of software engineering, for example, developers' behavioral data and code review data have been leveraged in social coding sites to automatically recommend relevant projects [1] and candidate reviewers [2, 3].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of processor arrays with local memories on FPGAs

Automatic synthesis of processor arrays with local memories ...

引用

2010 International Conference on Field-Programmable Technology, FPT'10

作者： Wu, Guiming Dou, Yong Wang, Miao National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Jiangnan Institute of Computing Technology Wuxi 214083 China

ISBN: (纸本)9781424489817

In this paper, we present an automatic synthesis framework to map loop nests to processor arrays with local memories on FPGAs. An affine transformation approach is firstly proposed to address space-time mapping problem. Then a data-driven architecture model is introduced to enable automatic generation of processor arrays by extracting this data-driven architecture model from transformed loop nests. Some techniques including memory allocation, communication generation and control generation are presented. Synthesizable RTL codes can be easily generated from the architecture model built by these techniques. A preliminary synthesis tool is implemented based on PLUTO, an automatic polyhedral source-to-source transformation and parallelization framework. © 2010 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

High performance and memory efficient implementation of matrix multiplication on FPGAs

High performance and memory efficient implementation of matr...

引用

2010 International Conference on Field-Programmable Technology, FPT'10

ISBN: (纸本)9781424489817

We present a high performance and memory efficient hardware implementation of matrix multiplication for dense matrices of any size on the FPGA devices. By applying a series of transformations and optimizations on the original serial algorithm, we can obtain an I/O and memory optimized block algorithm for matrix multiplication on FPGAs. A linear array of processing elements (PEs) is proposed to implement this block algorithm. We show significant reduction in hardware resources consuming compared to the related work while increasing clock frequency. Moreover, the memory requirement can be reduced to O(S) from O(S 2), where S is the block size. Therefore, more PEs can be integrated into the same FPGA devices. © 2010 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An interface theory based approach to verification of web services

An interface theory based approach to verification of web se...

引用

30th Annual International Computer Software and Applications Conference, COMPSAC 2006

作者： Zhenbang, Chen Ji, Wang Wei, Dong Zhichang, Qi Yeung, W.L. National Laboratory for Parallel and Distributed Processing Changsha China Department of Computing and Decision Sciences Lingnan University Hong Kong Hong Kong

ISBN: (纸本)0769526551

The verification of web services becomes a challenge in software verification. This paper presents a framework for verification of web service interfaces at various abstraction levels. Its foundation is the interface theory for web services, in which transaction features are incorporated. Within the framework, one may check non mutual invocation, compatibility and refinement of web services at signature, conversation and protocol levels. At protocol level, we present a model checking approach to verifying the protocol properties in Action Set Computation Tree Logic(ASCTL). The paper also discusses the integration of our framework into the web service development. © 2006 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Dynamic Substrate Network in Data Centre Networks

引用

China Communications 2013年第9期10卷 130-142页

作者：李小玲王怀民丁博李小勇刘惠 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.

关键词： resource allocation data centrenetwork workload substrate algorithm

来源：评论

学校读者我要写书评

暂无评论

BCE: A privacy-preserving common-friend estimation method for distributed online social networks without cryptography

BCE: A privacy-preserving common-friend estimation method fo...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed online social networks (DOSN) have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose BCE (Bloom Filter based Common-Friend Estimation), a scalable and privacy-preserving common-friend estimation scheme that estimates the set of common friends without the need of cryptography techniques. First, BCE denotes each user using the identifiers created by the Peer-to-Peer underlay that are robust against the dictionary attacks. Second, BCE uses a Bloom filter to represent a friend list for scalability. Third, BCE estimates common friends of two users using the intersection of Bloom filters computed by one of their common friends, which ensures the privacy of friend lists against unknown users. Our privacy analysis shows that BCE hides the privacy of each user with a high probability. Simulations over real-world social-network data sets confirms that BCE is both accurate and scalable. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

On the feasibility of common-friend measurements for the distributed online social networks

On the feasibility of common-friend measurements for the dis...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme that estimates the number of common-friends between any pair of users without disclosing the friends' information. FDist uses privacy-preserving common-friend measurements to collect a small number of common-friend samples, and uses low-dimensional coordinates to estimate the number of common friends to other users. Simulation results on real-world social networks confirm that FDist is both scalable and accurate. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：