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

International Conference on Advanced Communication Technology (ICACT)

作者： Sung-In Jung Cheol-Hoon Lee Computer System Division Electronics and Telecommunications Research Institute Daejeon South Korea Parallel Processing Laboratory Department of Computer Engineering Chungnam National University Daejeon South Korea

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.

关键词： Availability Streaming media Web server Concurrent computing Telecommunication computing Quality of service Network servers Monitoring parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

A selective temporal and aggressive spatial cache system based on time interval

A selective temporal and aggressive spatial cache system bas...

引用

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

作者： Jung Hoon Lee Jang-Soo Lee Shin-Dug Kim Dept. of Comput. Sci. Yonsei Univ. Seoul South Korea Department of Computer Science Parallel Processing System Laboratory Yonsei University Seoul South Korea

This paper proposes a new cache system that can increase the effect by temporal and spatial locality by using only simple hardware control without any locality detection hardware or compiler aid. The proposed cache system consists of two caches with different associativities and different block sizes, i.e., a direct-mapped cache with small block size and a fully associative spatial buffer with large block size as a multiple of small blocks. Therefore, the spatial locality can be exploited by aggressively fetching large blocks including any missed small block into the buffer, and the temporal locality can also be exploited by selectively storing small blocks that were referenced at the spatial buffer in the past. To determine the blocks to be stored at the direct-mapped cache, the proposed cache system uses a time interval-based selection mechanism. According to the simulation results, similar performance can be achieved by using four times smaller cache size compared with the conventional direct-mapped cache.

关键词： Buffer storage Hardware parallel processing Laboratories computer science Control systems Computational modeling Cache memory Delay Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional euler PCA for face recognition 21

Two-dimensional euler PCA for face recognition

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Tan, Huibin Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation and Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Principal component analysis (PCA) projects data on the directions with maximal variances. Since PCA is quite effective in dimension reduction, it has been widely used in computer vision. However, conventional PCA suffers from following deficiencies: 1) it spends much computational costs to handle high-dimensional data, and 2) it cannot reveal the nonlinear relationship among different features of data. To overcome these deficiencies, this paper proposes an efficient two-dimensional Euler PCA (2D-ePCA) algorithm. Particularly, 2D-ePCA learns projection matrix on the 2D pixel matrix of each image without reshaping it into 1D long vector, and uncovers nonlinear relationships among features by mapping data onto complex representation. Since such 2D complex representation induces much smaller kernel matrix and principal subspaces, 2D-ePCA costs much less computational overheads than Euler PCA on large-scale dataset. Experimental results on popular face datasets show that 2D-ePCA outperforms the representative algorithms in terms of accuracy, computational overhead, and robustness. © Springer International Publishing Switzerland 2015.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Non-negative low-rank and group-sparse matrix factorization 21

Non-negative low-rank and group-sparse matrix factorization

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Wu, Shuyi Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Non-negative matrix factorization (NMF) has been a popular data analysis tool and has been widely applied in computer vision. However, conventional NMF methods cannot adaptively learn grouping structure froma *** paper proposes a non-negative low-rank and group-sparse matrix factorization (NLRGS) method to overcome this deficiency. Particularly, NLRGS captures the relationships among examples by constraining rank of the coefficients meanwhile identifies the grouping structure via group sparsity regularization. By both constraints, NLRGS boosts NMF in both classification and clustering. However, NLRGS is difficult to be optimized because it needs to deal with the low-rank constraint. To relax such hard constraint, we approximate the low-rank constraint with the nuclear norm and then develop an optimization algorithm for NLRGS in the frame of augmented Lagrangian method(ALM). Experimental results of both face recognition and clustering on four popular face datasets demonstrate the effectiveness of NLRGS in quantities. © Springer International Publishing Switzerland 2015.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： laser fusion neutron sources particle beam focusing ELECTROSTATIC CONFINEMENT FUSION DEVICE

来源：评论

学校读者我要写书评

暂无评论

An Irregular cutting based distributed mapping algorithm for DVE systems

An Irregular cutting based distributed mapping algorithm for...

引用

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

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

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.

关键词： Defense industry Virtual environment computer industry computer science Algorithm design and analysis Delay Partitioning algorithms Industrial training Computational intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

A high-performance computational resource broker for grid computing environments

A high-performance computational resource broker for grid co...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Po-Chi Shih Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the grid.

关键词： Grid computing Resource management Bandwidth Distributed computing Network servers Monitoring Information security Middleware Access protocols Java

来源：评论

学校读者我要写书评

暂无评论

Pyramid Pooling-based Local Profiles for Graph Classification

Pyramid Pooling-based Local Profiles for Graph Classificatio...

引用

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Wu, Chengpei Lou, Yang Li, Junli College of Computer Science Sichuan Normal University Chengdu610066 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China National Yang Ming Chiao Tung University Department of Computer Science Hsinchu300 Taiwan Graduate School of Information Science and Technology Osaka University Osaka565-0871 Japan

ISBN: (纸本)9798350337020

Many natural and engineering systems can be modeled and represented in the forms of graph data, and then studied using graph theory and network analysis tools. Graph representation learning aims at generating lower-dimensional representations from higher-dimensional graph data, which is a crucial step that facilitates the follow-up tasks, such as node and graph classifications. In this paper, we present a simple but effective graph representation learning method, namely the pyramid pooling-based local profile (PPLP), which enables local nodal profiles to be transformed into a graph representation, with multi-scale features extracted. PPLP can be either embedded into a graph neural network as the readout layer, or perform independently as a graph embedding algorithm. The resultant representations of PPLP are for graph-level tasks. PPLP is experimentally tested by performing graph classification tasks on ten representative datasets, either as the readout layer of different graph neural networks, or as an independent graph embedding algorithm. Experimental results demonstrate that: 1) when embedded into graph neural networks, PPLP outperforms the widely-used global pooling-based readout methods;2) as an independent graph embedding algorithm, PPLP performs fairly good, especially on the social network datasets. The investigation confirms PPLP as a simple but promising method for graph-level tasks. © 2023 IEEE.

关键词： graph classification graph neural network Graph representation learning pyramid pooling

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 Workshops 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302070

ISBN: (纸本)9783540235781

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation computer Communication Networks Operating systems Information systems Applications (incl. Internet) Information Storage and Retrieval User Interfaces and Human computer Interaction

来源：评论

学校读者我要写书评

暂无评论

Positional translation language model for ad-hoc information retrieval

Positional translation language model for ad-hoc information...

引用

18th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2014

作者： Tu, Xinhui Luo, Jing Li, Bo He, Tingting Gu, Jinguang College of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Department of Computer Science Central China Normal University Wuhan China State Key Lab. of Software Engineering Wuhan University Wuhan China

ISBN: (纸本)9783319066042

Most existing language modeling approaches are based on the term independence hypothesis. To go beyond this assumption, two main directions were investigated. The first one considers the use of the proximity features that capture the degree to which search terms appear close to each other in a document. Another one considers the use of semantic relationships between words. Previous studies have proven that these two types of information, including term proximity features and semantic relationships between words, are both useful to improve retrieval performance. Intuitionally, we can use them in combination to further improve retrieval performance. Based on this idea, this paper propose a positional translation language model to explicitly incorporate both of these two types of information under language modeling framework in a unified way. In the first step, we present a proximity-based method to estimate word-word translation probabilities. Then, we define a translation document model for each position of a document and use these document models to score the document. Experimental results on standard TREC collections show that the proposed model achieves significant improvements over the state-of-the-art models, including positional language model, and translation language models. © 2014 Springer International Publishing.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：