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

3rd IEEE International Conference on Frontiers Technology of Information and computer, ICFTIC 2021

作者： Zhang, Bin Sun, Yuxia Chen, Zhao Luo, Liang Xu, Yingmei Jinan University Guangdong Provincial Key Laboratory of High-Performance Computing Department of Computer Science Guangzhou China Jinan University Department of Computer Science Guangzhou China Guangdong Science Technology Infrastructure Center Guangdong Provincial Key Laboratory of High-Performance Computing Guangzhou China

ISBN: (纸本)9781665406055

Contrastive learning is a new self-supervised representation learning technique, which is considered to have great potential to improve the performance of downstream learning tasks. Recently, some researchers have conducted experiments on some datasets and found that contrastive learning based on adversarial examples can improve the performance of some image classification tasks. However, does contrastive learning with adversarial examples really benefit the performance of various downstream tasks? At present, there is still a lack of in-depth research on this issue. In this paper, we introduce a contrastive learning method with adversarial examples based on different adversarial perturbations intensities, and establish a variety of downstream image classification tasks. Experiments on different types of downstream tasks show that contrastive learning based on adversarial examples may not improve the performance of downstream tasks. We also find that the adversarial perturbation intensity and the proportion of the adversarial perturbation loss in contrastive loss are important factors affecting the above performance. © 2021 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

A study of code reuse and sharing characteristics of Java applications 1

A study of code reuse and sharing characteristics of Java ap...

引用

1st Workshop on Workload Characterization, WWC 1998

作者： Conte, M.T. Trick, A.R. Gyllenhaal, J.C. Hwu, W.W. Department of Electrical and Computer Engineering Coordinated Science Laboratory Center for Reliable and High-performance Computing University of Illinois at Urbana-Champaign United States

ISBN: (纸本)0769504507

Presents a detailed characterization of Java application and applet workloads in terms of reuse and sharing of Java code at the program, class and method level. In order to expose more sharing opportunities, techniques for detecting code equivalence even in the presence of minor code changes or constant pool index differences) are also proposed and examined. The analyzed application workload consists of the recently released SPECjvm98 benchmarks, and the applet workload is derived from three extensive searches of the Internet between May 1997 and May 1998 using an enhanced Web crawler. Analysis of these workloads reveals several new code sharing and optimization opportunities. © 1998 IEEE.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

How can network coding help P2P content distribution?

How can network coding help P2P content distribution?

引用

2009 IEEE International Conference on Communications, ICC 2009

作者： Ma, Guanjun Xu, Yinlong Kaiqian, Ou Wen, Luo Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424434350

It is well known that network coding can enhance the performance of Peer-to-Peer (P2P) content distribution systems since it benefits block scheduling. In this paper, we introduce our P2P content distribution system "SmartCode" with sparse network coding on PlanetLab. SmartCode uses pre-checking to avoid linearly dependent blocks being transmitted. Under the same system architecture, we also implement two systems "Ecode" and "LRF". Ecode is also based on sparse network coding, but without pre-checking. LRF is BitTorrent-like, using local-rarest-first for block scheduling. We conduct extensive experiments to compare the performances among the three systems. Experimental results show that the distributing time of SmartCode is reduced by 11% on average and up to 19% compared with LRF, and by 7% on average and up to 16% compared with Ecode. We also conduct experiments to analyze robustness among the three systems under the assumption that peers join in and leave a content distribution session dynamically and the seed leave the session after it has transmitted a fixed percentage of blocks over the total blocks of the content. In dynamical cases, SmartCode outperforms evidently than Ecode and LRF in downloading time and the times of peers completing the downloading. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Dasher: A peer-to-peer content distribution system based on combined network coding

Dasher: A peer-to-peer content distribution system based on ...

引用

2009 2nd IEEE International Conference on Broadband Network and Multimedia Technology, IEEE IC-BNMT2009

作者： Kaiqian, Ou Yinlong, Xu Guanjun, Ma Yulin, Zhu Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424450053

Network coding can ease the block scheduling and thus makes the distribution more efficient. However, the complexities of encoding and decoding increase sharply as the content size scales up. In this paper, we propose a coding scheme which combines chunked coding and sparse linear network coding to reduce both encoding and decoding costs of content distribution. Based on the combined scheme, we implement a P2P content distribution system, named Dasher, where Local-Rarest-First scheme is adopted for chunk scheduling. Under the same system architecture, we implement three comparative systems, a BitTorrent-like system, named Mybt, a system only with sparse coding, named Sparser and a system using chunked coding, named Chunker. We conduct extensive experiments to compare the performance among these four systems. The experimental results show that Dasher with certain chunk sizes can reduce the average downloading time up to 15% compared with Mybt, and up to 43% with Chunker. With proper chunk sizes, the downloading time of Dasher is almost the same with Sparser. The average decoding rate of Dasher is the same with Chunker, and is nearly m times as fast as Sparser, where m is the number of chunks. Moreover, with respect to robustness, Dasher performs almost as well as Chunker, better than Mybt, but worse than Sparser. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Lexicographically fair bandwidth allocation in multi-session layered media multicast using network coding

Lexicographically fair bandwidth allocation in multi-session...

引用

2009 2nd IEEE International Conference on Broadband Network and Multimedia Technology, IEEE IC-BNMT2009

作者： Xiaobin, Lin Yinlong, Xu Yulin, Zhu Kaiqian, Ou Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424450053

Layering techniques effectively cope with network heterogeneity encountered in media distribution. Recent work on network coding shows that the multicast throughput can be greatly improved by allowing coding operation at the intermediate nodes in the network. In this paper, we study the problem of lexicographically fair bandwidth allocation to make the receivers of different sessions share network bandwidth fairly in multi-session layered media multicast using network coding and formulate it into an integer linear programming (ILP). Because the ILP is not time efficient when the network is large, a LP-based polynomial time algorithm ApprOpt is proposed to approximate the optimal solution of the ILP. Numerical results show that the throughput of all media multicast sessions is significantly improved by network coding, and that algorithm ApprOpt allocates network bandwidth very close to the optimal solution of the ILP and utilizes network bandwidth efficiently. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Validity checking on grid service composition

Validity checking on grid service composition

引用

31st Annual International computer Software and Applications Conference, COMPSAC 2007

作者： Zhou, Jing Zeng, Guosun Department of Computer Science and Technology Tongji University Shanghai 201804 China Tongji Branch National Engineering and Technology Center of High Performance Computer

ISBN: (纸本)9780769528700

Grid service is composed of elementary services and the execution procedure is characterized by dynamical evolvement and exceptional no-determinism. The existing service description language, BPEL4WS (abbreviated to BPEL), only provides static service description, which cannot guarantee the correct composition of elementary services and dynamically monitor the occurrence of the exceptional events. According to the problems mentioned above, a verification approach to check the validity of the behavior partial order sequence of a grid service is proposed in this paper, which converts the grid service script based on BPEL into the behavior sequence described in Cπ-calculus automatically, and extracts the partial order constraint rules on the behavior of elementary services in a grid service, based on which to check the reachability of elementary services and validity of the behavior sequence during the execution of a grid service. A validity check algorithm is proposed finally. © 2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Using unified parallel C to parallelize the FDTD method of computational electrodynamics

Using unified parallel C to parallelize the FDTD method of c...

引用

2009 IEEE 13th International Multitopic Conference, INMIC 2009

作者： Hussain, A. Shafi, A. Raza, J. Center for High Performance Scientific Computing Department of Computing NUST School of Electrical Engineering and Computer Science Pakistan

ISBN: (纸本)9781424448722

This paper discusses a parallel implementation of the Finite-Difference Time-Domain (FDTD) method using Unified Parallel C (UPC). UPC is an extension of ANSI C - primarily designed for programming distributed memory parallel hardware. The FDTD method is a powerful and widely used numerical technique in computational electromagnetics community. It is a resource - CPU cycles and memory - hungry technique. Consequently, a parallel implementation is highly desirable to decrease time-to-solution and be able to study larger problems with limited resources. To the best of our knowledge, this is the first attempt to exploit UPC to parallelize the FDTD method. We evaluate the performance of our implementation on a cluster of four SunFire v890 compute nodes-each equipped with 16 processing cores - and report impressive speedups. ©2009 IEEE.

关键词： Finite difference time domain method

来源：评论

学校读者我要写书评

暂无评论

performance evaluation of container-based high performance computing ecosystem using OpenPOWER 32nd

Performance evaluation of container-based high performance c...

引用

32nd International Conference on high performance Computing, ISC high performance 2017

作者： Kuity, Animesh Peddoju, Sateesh Kumar High Performance Computing Lab Department of Computer Science and Engineering Indian Institute of Technology Roorkee247667 India

ISBN: (纸本)9783319676296

Container-based high performance Computing (HPC) has started gaining popularity due to its almost negligible performance penalty compared to the BareMetal hardware. Although HPC hardware architectures and programming models are continuously evolving, the platform models are suffering from the HPC community’s awareness. Power-awareness, hardware and application-aware co-design along with security related concerns have attracted the most in recent time to empower the platform models. Otherside, the OpenPOWER ecosystems have stepped into our life to fulfill the thirst of exploiting the last drop of a performance benefit from our invested system. It has Power8 compliant processor with a larger cache, big fat instructions and data path accompanied by the popular coherent accelerator. In this paper, we have proposed a container-based HPC ecosystem established using OpenPOWER machine. The performance of the designed and developed ecosystem is evaluated stressing on different subcomponents of the system such as processor, memory, IO, and interconnect. Finally, the results are compared with the performance of the equivalent environments made of virtual machines and BareMetal hardware. © Springer International Publishing AG 2017.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Using spatial correlations in distributed video coding

Using spatial correlations in distributed video coding

引用

International Symposium on Artificial Intelligence and Signal Processing

作者： Fathy, Mahmood Haqqani, Mohammad High Performance Computing Lab. Computer Engineering Department Iran University of Science and Technology Tehran Iran

ISBN: (纸本)9781424498345

Distributed video coding (DVC) is a new paradigm of coding that makes very interest to itself in the past decade. It's usually based on temporal correlations between successive frames which are called key frames. But this approach failed for high object motion in a scene and need very complex decoder to cover it. In this paper we propose a novel technique to use spatial correlation instead of temporal correlation in a frame by dividing a single frame to two sub frames which one of them is used as a key frame for generate side information at the decoder. Simulation results show a significant improvement on rate distortion parameter in DVC schema. © 2011 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

SemTrust: A Semantic Reputation System in P2P-Based Semantic Web

引用

Wuhan University Journal of Natural sciences 2006年第5期11卷 1137-1140页

作者： WANG Wei ZENG Guosun YUAN Lulai Department of Computer Science and Technology Tongii University Shanghai 201804 China Tongji Branch National Engineering and TechnologyCenter of High Performance Computer Shanghai 201804China

A reputation mechanism is introduced in P2P- based Semantic Web to solve the problem of lacking trust. It enables Semantic Web to utilize reputation information based on semantic similarity of peers in the network. This approach is evaluated in a simulation of a content sharing system and the experiments show that the system with reputation mechanism outperforms the system without it.

关键词： semantic Web reputation system semantic similarity trustworthiness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：