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

3rd IEEE International symposium on Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced computing Systems (IDAACS-SWS)

作者： Lokshina, Izabella Wendt, Thomas Lanting, Cees SUNY Coll Oneonta 108 Ravine Pkwy Oneonta NY 13820 USA Offenburg Univ Appl Sci Klosterstr 14 D-77723 Gengenbach Germany CSEM Jaquet Droz 1 CH-2002 Neuchatel Switzerland

ISBN: (纸本)9781509043170

The paper recommends an approach to estimate effectively the probability of buffer overflow in high-speed communication networks, capable of carrying diverse traffic, including self-similar teletraffic, and supporting diverse levels of quality of service. Simulations with stochastic, long-range dependent self-similar traffic source models are conducted. A new efficient algorithm, based on a variant of the RESTART/LRE method, is developed and applied to accelerate the buffer overflow simulation in a finite buffer single server model under long-range dependent self-similar traffic load with different buffer sizes. Numerical examples and simulation results are shown.

关键词： high-speed communication networks diverse network traffic self-similar teletraffic steady-state simulation of self-similar queuing system with long-range dependent processes and finite buffer capacity accelerated buffer overflow simulation RESTART method with LRE algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective distributed architecture for OPC & RET applications

An effective distributed architecture for OPC & RET applicat...

引用

22nd Annual BACUS symposium on Photomask Technology

作者： Lugg, R Boman, M Burdorf, J Rieger, M Synopsys Inc Hillsboro OR 97124 USA

ISBN: (纸本)0819446750

The computational power needed to generate mask layouts for OPC and resolution enhancement techniques increases exponentially with-process node. Rapidly growing design complexity is compounded with the more aggressive methods now required for smaller feature sizes. Layers once considered non-critical now routinely receive correction. While some improvement in code efficiency can be expected, algorithms are maturing to the point where improvements will likely not keep pace with the computational need. To maintain required processing cycle times massively parallel processing methods must be employed. In this paper we discuss loosely-coupled distributed computing architectures applied to OPC/RET layout synthesis. Them degree to which an application is scalable depends on how well the problem can be divided into independent sets of data. Furthermore, data must also be partitioned into reasonably sized blocks so that memory requirements per processor can be bounded. Communication overhead, I/O overhead and serial processeses all degrade scalability, and may increase overall storage requirements. In this paper we analyze behavior of distributed processing architectures with large numbers of processors, and we present performance data on an existing massively parallel system.

关键词： distributed processing distributed computing optical proximity correction OPC mask data prep. resolution enhancement technique RET

来源：评论

学校读者我要写书评

暂无评论

SIA(M)ESE: An Algorithm for Transposition Invariant, Polyphonic Content-Based Music Retrieval 3

SIA(M)ESE: An Algorithm for Transposition Invariant, Polypho...

引用

3rd International symposium on Music Information Retrieval, ISMIR 2002

作者： Wiggins, Geraint A. Lemström, Kjell Meredith, David Department of Computing City University London United Kingdom Department of Computer Science University of Helsinki Finland

We introduce a novel algorithm for transposition-invariant contentbased polyphonic music retrieval. Our SIA(M)ESE algorithm is capable of finding transposition invariant occurrences of a given template, in a database of polyphonic music called a dataset. We allow arbitrary gapping, i.e., between musical events in the dataset that have been found to match points in the template, there may be any finite number of other intervening events. SIA(M)ESE can be implemented so that it finds all transposition-invariant complete matches for a -dimensional template of size m in a k- dimensional dataset of size n in a worst-case running time of O(kmn + kn log n);another implementation finds even the incomplete matches in O(kmn log(mn)) time. The algorithm is generalizable to any arbitrary, multidimensional translation invariant pattern matching problem, where the events are representable by points in a multidimensional dataset. © 2002 IRCAM - Centre Pompid.

关键词： Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

A recursion-based broadcast paradigm in wormhole routed mesh/torus networks 16

A recursion-based broadcast paradigm in wormhole routed mesh...

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Zhuang, Xiaotong Liberatore, V. College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30332-0280 United States Dept. EECS Case Western Reserve University 10900 Euclid Avenue ClevelandOH44106 United States

ISBN: (纸本)0769515738

A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented. It works by partitioning the graph into several subgraphs similar to the original one, and identifying a characteristic low-dimensional subgraph from these subgraphs. The source message is first scattered in the characteristic low-dimensional subgraph of the original graph, then through a O(1) number of message transfer and sharing operations, the characteristic low-dimensional subgraphs in each subgraph get the full source message. This procedure continues recursively until the minimum subgraph (a single node) gets all the source message. We have applied this general paradigm to several different cases including the one port/all-port model in mesh/torus with 2 or higher dimension. The network topology can be square or nonsquare, the source node can be located in the corner or not. Comparing to the previous results, our paradigm reduces broadcast latency and is simpler. We also present an analytical comparison of the algorithm against the optimum. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Experiments of Network Throughput Measurement and Forecasting Using the Network Weather 02

Experiments of Network Throughput Measurement and Forecastin...

引用

IEEE/acm International symposium on Cluster computing and the Grid (CCGRID)

作者： P. Primet R. Harakaly F. Bonnassieux Ecole Normale Supérieure INRIA-RESO Lyon France Ecole Normale Supérieure CNRS-UREC Lyon France

ISBN: (纸本)9780769515823

A tool able to predict the behavior of the network in a Global computing environment could help the users to obtain better performance. In this paper we study the accuracy of the Network Weather Service (NWS) networking features and specifically the TCP throughput measurement and prediction. We studied the NWS forecast stability and confidence level on different types of networking connectivity. To examine how the predicted values can be applied to "bulk" transfer, the prediction was compared with results of measurements achieved with the Iperf network monitoring tool. Iperf results are more accurate than the NWS ones but the tool is much more intrusive. We propose an improvement to use its predicting feature in an internet based global computing environment.

关键词： Weather forecasting Throughput Grid computing

来源：评论

学校读者我要写书评

暂无评论

Role of computing: Practitioners' Perspective (2002)

Role of Computing: Practitioners' Perspective (2002)

引用

Towards a Vision for Information Technology in Civil Engineering: Proceedings of the Fourth Joint International symposium on Information Technology in Civil Engineering

作者： Abudayyeh, Osama Cai, Hubo Fenves, Steven Law, Kincho O'Neill, Robert Rasdorf, William Department of Civil Engineering Coll. of Eng. and Applied Sciences Western Michigan University Kalamazoo MI 49008-5316 Department of Civil Engineering North Caroline State University Raleigh NC 27695-7908 Natl. Inst. for Std. and Technology Building 304 Stop 8262 100 Bureau Dr. Gaithersburg MD 20899-8262 Department of Civil Engineering Carnegie Mellon University Department of Civil Engineering Stanford University Stanford CA 94305-4020 Sch. of Eng. Comp./Constr. Mgmt. Rogers Williams University Bristol RI 02809-2921

ISBN: (纸本)0784407045

The Education Committee of the Technical Council on computing and Information Technology (TCCIT) of ASCE conducted two surveys to assess the current computing component of the curriculum in civil engineering. The two surveys were targeted at two different segments within the civil engineering profession: educators and practitioners. This paper presents the findings of the survey directed to civil engineering practitioners concerning their perspective on the issue. This survey is a follow-up of surveys conducted by the Education Committee in 1990 and 1995. The presentation of the results includes an analysis of some of the changes in the survey results since 1990.

关键词： Information technology

来源：评论

学校读者我要写书评

暂无评论

A framework to learn bayesian network from changing, multiple source biomedical data

A framework to learn bayesian network from changing, multipl...

引用

2005 AAAI Spring symposium

作者： Li, Guoliang Leong, Tze-Yun Medical Computing Laboratory School of Computing National University of Singapore 3 Science Drive 2 Singapore 117543 Singapore

Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a framework to learn Bayesian network from data with variable grouping. This framework has several advantages: I) it reduces the number of variables and narrows down the search space when learning Bayesian network structure;2) it relieves the requirement for the number of samples;and 3) the learned group Bayesian network is a higher-level abstraction of biological functions in a cell, which is comparable from one experiment to another, and does not need to change much at the level when the learned group Bayesian network is applied to changing experiments - only the relationship between a group variable and an original variable should be adjusted. We have done experiments on synthetic examples and real data to test the proposed framework. The preliminary results from synthetic examples show that the framework works with fewer samples, and the learned group Bayesian networks from different sets of experimental data agree with each other most of the time. The experiments with the real data also show some domain-meaningful results. This framework can also be applied to other domains with similar assumptions. Copyright © 2002, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Biomedical engineering

来源：评论

学校读者我要写书评

暂无评论

BoomerAMG:: A parallel algebraic multigrid solver and preconditioner

引用

applied NUMERICAL MATHEMATICS 2002年第1期41卷 155-177页

作者： Henson, VE Yang, UM Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94551 USA

Driven by the need to solve linear systems arising from problems posed on extremely large, unstructured grids, there has been a recent resurgence of interest in algebraic multigrid (AMG). AMG is attractive in that it holds out the possibility of multigrid-like performance on unstructured grids. The sheer size of many modem physics and simulation problems has led to the development of massively parallel computers, and has sparked much research into developing algorithms for them. Parallelizing AMG is a difficult task, however. While much of the AMG method parallelizes readily, the process of coarse-grid selection, in particular, is fundamentally, sequential in nature. We have previously introduced a parallel algorithm [A.J. Cleary, R.D. Falgout, V.E. Henson, J.E. Jones, in: Proceedings of the Fifth International symposium on Solving Irregularly Structured Problems in Parallel, Springer, New York, 1998] for the selection of coarse-grid points, based on modifications of certain parallel independent set algorithms and the application of heuristics designed to insure the quality of the coarse grids, and shown results from a prototype serial version of the algorithm. In this paper we describe an implementation of a parallel ANIG code, using the algorithm of A.J. Cleary, R.D. Falgout, V.E. Henson, J.E. Jones [in: Proceedings of the Fifth International symposium on Solving Irregularly Structured Problems in Parallel, Springer, New York, 1998] as well as other approaches to parallelizing the coarse-grid selection. We consider three basic coarsening schemes and certain modifications to the basic schemes, designed to address specific performance issues. We present numerical results for a broad range of problem sizes and descriptions, and draw conclusions regarding the efficacy of the method. Finally, we indicate the current directions of the research. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

关键词： algebraic multigrid parallel computing

来源：评论

学校读者我要写书评

暂无评论

Syntactic analysis for ellipsis handling in coordinated clauses 16th

Syntactic analysis for ellipsis handling in coordinated clau...

引用

16th Brazilian symposium on Artificial Intelligence, SBIA 2002

作者： Maduro, Ralph Moreira Carvalho, Ariadne M. B. R. State University of Campinas Institute of Computing Brazil

ISBN: (纸本)3540001247

This work is intended as an investigation into elliptical phenomena in natural language. We argue that some types of ellipsis can be resolved at the syntactic level since they are subject to syntactic constraints. We have dealt with four of the major types of ellipsis found in Portuguese, namely: Null VP, Gapping, Stripping and Sluicing. We have used Island Constraints in order to decide on the grammaticality of the sentence. Finally, we have developed and implemented a syntacticallybased algorithm that recovers the elidedconstituents and reconstructs the elliptical clause, when applicable. The linguistic data in this work is drawn primarily from Portuguese, but we believe that the results can also be applied to other languages, such as English. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

View-dependent multiresolution splatting of non-uniform data

View-dependent multiresolution splatting of non-uniform data

引用

4th Joint Eurographics - IEEE TCVG symposium on Visualization, VisSym 2002

作者： Jang, Justin Ribarsky, William Shaw, Christopher D. Faust, Nickolas GVU Center College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30332 United States

ISBN: (纸本)158113536X

This paper develops an approach for the splat-based visualization of large scale, non-uniform data. A hierarchical structure is generated that permits detailed treatment at the leaf nodes of the non-uniform distribution. A set of levels of detail (LODs) are generated based on the levels of the hierarchy. These yield two metrics, one in terms of the spatial extent of the bounding box containing the splat and one in terms of the variation of the scalar field over this box. The former yields a view-dependent choice of LODs while the latter yields a view-independent LOD based on the field variation. To show the utility of this general approach it is applied to a set of application data for a whole earth environment and some test data. Performance results are given. © The Eurographics Association 2002.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：