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

IEEE International Symposium on Circuits and Systems

作者： Jinhu Lu Guanrong Chen Maciej J. Ogorzalek Ljiljana Trajkovic Acad. Math. Syst. Sci. Chinese Acad. Sci. Beijing P. R. China Sch. Electr. Comput. Eng. RMIT University Australia Dept. Electronic Engineering City University of Hong Kong Kowloon Hong Kong SAR P. R. China Dept. Information Technologies Jagiellonian University Krakow Poland School of Engineering Science Simon Fraser University Vancouver Canada

ISBN: (纸本)9781467357609

Over the last decade, complex networks have emerged to be a promising research field in the area of circuits and systems. This mini-review paper introduces the special session that deals with theory and applications of complex networks and provides brief review of their advances and challenges. The paper further promotes some important research topics in the field with emphasis on the multidisciplinary research interests.

关键词： last decade area field

来源：评论

学校读者我要写书评

暂无评论

Multi-layer Prefetching for Hybrid Storage Systems: Algorithms, Models, and Evaluations

Multi-layer Prefetching for Hybrid Storage Systems: Algorith...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Mais Nijim Ziliang Zong Xiao Qin Yousef Nijim Department of Electrical Engineering and Computer Science Texas A and M University Kingsville Kingsville TX USA Dept. of Math. & Comput. Sci. South Dakota Sch. of Mines & Technol. Rapid City SD USA Department of Computer Science and Software Engineering Aubum University Auburn AL USA IEEE Senior Member Cox Commun. Atlanta GA USA

Parallel storage systems have been highly scalable and widely used in support of data-intensive applications. In future systems with the nature of massive data processing and storing, hybrid storage systems opt for a solution to fulfill a variety of demands such as large storage capacity, high I/O performance and low cost. Hybrid storage systems (HSS) contain both high-end storage components (e.g. solid-state disks and hard disk drives) to guarantee performance, and low-end storage components (e.g. tapes) to reduce cost. In HSS, transferring data back and forth among solid-state disks (SSDs), hard disk drives (HDDs), and tapes plays a critical role in achieving high I/O performance. Prefetching is a promising solution to reduce the latency of data transferring in HSS. However, prefetching in the context of HSS is technically challenging due to an interesting dilemma: aggressive prefetching is required to efficiently reduce I/O latency, whereas overaggressive prefetching may waste I/O bandwidth by transferring useless data from HDDs to SSDs or from tapes to HDDs. To address this problem, we propose a multi-layer prefetching algorithm that can judiciously prefetch data from tapes to HDDs and from HDDs to SSDs. To evaluate our algorithm, we develop an analytical model and the experimental results reveal that our prefetching algorithm improves the performance in hybrid storage systems.

关键词： Prefetching Libraries Hard disks Bandwidth Switches Storage area networks Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Comparing and Optimising Parallel Haskell Implementations for Multicore Machines

Comparing and Optimising Parallel Haskell Implementations fo...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Jost Berthold Simon Marlow Kevin Hammond Abdallah Al Zain School of Mathematics and Computer Sciences Heriot-Watt University Edinburgh UK Philipps-Universität Marburg Germany Microsoft Research Limited Cambridge UK Microsoft Research Ltd. Cambridge UK School of Computer Science University of St Andrews UK Sch. of Math. & Comput. Sci. Heriot-Watt Univ. Edinburgh Edinburgh UK

In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects running on multicore machines. GpH and Eden are both constructed using the highly-optimising sequential GHC compiler, and share thread sch.duling, and other elements, from a common code base. The GpH implementation investigated here uses a physically-shared heap, which should be well-suited to multicore architectures. In contrast, the Eden implementation adopts an approach that has been designed for use on distributed-memory parallel machines: a system of multiple, independent heaps (one per core), with inter-core communication handled by message-passing rather than through shared heap cells. We report two main results. Firstly, we report on the effect of a number of optimisations that we applied to the shared-memory GpH implementation in order to address some performance issues that were revealed by our testing: for example, we implemented a work-stealing approach to task allocation. Our optimisations improved the performance of the shared-heap GpH implementation by as much as 30% on eight cores. Secondly, the shared heap approach is, rather surprisingly, not superior to a distributed heap implementation: both give similar performance results.

关键词： Multicore processing Parallel processing Computer architecture Concurrent computing Computer science math.matics Yarn Processor sch.duling Parallel machines Testing

来源：评论

学校读者我要写书评

暂无评论

Behavioral refinement of graph transformation-based models

Behavioral refinement of graph transformation-based models

引用

Proceedings of the Workshop on Software Evolution through Transformation: Model-Based vs. Implementation-Level

作者： Heckel, Reiko Thöne, Sebastian Faculty of Comp. Science Electrical Eng. And Math. University of Paderborn Germany Intl. Grad. Sch. Dynamic I. University of Paderborn Germany

Model-driven software engineering requires the refinement of abstract models into more concrete, platform-specific ones. To create and verify such refinements, behavioral models capturing recon- figuration or communication scenarios are presented as instances of a dynamic meta-model, i.e., a typed graph transformation system specifying the concepts and basic operations scenarios may be composed of. Possible refinement relations between models can now be described based on the corresponding meta-models. In contrast to previous approaches, refinement relations on graph transformation systems are not defined as fixed syntactic mappings between abstract transformation rules and, e.g., concrete rule expressions, but allow for a more loose, semantically defined relation between the transformation systems, resulting in a more flexible notion of refinement.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

On orthogonal designs in order 48

引用

Journal of Statistical Planning and Inference 2005年第1期128卷 311-325页

作者： Holzmann, W.H. Kharaghani, H. Seberry, Jennifer Tayfeh-Rezaie, B. Department of Math./Computer Science University of Lethbridge Lethbridge Alta. T1K 3M4 Canada Sch. of Info. Technol./Computer Sci. University of Wollongong Wollongong NSW 2522 Australia Inst. Studies Theoret. Phys./Math. Tehran P.O. Box 19395-5746 Iran

关键词： Additive property for matrices Amicable set of matrices Autocorrelation Orthogonal designs Weighing matrices

来源：评论

学校读者我要写书评

暂无评论

Web-enabled grid authentication in a non-Kerberos environment

Web-enabled grid authentication in a non-Kerberos environmen...

引用

International Workshop on Grid computing

作者： J.-P. Robinson J. Gemmill P. Joshi P. Bangalore Yiyi Chen S. Peechakara Song Zhou P. Achutharao Academic Computing Office of the Vice President for Information Technology University of Alabama Birmingham Birmingham AL USA Computer and Information Sciences School of Natural Science and Mathematics University of Alabama Birmingham Birmingham AL USA Sch. of Natural Sci. & Math. Alabama Univ. Birmingham AL USA

UABgrid is a collaboration between academic and administrative IT units at the University of Alabama at Birmingham (UAB). UABgrid provides a Web-based grid client environment, access to shared campus computational resources, and user identities defined by the authoritative campus identity provider. A Weblogin service leveraging UAB's authoritative identity directory is provided for grid authentication. Previous integrations of institutional identity management and grid authentication depended on a Kerberos environment and use of KX.509. We accomplish similar functionality in a non-Kerberos environment by leveraging our Weblogin service to drive applications which require grid credentials. The UABgrid registration process employs the Weblogin service to generate certificates and keys signed by our UABgridCA and automatically provisions accounts for UABgrid users based on resource center policies. After successful registration, UABgrid leverages the Weblogin service to allow users to access resources and to submit jobs using only a Web browser and their familiar username and password.

关键词： Authentication Identity management systems Environmental management Grid computing Resource management Bridges Collaboration Testing Collaborative work High performance computing

来源：评论

学校读者我要写书评

暂无评论

Finding interesting traversal patterns with linguistic parameters in fuzzy environment

Finding interesting traversal patterns with linguistic param...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Rui Wuw Suo-Zhu Wang Yu Wang Sch. of Math. & Comput. Sci. Shanxi Teachers Univ. Linfen China School of Mathematics and Computer Science Shanxi Teachers University LinFen China Faculty of Mathematics and Computer Science Hebei University Baoding China Institute of Systems Engineering Tianjin University Tianjin China

The mining parameters in most conventional data mining are numerical. Thus this paper attempts to propose a novel Web mining technique using linguistic minimum support and preference to discover interesting patterns from log data in Web servers. Linguistic minimum support and preference are characterized as fuzzy linguistic variables that are denoted by corresponding triangular fuzzy variables. The linguistic inputs and outputs are more natural and understandable for human beings. In addition, time duration on a Web page is considered and characterized as a fuzzy linguistic variable. The interesting traversal patterns with fuzzy linguistic variables make people easily understand the users' browsing paths and behaviors. The proposed algorithm thus discovers interesting traversal patterns with linguistic restriction. Experiments show accuracy and scalability of the algorithm.

关键词： Data mining Fuzzy sets Web mining Humans Fuzzy systems math.matics Computer science Web pages Data engineering Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

The robust state feedback H∞ control for discrete-time singular systems with uncertainties

The robust state feedback H∞ control for discrete-time sing...

引用

2004 5th Asian Control Conference

作者： Ma, Shaping Cheng, Zhaolin Sch. of Math. and System Science Shandong University Jinan 250100 China

ISBN: (纸本)0780388739

This paper discusses the robust state feedback H∞ control problem for uncertain discrete-time singular systems. The equivalence of this problem and the robust state feedback H∞ control problem for standard state-space uncertain discrete-time systems is presented without the assumption of regularity. In terms of LMI, the necessary and sufficient condition for the solution of this problem is given, the design method of the controller and a state feedback controller are also given.

关键词： Discrete time control systems

来源：评论

学校读者我要写书评

暂无评论

One direction S-rough decision and its decision model

One direction S-rough decision and its decision model

引用

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

作者： Shi, Kai-Quan Cui, Yu-Quan Sch. of Math. and System Science Shandong University Jinan Shandong 250100 China

ISBN: (纸本)0780384032

[1] presents S-rough sets(Singular Rough Sets), [2-4] give further discussion on S-rough sets. This paper presents One direction S-rough decision by using of research in [1-4], and gives decision model and characteristics of One direction S-rough decision. One direction S-rough decision is the combination of S-rough decision on (R, F)ˆ(Xˆ) and S-rough decision on (R,F)ˆ(Xˆ);(R,F) ˆ(Xˆ), (R,F)ˆ(X ˆ) are common sets with dynamic characteristics;(R,F) ˆ(Xˆ), (R,F)ˆ (X ˆ) are the lower approximation and upper approximation[1] of S-Sets(Singular Sets) Xˆ ⊂U respectively.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Signal period analysis based on hilbert-huang transform and its application to texture analysis

Signal period analysis based on hilbert-huang transform and ...

引用

Proceedings - Third International Conference on Image and Graphics

作者： Yang, Zhihua Qi, Dongxu Yang, Lihua Sch. of Info. Science and Technology Sun Yat-sen University Guangzhou 510275 China Faculty of Information Technology Macao Univ. of Sci. and Technology Macao Sch. of Math. and Computing Science Sun Yat-sen University Guangzhou 510275 China

ISBN: (纸本)0769522440

An approach to analyze the period of a signal based on Hilbert-Huang Transform is presented in this paper. For an approximately periodic signal which contains plenty of high frequency components, the relation between its period and its main frequency is established. Our main result is that, for an approximately periodic signal which contains plenty of high frequency components, its period can be estimated accurately according to its main-frequency distribution. By applying the technique on texture analysis, a novel method to extract the perodicity features of a texture image is developed, which can be used in texture classification, segmentation, recognition and other applications. © 2004 IEEE.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：