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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

117 篇 会议
10 篇 期刊文献
2 册 图书

馆藏范围

129 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

65 篇 工学
- 62 篇 计算机科学与技术...
- 52 篇 软件工程
- 8 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 城乡规划学
- 1 篇 网络空间安全
24 篇 理学
- 15 篇 数学
- 6 篇 物理学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
19 篇 管理学
- 13 篇 管理科学与工程(可...
- 8 篇 图书情报与档案管...
- 7 篇 工商管理
3 篇 教育学
- 3 篇 教育学
- 1 篇 心理学(可授教育学...
2 篇 经济学
- 2 篇 应用经济学
2 篇 农学
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

17 篇 systems engineer...
14 篇 computer science
9 篇 collaborative wo...
8 篇 computer archite...
7 篇 proposals
7 篇 knowledge manage...
6 篇 conferences
6 篇 software enginee...
6 篇 context
6 篇 software
6 篇 load forecasting
5 篇 knowledge engine...
5 篇 hidden markov mo...
5 篇 neural networks
5 篇 fuzzy systems
5 篇 predictive model...
5 篇 analytical model...
5 篇 smoothing method...
5 篇 hardware
4 篇 programming prof...

机构

10 篇 systems engineer...
9 篇 postgraduate pro...
6 篇 tércio pacitti i...
4 篇 systems engineer...
4 篇 np2tec and postg...
3 篇 tércio pacitti i...
3 篇 postgraduate inf...
3 篇 inesc tec and un...
3 篇 department of el...
3 篇 systems engineer...
3 篇 lam-computer arc...
2 篇 inesc tec and un...
2 篇 computer science...
2 篇 college of infor...
2 篇 coppe-pesciufrj-...
2 篇 department of co...
2 篇 universidade fed...
2 篇 computer science...
2 篇 department of co...
2 篇 dcc-im/nce feder...

作者

11 篇 daniel schneider
10 篇 jano moreira de ...
9 篇 travassos guilhe...
7 篇 antónio correia
6 篇 santoro flávia m...
6 篇 m.a. teixeira
6 篇 g. zaverucha
5 篇 marcos antonio d...
5 篇 nedjah nadia
5 篇 werner cláudia
4 篇 frança felipe m....
4 篇 nery alexandre s...
4 篇 flávia maria san...
4 篇 alexandre s. ner...
4 篇 vanessa tavares ...
4 篇 werner cláudia m...
4 篇 ramon chaves
4 篇 jonice oliveira
4 篇 nadia nedjah
3 篇 felipe m.g. fran...

语言

129 篇 英文

检索条件"机构=Systems Engineering and Computer Science-COPPE"

共 129 条记录，以下是121-130 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Elastic neural net algorithm for cluster analysis

Elastic neural net algorithm for cluster analysis

引用

Brazilian Symposium on Neural Networks

作者： R.L. Salvini L.A. V. de Carvalho Program of Systems Engineering and Computer Science COPPE/UFRJ Rio de Janeiro Brazil

Proposes a method for data clustering in a n-dimensional space using the elastic net algorithm which is a variant of the Kohonen topographic map learning algorithm. The elastic net algorithm is a mechanical metaphor in which an elastic ring is attracted by points in a bi-dimensional space while their internal elastic forces try to shun the elastic expansion. The different weights associated with these two kinds of forces lead the elastic to a gradual expansion in the direction of the bi-dimensional points. In this method, the elastic net algorithm is employed with the help of a heuristic framework that improves its performance for application in the n-dimensional space of cluster analysis. Tests were made with two types of data sets: (1) simulated data sets with up to 1000 points randomly generated in groups linearly separable with up to dimension 10 and (2) the Fisher Iris Plant database, a well-known database referred to in the pattern recognition literature. The advantages of the method presented are its simplicity, its fast and stable convergence, beyond efficiency in cluster analysis.

关键词： Neural networks Clustering algorithms Algorithm design and analysis Databases Performance analysis Testing Test pattern generators Iris Pattern recognition Convergence

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of or-parallel logic programming systems on distributed shared-memory architectures

Performance evaluation of or-parallel logic programming syst...

引用

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

作者： Calegario, Vanusa Menditi De Castro Dutra, Inês Empresa Municipal de Informática S/A Rio de Janeiro Brazil COPPE - Systems Engineering and Computer Science Federal University of Rio de Janeiro Brazil

ISBN: (纸本)3540664432

In this work we investigate how Distributed Shared Memory (DSM) architectures affect performance of or-parallel logic programming systems and how this performance approaches that of conventional C systems. Our work concentrates on basic performance, scalability, and programmability. We use execution-driven simulation of a hardware DSM (DASH) to investigate the access patterns and caching behaviour exhibited by parallel C programs and by Aurora, a parallel logic programming system capable of exploiting implicit parallelism in Prolog programs. Aurora was originally written to run on bus-based shared-memory platforms. © Springer-Verlag Berlin Heidelberg 1999.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Disk write caching with an optical network 6

Disk write caching with an optical network

引用

6th International Conference on Parallel Interconnects, PI 1999

作者： Carrera, Enrique V. Bianchini, Ricardo COPPE Systems Engineering Federal University of Rio de Janeiro Rio de Janeiro21945-970 Brazil Department of Computer Science University of Rochester RochesterNY14627 United States

ISBN: (纸本)076950440X

In this paper we propose a simple extension to the optical network of a scalable multiprocessor that optimizes page swap-outs significantly. More specifically, we propose to extend the network with an optical ring that not only transfers swapped-out pages between the local memories and the disks of the multiprocessor but also acts as a system-wide write cache for these pages. This extended optical network has several performance benefits: it provides a staging area where swapped-out pages can reside until the disk is free;it increases the possibility of combining several writes to disk;and it acts as a victim cache for pages that are swapped out and subsequently accessed by the same or a different processor. In order to evaluate the extent to which these benefits affect performance, we use detailed execution-driven simulations of several out-of-core parallel applications running on an 8-node scalable multiprocessor. Our results demonstrate that our optical ring provides consistent performance improvements, coming mostly from faster page swap-outs and victim caching. Based on these results and on our parameter space study, our main conclusion is that our optical ring is highly efficient under several architectural assumptions and for most out-of-core parallel applications. © 1999 IEEE.

关键词： Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

Nomad: a scalable operating system for clusters of uni- and multiprocessors

Nomad: a scalable operating system for clusters of uni- and ...

引用

IEEE International Conference on Cluster Computing

作者： E. Pinheiro R. Bianchini COPPE Systems Engineering Federal University of Rio de Janeiro Rio de Janeiro Brazil Department of Computer Science University of Rochester Rochester NY USA

The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these clusters is yet to be fully exploited, mostly due to the inadequate management of cluster resources implemented by current distributed operating systems. In order to eliminate this problem and approach the computational power of large clusters of workstations, in this paper we propose Nomad, an efficient operating system for clusters of uni and/or multiprocessors. Nomad includes several important characteristics for modern cluster-oriented operating systems: scalability, efficient resource management across the cluster, efficient scheduling of parallel and distributed applications, distributed I/O, fault detection and recovery, protection, and backward compatibility. Some of the mechanisms used by Nomad, such as process checkpointing and migration, can be found in previously proposed systems. However, our system stands out for its strategy for disseminating information across the cluster and its efficient management of all cluster resources. In addition, Nomad is highly scalable as it uses neither centralized control nor extra messages to implement its functionality, taking advantage of the I/O traffic associated with its distributed file system. Our preliminary evaluation of the load balancing aspect of Nomad shows that the pattern of file accesses in our distributed Ale system allows for efficient and scalable load balancing. Our main conclusion is that the complete implementation of Nomad will most likely be efficient and will be a nice platform for future research on operating systems for clusters of workstations.

关键词： Operating systems Workstations Resource management Load management Multiprocessor interconnection networks Power system management Scalability Processor scheduling Fault detection Protection

来源：评论

学校读者我要写书评

暂无评论

Understanding the performance of DSM applications 1st

引用

1st Workshop on Communication and Architectural Support for Network-based Parallel Computing, CANPC 1997

作者： Meira, Wagner Leblanc, Thomas J. Hardavellas, Nikolaos Amorim, Clgudio Department of Computer Science University of Rochester RochesterNY14627 United States COPPE Systems Engineering UFRJ Rio de Janeiro21945-970 Brazil

ISBN: (纸本)3540625739

Carnival is a performance measurement and analysis tool that assists users in understanding the performance of DSM applications and protocols. Using traces of program executions, Carnival presents performance data as a hierarchy of execution profiles. During analysis, Carnival automates the inference process that relates performance phenomena to specific causes in the source code or DSM protocol using techniques that focus on the two most important sources of overhead in DSM systems: waiting time analysis identifies the causes of synchronization overhead, and produces an explanation for each source of waiting time in the program;communication analysis identifies the sequence of requests that result in invalidations, and produces an explanation for each source of communication. We describe these techniques and their implementation in TreadMarks, and show how to use waiting time analysis and communication analysis to improve the running time of two programs froIn the SPLASH application snite when executed on DEC Alphas connected by a DEC Memory Channel network. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Categorizing network traffic in update-based protocols on scalable multiprocessors

Categorizing network traffic in update-based protocols on sc...

引用

International Symposium on Parallel Processing

作者： R. Bianchini T.J. LeBlanc J.E. Veenstra COPPE Systems Engineering UFRJ Brazil Department of Computer Science University of Rochester Rochester NY USA Silicon Graphics Inc. USA

Categorizes the coherence traffic in update-based protocols and shows that, for most applications, more than 90% of all updates generated by such a protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These techniques include dynamic and static hybrid protocols, a data re-mapping strategy, and coalescing write buffers. Our simulations show that these techniques are effective for different types of useless updates. Overall, software caching (where dynamic data re-mapping is performed under programmer or compiler control) has the potential to significantly increase the percentage of useful traffic in applications. When software caching is not applicable, either the static or the dynamic protocol generates the least useless traffic. Although coalescing write buffers provide great reductions in the total number of messages transferred, these buffers do not necessarily increase the percentage of useful traffic.

关键词： Telecommunication traffic Protocols Application software Traffic control Character generation Hardware Software performance Programming profession Program processors

来源：评论

学校读者我要写书评

暂无评论

Hiding communication latency and coherence overhead in software DSMs

Hiding communication latency and coherence overhead in softw...

引用

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems

作者： R. Bianchini L. I. Kontothanassis R. Pinto M. De Maria M. Abud C. L. Amorim COPPE Systems Engineering Federal University of Rio de Janeiro Rio de Janeiro Brazil 21945-970 Department of computer Science University of Rochester Rochester New York

ISBN: (纸本)9780897917674

In this paper we propose the use of a PCI-based programmable protocol controller for hiding communication and coherence overheads in software DSMs. Our protocol controller provides three different types of overhead tolerance: a) moving basic communication and coherence tasks away from computation processors; b) prefetching of diffs; and c) generating and applying diffs with hardware assistance. We evaluate the isolated and combined impact of these features on the performance of TreadMarks. We also compare performance against two versions of the Shrimp-based AURC protocol. Using detailed execution-driven simulations of a 16-node network of workstations, we show that the greatest performance benefits provided by our protocol controller come from our hardware-supported diffs. Reducing the burden of communication and coherence transactions on the computation processor is also beneficial but to a smaller extent. Prefetching is not always profitable. Our results show that our protocol controller can improve running time performance by up to 50% for TreadMarks, which means that it can double the TreadMarks speedups. The overlapping implementation of TreadMarks performs as well or better than AURC for 5 of our 6 applications. We conclude that the simple hardware support we propose allows for the implementation of high-performance software DSMs at low cost. Based on this conclusion, we are building the NCP2 parallel system at coppe/UFRJ.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Maximum-Entropy Sampling 1

引用

丛书名： Springer Series in Operations Research and Financial engineering

1000年

作者： Marcia Fampa Jon Lee

ISBN: (数字)9783031130786

ISBN: (纸本)9783031130779;9783031130809

This monograph presents a comprehensive treatment of the maximum-entropy sampling problem (MESP), which is a fascinating topic at the intersection of mathematical optimization and data science. The text situates MESP in information theory, as the algorithmic problem of calculating a sub-vector of pre-specificed size from a multivariate Gaussian random vector, so as to maximize Shannon's differential entropy. The text collects and expands on state-of-the-art algorithms for MESP, and addresses its application in the field of environmental monitoring. While MESP is a central optimization problem in the theory of statistical designs (particularly in the area of spatial monitoring), this book largely focuses on the unique challenges of its algorithmic side. From the perspective of mathematical-optimization methodology, MESP is rather unique (a 0/1 nonlinear program having a nonseparable objective function), and the algorithmic techniques employed are highly non-standard. In particular, successful techniques come from several disparate areas within the field of mathematical optimization; for example: convex optimization and duality, semidefinite programming, Lagrangian relaxation, dynamic programming, approximation algorithms, 0/1 optimization (e.g., branch-and-bound), extended formulation, and many aspects of matrix theory. The book is mainly aimed at graduate students and researchers in mathematical optimization and data analytics.

关键词： Optimization Operations Research, Management science

来源：评论

学校读者我要写书评

暂无评论

Advances in Artificial Intelligence - SBIA 2008 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Gerson Zaverucha Augusto Loureiro Costa

ISBN: (数字)9783540881902

ISBN: (纸本)9783540881896

This book constitutes the refereed proceedings of the 19th Brazilian Symposium on Artificial Intelligence, SBIA 2008, held in Salvador, Brazil, in October 2008. The 27 revised full papers presented together with 3 invited lectures and 3 tutorials were carefully reviewed and selected from 142 submissions. The papers are organized in topical sections on computer vision and pattern recognition, distributed AI: autonomous agents, multi-agent systems and game knowledge representation and reasoning, machine learning and data mining, natural language processing, and robotics.

关键词： Programming Techniques Programming Languages, Compilers, Interpreters Data Mining and Knowledge Discovery Artificial Intelligence Mathematical Logic and Formal Languages Computation by Abstract Devices

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：