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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

173 篇 会议
6 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

73 篇 工学
- 59 篇 计算机科学与技术...
- 34 篇 软件工程
- 18 篇 电气工程
- 13 篇 信息与通信工程
- 6 篇 生物医学工程（可授...
- 5 篇 电子科学与技术（可...
- 5 篇 网络空间安全
- 3 篇 仪器科学与技术
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 化学工程与技术
37 篇 理学
- 29 篇 数学
- 8 篇 物理学
- 3 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 地质学
12 篇 管理学
- 7 篇 图书情报与档案管...
- 5 篇 管理科学与工程(可...
4 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 医学
- 4 篇 临床医学
2 篇 法学
- 2 篇 社会学
1 篇 艺术学

主题

19 篇 distributed comp...
16 篇 concurrent compu...
16 篇 computer network...
14 篇 computer archite...
12 篇 grid computing
12 篇 computational mo...
10 篇 hardware
9 篇 computer science
9 篇 application soft...
8 篇 power engineerin...
8 篇 resource managem...
8 篇 laboratories
8 篇 humans
7 篇 parallel process...
7 篇 algorithm design...
7 篇 mobile computing
6 篇 processor schedu...
6 篇 frequency
6 篇 control systems
6 篇 analytical model...

机构

2 篇 computing scienc...
2 篇 department of ci...
2 篇 vienna universit...
2 篇 czech inst techn...
2 篇 center for appli...
2 篇 andra f-92298 ch...
2 篇 department of ci...
2 篇 sch. of eng. com...
2 篇 department of co...
2 篇 natl. inst. for ...
2 篇 lawrence livermo...
2 篇 department of el...
2 篇 univ lyon 1 cnrs...
2 篇 dept. of applied...
2 篇 university of ch...
2 篇 department of ci...
2 篇 inst numer math ...
2 篇 university of tu...
2 篇 centre for appli...
2 篇 department of ci...

作者

3 篇 ould-khaoua m.
2 篇 zhang woyu
2 篇 crossley shirley
2 篇 shang dashan
2 篇 yang um
2 篇 dong danian
2 篇 henson ve
2 篇 m. parashar
2 篇 singh abhishek
2 篇 boursier isabell...
2 篇 liu ming
2 篇 marek i
2 篇 tromeur-dervout ...
2 篇 cai hubo
2 篇 fenves steven
2 篇 yu jie
2 篇 abudayyeh osama
2 篇 li yi
2 篇 xu xiaoxin
2 篇 osborne hugh

语言

180 篇 英文
1 篇 其他

检索条件"任意字段=Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing"

共 181 条记录，以下是11-20 订阅

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

详细简洁

排序：

Lessons from industrial design for software engineering through constraints identification, solution space optimisation and reuse 02

Lessons from industrial design for software engineering thro...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Besnard, Denis Lawrie, Anthony T. Centre for Software Reliability Department of Computing Science University of Newcastle upon Tyne Newcastle upon Tyne NE1 7RU United Kingdom

ISBN: (纸本)9781581134452

Design is a complex activity that can be analysed from a wide variety of perspectives. This paper attempts to look at the individual problem solving process, taking into account psychological arguments. We characterise some of the phases involved in the design process, namely the constraints identification, the optimisation of solution space and the reuse process. We highlight a three-dimensional framework of how the constraints identification impacts on the solution space which, in turn, determines the range of the components that will be eligible for reuse. We discuss this argument through examples from both inside and outside the software engineering field.

关键词： Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes 02

Probability vectors: A new fault-tolerant routing algorithm ...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Al-Sadi, Jehad Day, Khaled Ould-Khaoua, Mohamed Computing Science Department University of Glasgow Glasgow G12 8RZ United Kingdom

ISBN: (纸本)9781581134452

This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using a minimal path due to a faulty node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

A hypothesis driven approach to condition specific transcription factor binding site characterization in S.c.

A hypothesis driven approach to condition specific transcrip...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Harrison, Rhonda DeLisi, Charles Whitehead Institute Massachusetts Institute of Technol. 9 Cambridge Center Cambridge MA 02142-1479 United States

We demonstrate a computational process by which transcription factor binding sites can be elucidated using genome-wide expression and binding profiles. The profiles direct us to the intergenic locations likely to contain the promoter regions for a given factor. These sequences are multiply and locally aligned to give an anchor motif from which further characterization can take place. We present bases for and assumptions about the variability within these motifs which give rise to potentially more accurate motifs, capture complex binding sites built upon the basis motif, and eliminate the constraints of the currently employed promoter searching protocols. We also present a measure of motif quality based on the occurrence of the putative motifs in regions observed to contain the binding sites. The assumptions, motif generation, quality assessment and comparison allow the user as much control as their a priori knowledge allows.

关键词： Medical computing

来源：评论

学校读者我要写书评

暂无评论

Towards a scalable broadcast in wormhole-switched mesh networks 02

Towards a scalable broadcast in wormhole-switched mesh netwo...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Al-Dubai, A.Y. Ould-Khaoua, M. Mackenzie, L.M. Department of Computing Science University of Glasgow Glasgow G12 8RZ United Kingdom

ISBN: (纸本)9781581134452

Broadcast algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two message-passing steps are required to implement a broadcast operation irrespective of the network size. Results from a comparative analysis reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Automatic code generation for executing tiled nested loops onto parallel architectures 02

Automatic code generation for executing tiled nested loops o...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Goumas, Georgios Athanasaki, Maria Koziris, Nectarios Natl. Technical University of Athens Computing Systems Laboratory Dept. of Electrical and Comp. Eng. Athens Greece

ISBN: (纸本)9781581134452

This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widely used to improve locality in multi-level memory hierarchies as well as to efficiently execute loops onto non-uniform memory access architectures. However, automatic code generation for tiled loops can be a very complex compiler work due to non-rectangular tile shapes and iteration space bounds. Our method considerably enhances previous work on rewriting tiled loops by considering parallelepiped tiles and arbitrary iteration space shapes. The complexity of code generation for tiling transformation is now reduced to the complexity of code generation for any linear transformation. Experimental results which compare all so far presented approaches, show that the proposed approach for generating tiled code is significantly accelerated.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient derivative computations in neutron scattering via interface contraction

Efficient derivative computations in neutron scattering via ...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Bücker, H. Martin Rasch, Arno Institute for Scientific Computing Aachen University of Technology D-52056 Aachen Germany

For the solution of a minimization problem, a neutron scattering simulation needs accurate and efficient derivatives of an objective function in the form of a Fortran 77 program with about 3,500 lines of code. We use the Adifor system implementing the technology of automatic differentiation to transform the given computer code into another program capable of evaluating the objective function and its derivatives. Compared to numerical differentiation, the derivatives obtained from applying automatic differentiation in this black-box fashion are free from truncation error and, in this application, their computation requires less time. To increase the efficiency of automatic differentiation further, a technique called interface contraction is used. The idea of interface contraction is to exploit the local structure of a given code by temporarily reducing the number of derivatives propagated through the code. By reporting performance results, we show the significance of interface contraction in the neutron scattering application. We also demonstrate the simplicity of the approach and argue that interface contraction should be incorporated into future automatic differentiation tools.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Implementation of fast RSA key generation on smart cards

Implementation of fast RSA key generation on smart cards

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Lu, Chenghuai Dos Santos, Andre L.M. Pimentel, Francisco R. College of Computing Georgia Institute of Technology Atlanta GA 30332-0280 United States

Although smart cards are becoming used in an increasing number of applications, there is small literature of the implementation issues for smart cards. This paper describes the issues and considerations that need to be taken into account when implementing the key generation step of a cryptographic algorithm widely used nowadays, RSA. Smart cards are used in many applications that require a tamper resistant area. Therefore, smart cards that use cryptography have to provide encryption, decryption, as well as key generation inside its security perimeter. RSA key generation is a concern for on-card implementation of RSA cryptosystem, as it usually takes a long time. In this paper, two simple but efficient key generation algorithms are evaluated, in addition to a simple but not very efficient algorithm. The paper discusses in detail how to build fast implementations for the three algorithms presented, using smart cards with cryptocoprocessor.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Chan, D.L. Luk, R.W.P. Mak, W.K. Leong, H.V. Ho, E.K.S. Lu, Q. Department of Computing Hong Kong Polytechnic University HongKong Hong Kong

ISBN: (纸本)9781581134452

Mobile clients have limited display and navigation capabilities. To browse a set of documents, an intuitive method is to navigate through concept hierarchies. To reduce semantic loading for each term that represents the concepts and the cognitive loading of users due to the limited display, similar documents are grouped together before concept hierarchies are constructed for each document group. Since the concept hierarchies only represent the salient concepts in the documents, term extraction is necessary. Our pilot experiments showed that an unconventional combination of term frequency and inverse document frequency yielded similar performance (i.e. 71%) to previous work and the use of terms in titles achieved better performance than previous work (i.e. 82%). Our preliminary results of building concept hierarchies after clustering compared to that without is encouraging (c.f. 82% and 67%). We believe that further research can enhance the performance of concept hierarchies to a level for commercial deployment for mobile clients.

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic structuring of web information for access visualization

Dynamic structuring of web information for access visualizat...

引用

applied computing 2002: proceeedings of the 2002 acm symposium on applied computing

作者： Mak, Jess Y.S. Leong, Hong Va Chan, Alvin T.S. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

The Internet has led to the formation of a global information infrastructure. To explore a web site, a site map would be useful as a short cut for a user to locate for the target information in a structured and efficient manner, rather than drilling into the web site following hyperlinks, reading possibly irrelevant information. Useless information impacts a mobile web environment, where mobile clients are only connected with unreliable wireless channels of limited bandwidth. Structured web page organization at the web server proxy is an important issue to resolve to provide efficient browsing experience for web clients, while minimizing the browsing of unrelated pages or sites. In this paper, we adopt the Document Information Extraction mechanism to construct a document cluster dynamically and intelligently with respect to a requested root web page. The document cluster works like a dynamic site map, spanning across several web sites. The clusters are generated and stored in XML format at proxy server so that it can potentially benefit a large number of mobile clients. Clients process the XML clusters and transform them to be visualized through VRML or DOM. For VRML, a transformer is built at the client-side to support a three-dimensional modeling view. For DOM, JavaScript is used for accessing the parsed XML data to produce a two-dimensional tree output.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Agent-based resource management for grid computing

Agent-based resource management for grid computing

引用

2nd IEEE/acm International symposium on Cluster computing and the Grid, CCGrid 2002

作者： Cao, Junwei Spooner, Daniel P. Turner, James D. Jarvis, Stephen A. Kerbyson, Darren J. Saini, Subhash Nudd, Graham R. High Performance Systems Laboratory University of Warwick Coventry United Kingdom Modelling Algorithms and Informatics Group Los Alamos National Laboratory United States NASA Ames Research Center Moffett Field CA United States

ISBN: (纸本)0769515827

It is envisaged that the grid infrastructure will be a large-scale distributed software system that will provide high-end computational and storage capabilities to differentiated users. A number of distributed computing technologies are being applied to grid development work, including CORBA and Jini. In this work, we introduce an A4 (Agile Architecture and Autonomous Agents) methodology, which can be used for resource management for grid computing. An initial system implementation utilises the performance prediction techniques of the PACE toolkit to provide quantitative data regarding the performance of complex applications running on local grid resources. At the meta-level, a hierarchy of identical agents is used to provide an abstraction of the system architecture. Each agent is able to cooperate with other agents to provide service advertisement and discovery to schedule applications that need to utilise grid resources. A performance monitor and advisor (PMA) is in development to optimize the performance of agent behaviours. © 2002 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：