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

A MPPT algorithm based on membrane system for photovoltaic systems under partially shaded conditions

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3878-3886页

作者： He, Juanjuan Fu, Jiao Liu, Jun Xiao, Jianhua School of Computer Science Wuhan University of Science and Technology Wuhan430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430081 China Department of Computer Science Xiamen University Xiamen Fujian361005 China

The algorithm based on membrane system, also called membrane-inspired algorithm, has been shown to be powerful for solving combinatorial optimization problems, and it is increasingly used in practical engineering. With integrating membrane structures, evolution rules and computational mechanisms of membrane systems, membrane-inspired algorithms perform well in searching the global optimum. However, this technique can be computationally expensive because of complicated rules and communication mechanism, so that most of membrane-inspired algorithms solved problems off-line. In this work, we propose a novel membrane-inspired algorithm for tracking the global point (GP) online. The ring structure with memory mechanism is adopted to maintain diversity and the convergence that is speeded up by the fast making rules. We verify our method by solving four benchmark functions, and a numerical example of tracking the GP of photovoltaic (PV) system. The experimental results show that our methodology performs well on these four benchmark functions compared with the genetic algorithm and quantum-inspired algorithm. In practice, our method quickly tracks the GP of a PV system. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

A continuous stream service and high service availability mechanism for continuous media servers

A continuous stream service and high service availability me...

引用

6th International Conference on Advanced Communication Technology: Broadband Convergence Network Infrastructure

作者： Jung, Sung-In Lee, Cheol-Hoon Computer System Division Electron./Telecom. Res. Institute Daejon Korea Republic of Parallel Processing Laboratory Department of Computer Engineering Chungnam National University Daejon Korea Republic of

ISBN: (纸本)8955191197

Due to the explosive growth of the Internet, stream services are becoming more popular. The large media servers supporting thousands of concurrent media streams have to satisfy us with both good throughout and high availability. Although they are reciprocal from the viewpoint of system performance, the stream service continuity, as well as throughput, should be considered in clustered media servers. This is because media stream services should be continuously available to the clients even on the event of system failure. In this paper, we introduce service availability as the gauge of service degree on media servers, and present the basic scheme for guaranteeing continuous stream service. To do this, we propose LSS(Log Stream Status) and RRD(Ready Resource for instant Delivery) mechanisms. They are classified according to the status management method of stream service and the resumption method of closed service. Although these mechanisms require additional overhead, we found that they can be applied to clustered media servers with minimum overhead. Additionally, we concluded that they can provide higher quality of service availability on traditional clustered media servers.

关键词： Servers

来源：评论

学校读者我要写书评

暂无评论

An irregular cutting based distributed mapping algorithm for DVE systems

An irregular cutting based distributed mapping algorithm for...

引用

2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun Xi, Min National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Department of Computer Science Xi'an Jiaotong University Xi'an 710049 China

ISBN: (纸本)9781424446070

Distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users. ©2009 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A new approach of conditions on δ2s(Φ) for s-sparse recovery

引用

science China(Information sciences) 2014年第4期57卷 107-113页

作者： CEN YiGang ZHAO RuiZhen MIAO ZhenJiang CEN LiHui CUI LiHong School of Computer & Information Technology Beijing Jiaotong University School of Information Science and Engineering Central South University Key Laboratory of System Control and Information Processing Ministry of Education Department of Mathematics Beijing University of Chemical Technology

In this paper,we provide a unified expression to obtain the conditions on the restricted isometry constantδ2s(Φ).These conditions cover the important results proposed by Candes et *** each of them is a sufficient condition for sparse signal *** the noiseless case,whenδ2s(Φ)satisfies any one of these conditions,the s-sparse signal can be exactly recovered via(l1)constrained minimization.

关键词： concentration of mutilated vector in kerΦ s-largest mutilated vector restricted isometry constant δ2s(Φ) exact recovery of s-sparse signals via(l1) maximum value of single variable function

来源：评论

学校读者我要写书评

暂无评论

An improved lookahead instruction prefetching

An improved lookahead instruction prefetching

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： Gi-Ho Park Oh-Young Kwon Tack-Don Han Shin-Dug Kim Sung-Bong Yang Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

A new lookahead instruction prefetching mechanism is proposed in this paper. Though significant performance improvement can be obtained by improving both the cache miss ratio and average access time for successfully prefetched blocks, most conventional prefetching mechanisms improve only one out of the two factors. To achieve balanced improvement of the two factors, a lookahead prefetching scheme that fetches multiple blocks for a prefetch request and adopts prefetch on miss mechanism is proposed. Performance evaluation is carried out through the trace-driven simulation and the proposed prefetch scheme reduces 32%/spl sim/56% of the memory access delay time of the cache system that does not perform any prefetching.

关键词： Prefetching Delay effects parallel processing Laboratories computer science Performance evaluation Cache memory History Performance analysis Boolean functions

来源：评论

学校读者我要写书评

暂无评论

An effective full-map directory scheme for the sectored caches

An effective full-map directory scheme for the sectored cach...

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： Won-Kee Hong Tack-Don Han Shin-Dug Kim Sung-Bong Yang Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

In multiprocessor systems, the cache misses due to coherence transactions make up many of the total cache misses. However this type of cache miss is strongly dependent on the type of data sharing among processors, especially false sharing. Until now the small cache block size has been used to avoid false sharing mainly in multiprocessor systems, but the smaller the cache block size, the lower the prefetching effect. Moreover it is shown that high spatial locality appears in many parallel programs. The paper presents two advanced full-map directory schemes which provide a low cache miss ratio and communication traffic by avoiding false sharing and taking advantage of the spatial locality existing in many parallel programs. The performance was evaluated by the event-driven simulator and the empirical results show that the proposed scheme can provide about a 6/spl sim/77% decrease in the cache miss ratio and a 46/spl sim/96% decrease in the communication traffic.

关键词： Multiprocessing systems Prefetching parallel processing Laboratories computer science Discrete event simulation Delay Access protocols Memory management Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Memory based processor array for artificial neural networks

Memory based processor array for artificial neural networks

引用

International Conference on Neural Networks

作者： Youngsik Kim Mi-Jung Noh Tack-Don Han Shin-Dug Kim Sung-Bong Yang Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780341228

In this paper an effective memory-processor integrated architecture, called memory based processor array for artificial neural networks (MPAA), is proposed. The MPAA can be easily integrated into any host system via memory interface. Specifically, the MPAA system provides an efficient mechanism for its local memory accesses allowed by the row basis and the column basis using the hybrid row and column decoding, which is suitable for the computation model of ANNs such as the accessing and alignment patterns given for matrix-by-vector operations. Mapping algorithms to implement the multilayer perceptron with backpropagation learning on the MPAA system are also provided. The proposed algorithms support both neuron and layer level parallelisms which allow the MPAA system to operate the learning phase as well as the recall phase in the pipelined fashion. Performance evaluation is provided by detailed comparison in terms of two metrics such as the cost and the number of computation steps.

关键词： Artificial neural networks computer architecture parallel processing Backpropagation algorithms Neurons Decoding Computational modeling Memory architecture Bandwidth Read-write memory

来源：评论

学校读者我要写书评

暂无评论

A selective compressed memory system by on-line data decompressing

A selective compressed memory system by on-line data decompr...

引用

EUROMICRO Conference

作者： Jang-Soo Lee Won-Kee Hong Shin-Dug Kim Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

The article proposes a selective compressed memory system (SCMS) focusing on a compressed cache architecture, in which only data blocks with good compression efficiency are compressed selectively and all compressed blocks are stored in a fixed memory space. The selective compression technique can reduce decompression overhead caused by online data decompression and also the fixed memory space allocation allows efficient management of the compressed blocks. The results from a trace driven simulation show that the SCMS approach can provide around a 35% decrease in the on-chip cache miss ratio as well as a 53% decrease in the data traffic over conventional memory systems. Furthermore, a large amount of the decompression overhead can be reduced, and thus the average memory access time can also be reduced by a maximum 20% against conventional memory systems.

关键词： Cache memory Bandwidth parallel processing Laboratories computer science Memory management Hip Delay Process design Bridges

来源：评论

学校读者我要写书评

暂无评论

Nonparametric statistics inspired similarity measure for accuracy in collaborative filtering

引用

Journal of Computational Information systems 2013年第20期9卷 8397-8406页

作者： Liu, Shichen Xiong, Yan Liu, Qingwen Qi, Xiang Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Institute of Electronics Chinese Academy of Sciences Beijing 100190 China

Similarity computation is especially significant in collaborative filtering algorithms. In the existed literatures or large recommender systems, researchers generally use cosine similarity or Pearson correlation coefficient to compute the similarities. However, on one hand, both two measures are more applicable in linear space while the ratings cannot linearly reflect users' interest intensity. On the other hand, different systems have different rating restricts, so it's unreasonable to treat varied systems with the same computation method. In this work, inspired by nonparametric statistics, a sound memory-based method with a novel similarity measure is proposed to eliminate the affection of rating distributions and system diversities on similarity computation. Experiments based on Jester are set to evaluate the performance of the approach. And the highly competitive results show that our approach is able to significantly improve the recommendation quality. © 2013 Binary Information Press.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of a selective compressed memory system

Design and evaluation of a selective compressed memory syste...

引用

IEEE International Conference on computer Design: VLSI in computers and Processors, (ICCD)

作者： Jang-Soo Lee Won-Kee Hong Shin-Dug Kim Department of Computer Science Parallel Processing System Laboratory Yonsei University Seoul South Korea

This research explores any potential for an on-chip cache compression which can reduce not only cache miss ratio but also miss penalty, if main memory is also managed in compressed form. However, the decompression time causes a critical effect on the memory access time and variable-sized compressed blocks tend to increase the design complexity of the compressed cache architecture. This paper suggests several techniques to reduce the decompression overhead and to manage the compressed blocks efficiently which include selective compression, fixed space allocation for the compressed blocks, parallel decompression, the use of a decompression buffer, and so on. Moreover a simple compressed cache architecture based on the above techniques and its management method are proposed. The results from trace-driven simulation show that this approach can provide around 35% decrease in the on-chip cache miss ratio as well as a 53% decrease in the data traffic over the conventional memory systems. Also, a large amount of the decompression overhead can be reduced, and thus the average memory access time can also be reduced by maximum 20% against the conventional memory systems.

关键词： Memory management Delay Hip Bandwidth parallel processing Laboratories computer science Ores Read only memory Process design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：