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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,927 篇 会议
142 篇 期刊文献
10 册 图书

馆藏范围

2,079 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,295 篇 工学
- 1,181 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 129 篇 电气工程
- 77 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 34 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
498 篇 理学
- 377 篇 数学
- 100 篇 物理学
- 77 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 23 篇 系统科学
276 篇 管理学
- 168 篇 图书情报与档案管...
- 123 篇 管理科学与工程(可...
- 88 篇 工商管理
66 篇 教育学
- 64 篇 教育学
63 篇 医学
- 61 篇 临床医学
- 34 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
28 篇 法学
- 23 篇 社会学
18 篇 经济学
9 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

91 篇 mobile computing
72 篇 distributed comp...
69 篇 computer science
53 篇 grid computing
47 篇 application soft...
40 篇 concurrent compu...
39 篇 computational mo...
36 篇 computer network...
34 篇 computer archite...
32 篇 cloud computing
29 篇 virtual reality
29 篇 ubiquitous compu...
27 篇 internet
26 篇 costs
25 篇 laboratories
23 篇 peer to peer com...
23 篇 middleware
20 篇 parallel process...
20 篇 processor schedu...
20 篇 hardware

机构

20 篇 the hong kong po...
18 篇 hong kong polyte...
18 篇 department of co...
15 篇 school of comput...
15 篇 school of comput...
12 篇 institute of com...
12 篇 department of co...
10 篇 nit calicut
10 篇 depauw universit...
10 篇 national institu...
9 篇 school of comput...
8 篇 college of compu...
7 篇 school of comput...
7 篇 school of comput...
6 篇 university of lo...
6 篇 pablo de olavide...
6 篇 department of co...
6 篇 college of compu...
6 篇 department of co...
6 篇 school of comput...

作者

25 篇 hong va leong
18 篇 leong hong va
15 篇 alvin chan
12 篇 hong jiman
11 篇 hung chih-cheng
11 篇 chan alvin t.s.
10 篇 liu ling
10 篇 gloria childress...
10 篇 george roussos
8 篇 umesh bellur
8 篇 song enmin
7 篇 rajiv ramnath
7 篇 pu calton
7 篇 si antonio
7 篇 ahamed sheikh iq...
7 篇 chandran priya
6 篇 federico divina
6 篇 sheikh iqbal aha...
6 篇 madhu kumar s.d.
6 篇 raúl giráldez ro...

语言

2,065 篇 英文
9 篇 其他
3 篇 中文
2 篇 葡萄牙文

检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"

共 2079 条记录，以下是1981-1990 订阅

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

详细简洁

排序：

SNACC: A parser generator for use with Miranda 96

SNACC: A parser generator for use with Miranda

引用

1996 acm symposium on applied computing, SAC 1996

作者： Turner, D.A. Computing Laboratory University of Kent CanterburyCT2 7NF United Kingdom

ISBN: (纸本)0897918207

Miranda is a lazy functional language with polymorphic typing and a simple but powerful module system, which is quite widely used for teaching and research in functional programming. SNACCY= "Surely NoiAnotherCompiler-Compiler")isaparser generator developed for use with Miranda, in the way that YACC is used with "C". A SNACC script consists of essentially BNF notation for a grammar, annotated with semantic rules written in Miranda. SNACC scripts are subject to the usual Miranda type discipline, and can be freely combined with ordinary Miranda scripts. The SNACC notation for semantic rules supports inherited as well as synthesised attributes, permitting attribute grammars, in the sense ofKnuth, to be expressed conveniently. The grammar part of SNACC breaks with the YACC tradition in producing parsers that are top-down with backtracking, rather than bottom-up left-to-right. This enables SNACC to accept a larger class of grammars than theLALRl accepted by YACC, with a corresponding increase in convenience afuse. We discuss the reason why top-down parsers are unfashionable, and the way in which the design of the grammar tool on SNACC overcomes some of these difficulties. © 1996 acm.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

A comparison of local search algorithms for radio link frequency assignment problems 96

A comparison of local search algorithms for radio link frequ...

引用

1996 acm symposium on applied computing, SAC 1996

作者： Hurley, S. Thiel, S.U. Smith, D.H. Dept. of Computer Science University of Wales Cardiff P.O. Box 916 CardiffCF2 3XF United Kingdom Dept. of Maths. and Computing University of Glamorgan Pontypridd Mid GlamorganCF37 1DL United Kingdom

ISBN: (纸本)0897918207

The frequency assignment problem, known to be NPcomplete, is to find an assignment of radio frequencies to a set of transmitters in a region. The interference level between the frequencies assigned to different communication links has to be acceptable, since otherwise communication will be distorted. Consequently, constraints are defined on pairs of links that limit the choice of frequencies for these pairs. Usually, a fixed number of frequency channels are available with which to make an assignment. The aim is to produce an assignment which minimizes the number of constraint violations. This paper compares the results obtained from using simulated annealing, genetic algorithms and tabu search for determining such an assignment. We report on our computational experiments in terms of the quality of the solutions obtained for realistic, computer-generated problem instances. © 1996 acm.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

The implementation of a chronicle collection class in Smalltalk/DB 96

The implementation of a chronicle collection class in Smallt...

引用

1996 acm symposium on applied computing, SAC 1996

作者： Schleifer, Paul Sun, Yuan Patel, Dilip School of Computing Information Systems and Mathematics South Bank University 103 Borough Road LondonSEI OAA United Kingdom

ISBN: (纸本)0897918207

In this paper, we present the implementation of a compact temporal object model based on time sequences as a general purpose collection class, called the Chronic le, in the Smalltalk/DB language. This provides an object database with the potential to express temporality and so creates a semantically rich environment for implementing applications that model temporally variable objects. We describe the concepts of the Chronicle class and give a detailed description of its components. This implementation supports the time-stamping of objects with transaction times and valid times, and does not depend on multiple inheritance as a mechanism for conferring temporality. Our implementation creates no additional barriers to schema evolution and instance migration, and storage performance is enhanced by the sharing of components that specify temporal semantics. However, because the classes of objects stored in a Chronicle are not known in advance, a comprehensive set of query methods cannot be generated and many queries must be created as low level expressions. © 1996 acm.

关键词： Object-oriented databases

来源：评论

学校读者我要写书评

暂无评论

A stroke-order free Chinese handwriting input system based on relative stroke positions and back-propagation networks 96

A stroke-order free Chinese handwriting input system based o...

引用

1996 acm symposium on applied computing, SAC 1996

作者： Leung, Wing-Nin Cheng, Kam-Shun Department of Computing Hong Kong Polytechnic University Hung Horn Kowloon Hong Kong

ISBN: (纸本)0897918207

In this paper, we present a new Chinese handwriting input method using relative stroke positions and backpropagation networks. This method overcomes the problems of missing strokes, extra strokes and iinkiug strokes as well as the infinite variations of writing styles and stroke orders in handwritten Chinese characters, and provides tolerance to slightly tilted characters which are often found in Chinese handwriting. A hierarchical character model is introduced for Chinese characters based on two simple character features: stroke type and relative stroke position. We have developed a Chinese handwriting input system based on this model on a 486 personal computer. In this system, a digitizer tablet with a stylus is used for writing Chinese characters as input to the system, a 3-layer back-propagation network is constructed and trained to classify basic strokes captured by the system, and a matching rule based on the degree of similarity between character pair is used to fmd a character match. The system was tested against a database of 500 frequently used Chinese characters, the overall successful recognition rate attained for handwritten Chinese character input was about 90%, with less than one second per character match. © 1996 acm.

关键词： Backpropagation

来源：评论

学校读者我要写书评

暂无评论

Partial-order methods for model checking: From linear time to branching time

Partial-order methods for model checking: From linear time t...

引用

11th Annual IEEE symposium on Logic in Computer Science (LIVS 96)

作者： Bernard, W Pierre, W UNIV LIEGE INST MONTEFIOREB-4000 LIEGEBELGIUM

ISBN: (纸本)0780336542

Partial-order methods make it possible to check properties of a concurrent system by state-space exploration without considering all interleavings of independent concurrent events. They have been applied to linear-time model checking, but so far only limited results are known about their applicability to branching-time model checking. In this paper, we introduce a general technique for lifting partial-order methods from linear-time to branching-time logics. This technique is shown to be applicable both to reductions that are applied to the structure representing the program before running the model checking procedure, as well as to reductions that can be obtained when model checking is done in an automata-theoretic framework. The latter are extended to branching-time logics by using the model-checking framework based on alternating automata introduced by O. Bernholtz et al. (1994).

关键词： Logic State-space methods Interleaved codes Automata Binary decision diagrams Concurrent computing System recovery Context modeling

来源：评论

学校读者我要写书评

暂无评论

A better approximation algorithm for finding planar subgraphs 7

A better approximation algorithm for finding planar subgraph...

引用

7th Annual acm-SIAM symposium on Discrete Algorithms, SODA 1996

作者： Cǎlinescu, Gruia Fernandes, Cristina G. Finkler, Ulrich Karloff, Howard College of Computing Georgia Institute of Technology AtlantaGA30332-0280 United States Max-Planck-Institut für Informatik SaarbrückenD-66123 Germany

ISBN: (纸本)0898713668

The MAXIMUM PLANAR SUBGRAPH problem-given a graph G, find a largest planar subgraph of G-has applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1/3, which is achieved simply by producing a spanning tree of G. We present the first approximation algorithm for MAXIMUM PLANAR SUBGRAPH with higher performance ratio (2/5 instead of 1/3). We also apply our algorithm to find large outerplanar subgraphs. Last, we show that both MAXIMUM PLANAR SUBGRAPH and its complement, the problem of removing as few edges as possible to leave a planar subgraph, are Max SNP-Hard.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Heuristics for register-constrained software pipelining 29

Heuristics for register-constrained software pipelining

引用

IEEE/acm International symposium on Microarchitecture (MICRO)

作者： J. Llosa M. Valero E. Ayguade Departament dE28099Arquitectura de Computadors Universitat Poliltècnica de Catalunya Barcelona Spain

ISBN: (纸本)9780818676413

Software Pipelining is a loop scheduling technique that extracts parallelism from loops by overlapping the execution of several consecutive iterations. There has been a significant effort to produce throughput-optimal schedules under resource constraints, and more recently to produce throughput-optimal schedules with minimum register requirements. Unfortunately even a throughput-optimal schedule with minimum register requirements is useless if it requires more registers than those available in the target machine. This paper evaluates several techniques for producing register-constrained modulo schedules: increasing the initiation interval (II) and adding spill code. We show that, in general, increasing the II performs poorly and might not converge for some loops. The paper also presents an iterative spilling mechanism that can be applied to any software pipelining technique and proposes several heuristics in order to speed-up the scheduling process.

关键词： Pipeline processing Registers Concurrent computing Processor scheduling Parallel processing Software algorithms Scheduling algorithm Contracts Production

来源：评论

学校读者我要写书评

暂无评论

Speculative hedge: regulating compile-time speculation against profile variations

Speculative hedge: regulating compile-time speculation again...

引用

IEEE/acm International symposium on Microarchitecture (MICRO)

作者： B.L. Deitrich W.W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana IL USA

Path-oriented scheduling methods, such os trace scheduling and hyperblock scheduling, use speculation to extract instruction-level parallelism from control-intensive programs. These methods predict important execution paths in the current scheduling scope using execution profiling or frequency estimation. Aggressive speculation is then applied to the important execution paths, possibly at the cost of degraded performance along other paths. Therefore, the speed of the output code can be sensitive to the compiler's ability to accurately predict the important execution paths. Prior work in this area has utilized the speculative yield function by Fisher, coupled with dependence height, to distribute instruction priority among execution paths in the scheduling scope. While this technique provides more stability of performance by paying attention to the needs of all paths, it does not directly address the problem of mismatch between compile-time prediction and run-time behavior. The work presented in this paper extends the speculative yield and dependence height heuristic to explicitly minimize the penalty suffered by other paths when instructions are speculated along a path. Since the execution time of a path is determined by the number of cycles spent between a path's entrance and exit in the scheduling scope, the heuristic attempts to eliminate unnecessary speculation that delays any path's exit. Such control of speculation makes the performance much less sensitive to the actual path taken at run time. The proposed method has a strong emphasis on achieving minimal delay to all exits. Thus the name, speculative hedge, is wed. This paper presents the speculative hedge heuristic, and shows how it controls over-speculation in a superblock/hyperblock scheduler. The stability of output code performance in the presence of execution variation is demonstrated with sit programs from the SPEC CINT92 benchmark suite.

关键词： Processor scheduling Delay Frequency estimation Stability Computer aided instruction Concurrent computing Parallel processing Costs Profitability Runtime

来源：评论

学校读者我要写书评

暂无评论

Modulo scheduling of loops in control-intensive non-numeric programs

Modulo scheduling of loops in control-intensive non-numeric ...

引用

IEEE/acm International symposium on Microarchitecture (MICRO)

作者： D.M. Lavery W.W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL USA

Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early exits. In control-intensive non-numeric programs, the loops frequently have characteristics that make it more difficult to effectively apply modulo scheduling. These characteristics include multiple control flow paths, loops that are not based on a loop counter, and multiple exits. In these loops, the presence of unimportant paths with high resource usage or long dependence chains can penalize the important paths. A path that contains a hazard such as another nested loop can prohibit modulo scheduling of the loop. Control dependences can severely restrict the overlap of the blocks within and across iterations. This paper describes a set of methods that allow effective modulo scheduling of loops with multiple exits. The techniques include removal of control dependences to enable speculation, extensions to modulo variable expansion, and a new epilogue generation scheme. These methods can be used with superblock and hyperblock techniques to allow modulo scheduling of the selected paths of loops with arbitrary control flow. A case study is presented to show how these methods, combined with superblock techniques, enable module scheduling to be effectively applied to control-intensive non-numeric programs. Performance results for several SPEC CINT92 benchmarks and Unix utility programs are reported and demonstrate the applicability of modulo scheduling to this class of programs.

关键词： Processor scheduling Counting circuits Pipeline processing Hazards Utility programs Software maintenance

来源：评论

学校读者我要写书评

暂无评论

Modulo scheduling of loops in control-intensive non-numeric programs 29

Modulo scheduling of loops in control-intensive non-numeric ...

引用

proceedings of the 29th annual acm/IEEE international symposium on Microarchitecture

作者： Daniel M. Lavery Wen-mei W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL

ISBN: (纸本)9780818676413

Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early exits. In control-intensive non-numeric programs, the loops frequently have characteristics that make it more difficult to effectively apply modulo scheduling. These characteristics include multiple control flow paths, loops that are not based on a loop counter, and multiple exits. In these loops, the presence of unimportant paths with high resource usage or long dependence chains can penalize the important paths. A path that contains a hazard such as another nested loop can prohibit modulo scheduling of the loop. Control dependences can severely restrict the overlap of the blocks within and across iterations. This paper describes a set of methods that allow effective modulo scheduling of loops with multiple exits. The techniques include removal of control dependences to enable speculation, extensions to modulo variable expansion, and a new epilogue generation scheme. These methods can be used with superblock and hyperblock techniques to allow modulo scheduling of the selected paths of loops with arbitrary control flow. A case study is presented to show how these methods, combined with superblock techniques, enable modulo scheduling to be effectively applied to control-intensive non-numeric programs. Performance results for several SPEC CINT92 benchmarks and Unix utility programs are reported and demonstrate the applicability of modulo scheduling to this class of programs.

关键词： control-intensive modulo scheduling modulo variable expansion instruction-level parallelism software pipelining speculation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 195 196 197 198 199 200 201 202 203 204 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：