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

5th International Conference on Parallel Processing, Euro-Par 1999

作者： Casanova, Henri Kim, MyungHo Plank, James S. Dongarra, Jack J. Department of Computer Science and Engineering University of California at San Diego San Diego CA 92093-0114 United States School of Computing SoongSil University Seoul 156-743 Korea Republic of Department of Computer Science University of Tennessee Knoxville TN 37996-1301 United States Mathematical Science Section Oak Ridge National Laboratory Oak Ridge TN 37831 United States

ISBN: (纸本)3540664432

Scheduling in metacomputing environments is an active field of research as the vision of a Computational Grid becomes more concrete. An important class of Grid applications are long-running parallel computations with large numbers of somewhat independent tasks (Monte-Carlo simulations, parameter-space searches, etc.). A number of Grid middleware projects are available to implement such applications but scheduling strategies are still open research issues. This is mainly due to the diversity of both Grid resource types and of their availability patterns. The purpose of this work is to develop and validate a general adaptive scheduling algorithm for task farming applications along with a user interface that makes the algorithm accessible to domain scientists. Our algorithm is general in that it is not tailored to a particular Grid middleware and that it requires very few assumptions concerning the nature of the resources. Our first testbed is NetSolve as it allows quick and easy development of the algorithm by isolating the developer from issues such as process control, I/O, remote software access, or fault-tolerance. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Optimum cell-site positioning model for cellular network by grid line shifting method

Optimum cell-site positioning model for cellular network by ...

引用

IEEE Region 10 International Conference TENCON

作者： I. Islam A.B.M. Siddique Hossain Department of Electronics and Computer Science Jahangir Nagar University Dhaka Bangladesh Department of Electrical and Electronic Engineering Bangladesh Section B.U.E.T Dhaka Bangladesh

Proper coverage of service area in a cellular network largely depends on initial cell planning. The cell planning technique includes a lot of tasks such as nominal cell plan, coverage and interference predictions, field survey, system selection, system growth, etc. However, this paper includes only a theoretical model of cell site positioning, so that any irregular area can be covered with a combination of omni & sector cells most efficiently This model will be useful at the beginning of network planning in any urban/suburban/rural area.

关键词： Land mobile radio cellular systems Equations Traffic control Arm sections computer science Interference Predictive models Urban planning Guidelines

来源：评论

学校读者我要写书评

暂无评论

Model-guided segmentation of corpus callosum in MR images

Model-guided segmentation of corpus callosum in MR images

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： A. Lundervold N. Duta T. Taxt A.K. Jain Section for Medical Image Analysis and Informatics Department of Physiology University of Bergen Bergen Norway Department of Computer Science and Engineering Michigan State University East Lansing MI USA

Magnetic resonance imaging (MRI) of the brain, followed by automated segmentation of the corpus callosum (CC) in midsagittal sections has important applications in neurology and neurocognitive research since the size and shape of the CC are shown to be correlated to sex, age, neurodegenerative diseases and various lateralized behavior in man. Moreover, whole head, multispectral 3D MRI recordings enable voxel-based tissue classification and estimation of total brain volumes, in addition to CC morphometric parameters. We propose a new algorithm that uses both multispectral MRI measurements (intensity values) and prior information about shape (CC template) to segment CC in midsagittal slices with very little user interaction. The algorithm has been successfully tested on a sample of 10 subjects scanned with multispectral 3D MRI, collected for a study of dyslexia. We conclude that the proposed method for CC segmentation is promising for clinical use when multispectral MR images are recorded.

关键词： Image segmentation Magnetic resonance imaging Shape measurement Testing Robustness Biomedical imaging Image analysis Biomedical informatics Physiology computer science

来源：评论

学校读者我要写书评

暂无评论

Spanning trees for binary directed de bruijn networks and their applications to load balancing

引用

Journal of Marine science and Technology 1999年第2期7卷 117-124页

作者： Lin, Ming-Bo Bai, Ming-Hong Jan, Gene Eu Department of Electronic Engineering Natl. Taiwan Univ. Sci. and Technol. 43 Keelung Road Section 4 Taipei Taiwan Institute of Information Science Academia Sinica Department of Computer Science National Taiwan Ocean University Keelung Taiwan

One of the major reasons of using parallel computer systems is that they have the potential for improving performance and resource sharing. To achieve this, an efficient way must be provided to broadcast a message or messages from a node to every other nodes in the system. However, the efficiency of transferring messages in a system is determined by the architecture of the underlying interconnection network of the system. In this paper, we consider the systems based on binary directed de Bruijn networks and define two shortest path spanning trees: the upward-0 spanning tree and the downward-0 spanning tree, to meet various message transfer requirements. To demonstrate the usage of these spanning trees, an application to the load-balancing problem is considered. The resulting time complexity is O(log2 N + Σ Δi0 ΔiΔ), where N is the number of nodes and Δi, is the total transfer time for the load difference of each node i, for all 1 &le i &le N, on the binary directed de Bruijn networks.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Model reference adaptive controller design for MIMO linear systems based on multirate generalized sampled-data hold functions

引用

Systems science 1999年第3期25卷 5-36页

作者： Arvanitis, K.G. Sigrimis, N. Kookos, I.K. Kalogeropoulos, G. Natl. Technical University of Athens Dept. of Elec. and Comp. Engineering Division of Computer Science Zographou 15773 Athens Greece Agricultural University of Athens Dept. of Agricultural Engineering Athens 11855 Greece Imperial College Department of Chemical Engineering Ctr. for Process Systems Engineering SW7 2BY London United Kingdom University of Athens Department of Mathematics Section of Mathematical Analysis Panepistimiopolis 15784 Athens Greece

The use of multirate generalized sampled-data hold functions for model reference adaptive control of linear multiple-input, multiple-output (MIMO) systems with unknown parameters, is investigated in this paper, for the first time. Such a control scheme contains a multirate sampling mechanism with different sampling period to each system input and relies on two periodically varying modulating matrix functions. The proposed control strategy allows us to assign an arbitrary discrete-time transfer function matrix for the sampled closed-loop system and does not make assumptions on the plant other than controllability and observability of the continuous and the sampled system, and the knowledge of a set of structural indices, namely the locally minimum controllability indices of the continuous-time plant. The indirect adaptive control scheme presented here, estimates the unknown plant parameters (and hence the parameters of the desired modulating matrix functions) on line, from sequential data of the inputs and the outputs of the plant, which are recursively updated within the time limit imposed by a fundamental sampling period T0. The controller determination is reduced to the simple problem of solving a linear algebraic system of equations, whereas known indirect model reference adaptive control techniques require the solution of matrix polynomial Diophantine equations, whose solutions may become unstable. Moreover, persistency of excitation and, therefore, parameter convergence, of the continuous-time plant is provided without making assumptions either on the existence of specific convex sets in which the estimated parameters belong or on the coprimeness of the polynomials describing the ARMA model, or finally on the richness of the reference signals, as compared to known indirect model reference adaptive control schemes.

关键词： Control system synthesis

来源：评论

学校读者我要写书评

暂无评论

Grapheme generation in learning to read english words 12th

Grapheme generation in learning to read english words

引用

12th Biennial Conference on Artificial Intelligence, AI 1998

作者： Ling, Charles X. Zhang, Bei Department of Computer Science The University of Western Ontario LondonONN6A 5B7 Canada Foreign Language Teaching and Research Section Shanghai University of Engineering Science Shanghai200336 China

ISBN: (纸本)3540645756

A learning system for a more complete process of learning to read aloud English words should consist of three major steps: alignment, mapping learning, and grapheme generation. In a previous paper, we discussed a basic alignment algorithm and several improvements that effectively accomplish the alignment and mapping learning simultaneously. In this paper, we focus mainly on grapheme generation. We present several criteria for constructing graphemes, and demonstrate that graphemes generated improve the predictive accuracy in learning to read aloud. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Iterative blind image restoration using local constraints 9

Iterative blind image restoration using local constraints

引用

9th European Signal Processing Conference, EUSIPCO 1998

作者： May, Kaaren Stathaki, Tania Katsaggelos, Aggelos Signal Processing and Digital Systems Section Imperial College of Science Technology and Medicine London United Kingdom Department of Electrical and Computer Engineering Northwestern University EvanstonIL United States

A new method of incorporating local image constraints into blind image restoration is proposed. The local mean and variance of the degraded image are used to obtain .in initial estimate of the pixel intensity bounds. As the restoration proceeds, the bounds are updated from the current image estimate. I lie iterative-bound algorithm shows an improvement over the use of fixed bounds taken from the blurred image, in which case underestimation of the variance occurs at edges and textures. Simulations are presented for both the fixed-And iterative-bound implementations.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Robust fuzzy snakes

Robust fuzzy snakes

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： P.R. Kersten J.M. Keller Naval Air Warfare Center Weapons Division Target Recognition Section China Lake CA USA Computer Engineering and Computer Science Department University of Missouri Columbia Columbia MO USA

Flexible closed deformable contours extracted from images to represent object outlines are often called snakes. The paper explores and extends the use of snakes to extract contour features from images for modeling and pattern recognition. Many of the contour extraction algorithms have a common formulation as a constrained optimization problem. One version, called the constrained fuzzy clustering algorithm, links fuzzy clustering and snakes-the resulting contour being called a fuzzy snake. These extraction procedures are vulnerable to noise, which makes their application to noisy sensor images problematic. By applying known robust fuzzy clustering algorithms, more noise resistant snakes can be derived thereby extending contour feature extraction to sensor images.

关键词： Robustness Clustering algorithms Prototypes Feature extraction Image recognition Constraint optimization Data mining Image sensors Weapons Target recognition

来源：评论

学校读者我要写书评

暂无评论

Iterative determination of local bound constraints in iterative image restoration

Iterative determination of local bound constraints in iterat...

引用

IEEE International Conference on Image Processing

作者： K. May T. Stathaki A.G. Constantinides A.K. Katsaggelos Signal Processing and Digital Systems Section Imperial College of Science Technology and Medicine London UK Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

In this paper, the problem of how to better estimate spatially adaptive intensity bounds for image restoration is addressed. When the intensity bounds are estimated from a degraded image, blurring leads to underestimation of the bounds in the edge and texture regions. Therefore, an iterative implementation of the restoration algorithm has been proposed in which the intensity bounds are re-estimated from the current image estimate. However, direct update of the bounds leads to over-smoothing in regions where the bounds are active. Furthermore, the resulting algorithm exhibits slow convergence. In this paper, alternative methods of initially estimating and updating the bounds are proposed, and the results for the fixed- and updated-bound implementations are compared. A method for estimation of the bound tightness parameter is also proposed.

关键词： Image restoration Degradation Signal processing algorithms Convergence Statistics Smoothing methods Adaptive signal processing Digital signal processing Biomedical signal processing Digital systems

来源：评论

学校读者我要写书评

暂无评论

Blind image restoration using local bound constraints

Blind image restoration using local bound constraints

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： K. May T. Stathaki A.K. Katsaggelos Signal Processing and Digital Systems Section Imperial College of Science Technology and Medicine London UK Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

A new method of incorporating local image characteristics into blind image restoration is proposed. The local variance of the degraded image is used as a measure of spatial activity, from which individual pixel bounds are determined. A parameter defined by the user controls the degree of smoothing. The local bounds define the solution more precisely than smoothness constraints on the image (including those that are spatially-adaptive), reducing the number of possible solutions and leading to a faster rate of convergence. Experimental results demonstrate the potential of this method as an alternative/supplement to smoothing constraints in blind image restoration.

关键词： Image restoration Degradation Smoothing methods Signal restoration Digital signal processing Biomedical signal processing Digital systems Educational institutions Biomedical imaging Pixel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：