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

IEEE International Conference on Networking, Architecture and Storage

作者： Yin, Wenxuan Gao, Xiang Zhu, Xiaojing Guo, Deyuan Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Loongson Technology Corporation Limited Beijing China Institute of Microelectronics Tsinghua University Beijing China

ISBN: (纸本)9780769545097

With the prevalence of multi-core processors, it is a trend that the embedded cluster deploys SMP nodes to gain more computing power. As a crucial issue, the MPI interprocess communication has been suffering the contradiction between high performance and embedded constraints. Moreover, there is a big performance gap between intra- and inter-node communication for different infrastructures. In this paper, we design a virtual communication system called SMVN, which extends the shared memory mechanism typically used in intra-node case into the inter-node case. The SMVN utilizes the HT inter-chip interconnect interface in Godson-3A SMP nodes to build a mesh topology. It is Ethernet compatible by simulating bottom layers of TCP/IP protocol. With the design, the node interconnection can get rid of NICs, cables and switches. Furthermore, we exploit the zero-copy scheme and other optimizations to improve the performance. We port the MPICH2 library by socket channel and formulate its process allocation. The MPI latency and bandwidth tests show that the performance difference between two levels is small. The inter-node bandwidth is 27.3MB/s, which is more than twice the theoretical peak value of 100Mb Ethernet and reaches 84% of the intra-node performance. © 2011 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A Kind of new parallax algorithm based on symmetric continuous optimization 5

A Kind of new parallax algorithm based on symmetric continuo...

引用

2020 5th International Seminar on computer technology, Mechanical and Electrical Engineering, ISCME 2020

作者： Jiang, Kaiwen Zhang, Degan Xu, Haixia Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised classification method of SAR images using spectral clustering in contourlet domain 4

Semi-supervised classification method of SAR images using sp...

引用

2019 4th International Seminar on computer technology, Mechanical and Electrical Engineering, ISCME 2019

A new based on Semi-supervised classification theory for SAR images in contourlet domain is proposed, in this paper. Attempting to get better and faster performance, the PSO algorithm (Particle swarm optimization algorithm) and contourlet domain is proposed to instead of traditional k-means algorithm. PSO is used to find the global optimum by performing a global search in the whole solution space. And then, contourlet is applied in front of construct the similarity matrix to extract more effective eigenvalues. In section five, the proposed algorithm got better classification results than the traditional k-means algorithm which is proved by experimental results show that in terms of running time, classification accuracy and Kappa coefficient. © Published under licence by IOP Publishing Ltd.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer Science & technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

cco-exist with other services on a VM-based virtualized computing platform?

cco-exist with other services on a VM-based virtualized comp...

引用

2007 Asian technology Information Program's (ATIP's) 3rd Workshop on High Performance computing in China - Solution Approaches to Impediments for High Performance computing, CHINA HPC'07

作者： Song, Ying Wang, Hui Li, Yaqiong Sun, Yuzhong Zeng, Yu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China National Research Center for Intelligent Computing Systems ICT Beijing 100080 China Graduate University of Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9781595939036

Trend towards providing heterogeneous services concurrently by ISPs and low utilization of servers make it necessary to consolidate various services computing into a single platform. In such a shared environment, meeting application-level QoS goals and avoiding interaction among services become challenges as each application consumes different amount of resource and requires different QoS. Video-on-demand (VoD) has been identified as an important application among multimedia services. In this paper, we study a case of interaction among services concurrently running on a virtualized computing environment. The contributions of this paper are follows. 1) We design a novel capability service computing framework for service computing consolidation (CSCF) to study the interaction among concurrent services in a VM-Based Virtualized computing Environment;2) A dynamic and lazy memory flowing algorithm (DLMFaVM) among VMs is proposed to partially fulfill this computing model by resource flowing;3) We also develop a virtualized computing platform to study the possibility of service computing consolidation;4) We analyze the interaction among VoD service and other typical enterprise services in our capability service computing environment and draw a conclusion that the VoD streaming service co-existing with other services on a VM-based virtualized computing platform is a trend for ISPs. But it presents some challenges for the designers of service soft and the designers of service computing platform. Copyright 2007 ACM.

关键词： Video on demand

来源：评论

学校读者我要写书评

暂无评论

An ultrasound system for tumor detection in soft tissues using low transient pulse

An ultrasound system for tumor detection in soft tissues usi...

引用

2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011

作者： Ratnakar, Ashish R. Zhou, MengChu Dept. of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102-1982 United States MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China

ISBN: (纸本)9781457717307

This work presents a method to detect the size and location of tumor in soft tissues using ultrasound. Quantitative ultrasound is utilized to allow an ultrasound signal to be sent from a transmitter to multiple receivers. This received signal is analyzed for echogenic and echolucent tumors to differentiate between the two along with non-tumor sample and also studied for the delay to determine the size/location of the tumor. The proposed system utilizes Low Transient Pulse (LTP) technique and is implemented using Field Programmable Gate Array (FPGA) and Digital Signal Processor (DSP) technologies. In this co-design architecture, DSP carries out the analysis of received demodulated signal at a lower speed while FPGA runs at a higher one to generate LTP signal and demodulate bandpass ultrasonic signal. This work elaborates the implementation of Quadrature Amplitude Modulation (QAM) receiver on FPGA for the received signal from an ultrasound detector. LTP is applied to the tumor samples through the transmitter and the received signal at an ultrasonic receiver is passed through QAM to obtain different maxima that are then further used to compute the location and the size of the tumor using DSP. This dual platform co-design demonstrates a good application of a FPGA/DSP platform for the LTP generation and received signal processing. © 2011 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing Parallel Kinetic Monte Carlo Simulation by Communication Aggregation and Scheduling

Optimizing Parallel Kinetic Monte Carlo Simulation by Commun...

引用

2015大数据技术及应用论坛

作者： Baodong Wu Shigang Li Yunquan Zhang State Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences

Kinetic Monte Carlo(KMC) algorithm has been widely applied for simulation of radiation damage, grain growth and chemical reactions. To simulate at a large temporal and spatial scale, domain decomposition is commonly used to parallelize the KMC algorithm. However, through experimental analysis, we find that the communication overhead is the main bottleneck which affects the overall performance and limits the scalability of parallel KMC algorithm on large-scale clusters. To alleviate the above problems, we present a communication aggrega‐tion approach to reduce the total number of messages and eliminate the commu‐nication redundancy, and further utilize neighborhood collective operations to optimize the communication scheduling. Experimental results show that the opti‐mized KMC algorithm exhibits better performance and scalability compared with the well-known open-source library—SPPARKS. On 32-node Xeon E5-2680 cluster(total 640 cores), the optimized algorithm reduces the total execution time by 16 %, reduces the communication time by 50 % on average, and achieves 24 times speedup over the single node(20 cores) execution.

关键词： Domain decomposition Communication aggregation Communication scheduling Neighborhood collectives

来源：评论

学校读者我要写书评

暂无评论

Simplified Multi-Ported Cache in High Performance Processor

Simplified Multi-Ported Cache in High Performance Processor

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Hao Zhang Dongrui Fan Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China

The memory bandwidth demands of modern microprocessors require the use of a multi-ported cache to achieve peak performance. However, multi- ported caches are costly to implement. In this paper we propose technique for using a simplified dual-ported cache instead, which is mostly composed of single- ported SRAMs, without decreasing the performance of the processor apparently. We evaluate this technique using realistic applications that include the operating system. Our technique using a simplified multi-ported banking cache, reduces the delay of select logic in LSQ by 16.1%, and achieves 98.1% of the performance of an ideal dual-ported cache.

关键词： Microprocessors Costs Delay Bandwidth Banking Clocks Laboratories High performance computing computer architecture Operating systems

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Floating Point Stack on General RISC Architecture

Design and Implementation of Floating Point Stack on General...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Xuehai Qian He Huang Hao Zhang Guoping Long Junchao Zhang Dongrui Fan Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China

This paper presents a framework for implementing the X86 FP stack used in an x86-compliant processor based on a general RISC architecture. Architectural supports are added to a typical RISC architecture to maintain the FP stack status. Some speculative techniques are applied to the decode stage to enable pipelined and efficient FP operations. An optimized register renaming scheme is proposed to eliminate redundant micro-ops in FP programs, resulting in an increased performance while mitigating the burden on register rename table. The simulation results show that on average more than 10% fmov micro-ops are removed. Elimination of micro-ops significantly speeds up the execution of programs. The IPC increases are as high as 30% for some programs, and near 10% on average

关键词： Reduced instruction set computing Registers computer architecture Decoding Helium Laboratories Design methodology Prototypes Analytical models Performance analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：