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

4th International Conference on Intelligent and Advanced Systems (ICIAS) and A Conference of World Engineering, Science and Technology Congress (ESTCON)

作者： Youssofzadeh, Vahab Faye, Ibrahima Malik, Aamir Saeed Reza, Faruque Kamel, Nidal Abdullah, Jafri Malin Univ Teknol PETRONAS Dept Elect & Elect Engn Ctr Intelligent Signal & Imaging Res Perak Malaysia Hosp Univ Sains Malaysia Dept Neurosci Kota Baharu Kelantan Malaysia

ISBN: (纸本)9781457719677

Fusion of EEG and fMRI data helps researchers to provide a more comprehensive understanding of neural basis for the functional behavior in human brain. EEG and fMRI Joint analysis for cognitive tasks indicates plausible results to obtain a better spatiotemporal resolution of event related responses in the brain. Joint-ICA as a multivariate data analysis method, assumes more than two features type (modalities) have common mixing data and it tries to maximizes independency among joint components. Here, we study the performance of five ICA algorithms when applied to joint analysis of EEG/fMRI data. We use the visualization and computational tools to quantitatively analyze the performance of different ICA algorithms for EEG/fMRI fusion and discuss the results for the simulation and real data.

关键词： nodal analysis Simulation results Data fusion analysis of algorithm data integration Cognitive tasks trees (mathematics) fMRI algorithms Visualization observational data

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Complexity analysis of User-level Memory Allocator algorithms

A Comprehensive Complexity Analysis of User-level Memory All...

引用

Brazilian Symposium on Computing System Engineering (SBESC)

作者： Ferreira, Tais Borges Fernandes, Marcia Aparecida Matias, Rivalino, Jr. Univ Fed Uberlandia Sch Comp Sci BR-38400 Uberlandia MG Brazil

ISBN: (纸本)9781467357470

Memory allocations are one of the most frequently used operations in computer programs. The performance of memory allocation operations is a critical factor in software design;however, it is very often neglected. In this paper, we present a comprehensive complexity analysis of widely adopted user-level memory allocator algorithms. We consider time and space complexity, as well as the allocator overhead. The results show that the Ptmalloc family of memory allocator algorithms outperformed all other investigated allocators in terms of theoretical time complexity and space overhead. All allocators showed the same space complexity.

关键词： Memory management analysis of algorithm user-level allocators

来源：评论

学校读者我要写书评

暂无评论

Mapping of arterial location for the design of automated identification and analysis algorithms in whole body MRA 37

Mapping of arterial location for the design of automated ide...

引用

37th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： McCormick, Lynne Weir-McCall, Jonathan Gandy, Stephen White, Richard McNeil, Andrew Trucco, Emanuele Houston, J. Graeme Univ Dundee Ninewells Hosp & Med Sch Dundee DD1 9SY Scotland Univ Dundee Ninewells Hosp & Med Sch NHS Tayside Dundee DD1 9SY Scotland Univ Wales Hosp Dept Clin Radiol Cardiff CF14 4XW S Glam Wales

ISBN: (纸本)9781424492701

Technological and medical advances have led to the realisation of full body imaging, with systemic diagnostic approaches becoming increasingly more prevalent. In the imaging of atherosclerotic disease, contrast - enhanced whole-body MRA has been demonstrated to enable detection of stenosis with a high sensitivity and specificity. Characterization of the systemic cardiovascular disease burden has significant prognostic value. A whole-body acquisition does however generate a large volume of three-dimensional data and as such there are expected to be significant advantages in developing automated techniques for the analysis of these images. Improved radiological workflow, reduced analysis time and increased analytical standardization are expected to be among the benefits offered by this approach. As part of a process of automated software development this study aimed to collect and validate arterial location ground truth. The data will be used to inform the development of semi-automated vascular identity tools, and allow the potential for the further development of semi-automated anatomically informed cardiovascular disease analysis and reporting.

关键词： MRA arterial location design Automatic format recognition MAPPING(MATHEMATICAL) MRAS gene analysis of algorithm Arteries large volume Software design computer software Cardiovascular Diseases Body Image analysis Automated recording Pathologic Constriction

来源：评论

学校读者我要写书评

暂无评论

Scalable analysis of Fault Trees with Dynamic Features 45

Scalable Analysis of Fault Trees with Dynamic Features

引用

45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

作者： Krcal, Jan Krcal, Pavel Univ Saarland Comp Sci Saarbrucken Germany Lloyds Register Consulting Stockholm Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781479986293

Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by time-dependent behavior, e.g., repairs or functional dependencies. analysis of DFT is so far limited to substantially smaller models than those required for, e.g., nuclear power plants. We propose a fault tree formalism that combines both static and dynamic features, called SD fault trees. It gives the user the freedom to express each equipment failure either statically, without modeling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce an analysis algorithm for an important subclass of SD fault trees. The algorithm (1) scales similarly to static algorithms and (2) allows for a more realistic analysis compared to static algorithms as it takes into account temporal interdependencies. Finally, we demonstrate the applicability of the method by an experimental evaluation on fault trees of nuclear power plants.

关键词： continuous time Markov chains dynamic fault trees industrial risk assessment static fault trees Fault trees Risk Assessment Risk Management Device Failure Equipment Failure Nuclear powerplants Wound Healing formalism analysis of algorithm Safety analysis

来源：评论

学校读者我要写书评

暂无评论

BER Performance analysis of MIMO Physical-Layer Network Coding Based on VBLAST Detection

BER Performance Analysis of MIMO Physical-Layer Network Codi...

引用

2nd IEEE/CIC International Conference on Communications in China (ICCC)

作者： Li, Yiping Zhang, Shengli Wang, Hui Shenzhen Univ Dept Commun Engn Shenzhen Key Lab Adv Commun & Informat Proc Shenzhen Peoples R China

ISBN: (纸本)9781479914036

MIMO techniques can significantly improve the diversity gain and spectrum utilization. Physical-layer Network Coding (PNC) is also a new technique to increase the spectrum utilization of wireless networks. The novel VBLAST PNC scheme combined these two techniques to improve the performance further. In this paper, we analyze the Bit Error Rate (BER) performance of the new scheme based on QPSK modulation over Rayleigh fading channels. Although the adaptive VBLAST PNC in the new scheme has a better BER performance, the analysis of this algorithm is too difficult to derive the closed-form expressions. Hence, we just present the exact analytical BER performance of VBLAST PNC in a near closed-form. The BER analysis is then verified by the numerical simulation. Inheriting the basic idea from VBLAST PNC scheme and with the help of analytical BER performance, we may develop a better PNC decoding strategy in further works.

关键词： bit error rate performance spectrum utilization efficiency V-BLAST PNC hierarchical network BER analysis Diversity methods Physical layer Raleigh fading channels analysis of algorithm Network coding

来源：评论

学校读者我要写书评

暂无评论

Semi-Online Scheduling with Machine Cost

引用

Journal of Computer Science & Technology 2002年第6期17卷 781-787页

作者： HE Yong CAI Shengyi Department of Mathematics Zhejiang University Hangzhou P.R. China Department of Mathematics Wenzhou Teachers’ College Wenzhou P.R. China

For most scheduling problems the set of machines is fixed initially and remainsunchanged for the duration of the problem. Recently Imreh and Nogaproposed to add theconcept of machine cost to scheduling problems and considered the so-called List Model *** online algorithm with a competitive ratio 1.618 was given while the lower bound is 4/3. Inthis paper, two different semi-online versions of this problem are studied. In the first case, it isassumed that the processing time of the largest job is known a priori. A semi-online algorithmis presented with the competitive ratio at most 1.5309 while the lower bound is 4/3. In thesecond case, it is assumed that the total processing time of all jobs is known in advance. Asemi-online algorithm is presented with the competitive ratio at most 1.414 while the lowerbound is 1.161. It is shown that the additional partial available information about the jobsleads to the possibility of constructing a schedule with a smaller competitive ratio than that ofonline algorithms.

关键词： analysis of algorithm competitive ratio semi-online scheduling machinecost

来源：评论

学校读者我要写书评

暂无评论

Laboratory exercises for practical performance of algorithms and data structures

引用

IEEE TRANSACTIONS ON EDUCATION 1996年第4期39卷 526-531页

作者： Sarwar, SM Parks, EE Sarwar, SA AMES RES LABS ALBANY OR 97321 USA NEW YORK INST TECHNOL ACAD COMP LABS OLD WESTBURY NY 11568 USA

This paper addresses the question of theoretical versus practical performance of algorithms and data structures. It describes an experiment the first author has been using in his data structures course to achieve the primary objective of comparing theoretical behavior of algorithms with their actual performance, It also presents enhancements in performance evaluation experiments and a general methodology that can be used to develop experiments in senior or first-year graduate courses in data structures, algorithm analysis, software engineering, and operating systems.

关键词： Performance Evaluation algorithms Data structures Exercise analysis of algorithm Operating systems

来源：评论

学校读者我要写书评

暂无评论

Semi-online scheduling jobs with tightly-grouped processing times on three identical machines

引用

DISCRETE APPLIED MATHEMATICS 2005年第1-3期150卷 140-159页

作者： He, Y Dósa, G Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China Zhejiang Univ State Key Lab CAD & CG Hangzhou 310027 Peoples R China Univ Veszprem Dept Math H-8201 Veszprem Hungary

This paper investigates the semi-online version of scheduling problem P||C-max on a three-machine system. We assume that all jobs have their processing times between p and rp(p > 0, r >= 1). We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r >=. 1. It shows that LS is an optimal semi-online algorithm for every r is an element of [1,1.5], [root 3, 2] and [6,+infinity). We further present an optimal algorithm for every r is an element of [2, 2.5], and an almost optimal algorithm for every r E (2.5, 3] where the largest gap between its competitive ratio and the lower bound of the problem is at most 0.01417. We also present an improved algorithm with smaller competitive ratio than that of LS for every r is an element of (3, 6). (c) 2005 Elsevier B.V. All rights reserved.

关键词： analysis of algorithm scheduling semi-online competitive ratio

来源：评论

学校读者我要写书评

暂无评论

Ordinal on-line scheduling for maximizing the minimum machine completion time

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2002年第2期6卷 199-206页

作者： He, Y Tan, ZY Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China

This paper considers the on-line problem of scheduling nonpreemptively n independent jobs on m > 1 identical and parallel machines with the objective to maximize the minimum machine completion time. It is assumed that the values of the processing times are unknown but the order of the jobs by their processing times is known in advance. We are asked to decide the assignment of all the jobs to some machines at time zero by utilizing only ordinal data rather than the actual magnitudes of jobs. algorithms to slove the problem are called ordinal algorithms. In this paper, we give lower bounds and ordinal algorithms. We first propose an algorithm MIN which is at most (inverted right perpendicular Sigma(i=1)(m) 1/i inverted left perpendicular +1)-competitive for any m machine case, while the lower bound is Sigma(i=1)(m) 1/i. Both are on the order of Theta(ln m). Furthermore, for m = 3, we present an optimal algorithm.

关键词： on-line scheduling analysis of algorithm competitive ratio

来源：评论

学校读者我要写书评

暂无评论

On constructing minimum spanning trees in R-1(k)

引用

algorithmICA 1997年第4期18卷 524-529页

作者： Bespamyatnikh, SN Department of Mathematics and Mechanics Ural State University 51 Lenin St. Ekaterinburg 620083 Russia. Sergei.Bespamyatnikh@usu.ru. RU

We give an algorithm to find a minimum spanning tree in the k-dimensional space under rectilinear metric. The running time is O((8(k)/root k)n(lg n)(k-2) Ig Ig n) for k greater than or equal to 3. This improves the pr... 详细信息

关键词： minimum spanning tree region approach analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：