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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

906 篇 会议
450 篇 期刊文献
23 册 图书

馆藏范围

1,379 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

811 篇 工学
- 603 篇 计算机科学与技术...
- 434 篇 软件工程
- 128 篇 控制科学与工程
- 121 篇 信息与通信工程
- 59 篇 电气工程
- 49 篇 电子科学与技术（可...
- 47 篇 机械工程
- 47 篇 安全科学与工程
- 38 篇 生物医学工程（可授...
- 34 篇 建筑学
- 34 篇 土木工程
- 34 篇 生物工程
- 28 篇 仪器科学与技术
- 25 篇 化学工程与技术
- 24 篇 材料科学与工程（可...
- 18 篇 交通运输工程
490 篇 理学
- 335 篇 数学
- 81 篇 统计学（可授理学、...
- 64 篇 物理学
- 64 篇 系统科学
- 45 篇 生物学
- 26 篇 化学
208 篇 管理学
- 148 篇 管理科学与工程(可...
- 87 篇 工商管理
- 61 篇 图书情报与档案管...
42 篇 经济学
- 40 篇 应用经济学
33 篇 医学
- 26 篇 基础医学(可授医学...
- 26 篇 临床医学
27 篇 法学
- 25 篇 社会学
27 篇 教育学
- 22 篇 教育学
15 篇 农学
3 篇 文学
2 篇 哲学
2 篇 军事学
2 篇 艺术学

主题

35 篇 artificial intel...
33 篇 safety
31 篇 computer science
28 篇 computer archite...
27 篇 software
23 篇 monitoring
23 篇 hardware
21 篇 computational mo...
20 篇 application soft...
18 篇 software enginee...
18 篇 semantics
17 篇 data models
16 篇 optimization
15 篇 reliability
14 篇 programming prof...
14 篇 system-on-chip
14 篇 iec standards
13 篇 functional progr...
13 篇 standards
13 篇 training

机构

47 篇 department of ap...
25 篇 department of co...
18 篇 department of ap...
17 篇 department of sy...
17 篇 computer archite...
15 篇 department of co...
15 篇 department of co...
13 篇 department of pr...
13 篇 department of co...
11 篇 department of ap...
10 篇 technical univer...
9 篇 department of co...
9 篇 icas institute f...
9 篇 department of ap...
8 篇 institute for co...
8 篇 department of co...
8 篇 computer techniq...
7 篇 department of ma...
7 篇 department of pr...
7 篇 chair for comput...

作者

43 篇 josef börcsök
34 篇 pal madhumangal
30 篇 ali hayek
22 篇 börcsök josef
20 篇 madhumangal pal
19 篇 gancheva veska
17 篇 veska gancheva
15 篇 börcsök j.
15 篇 boercsoek josef
15 篇 fritzson peter
14 篇 hayek ali
12 篇 mondal shyamal k...
12 篇 maiti manoranjan
12 篇 gurkan tuna
12 篇 mostafa abotaleb
11 篇 mariana arghir
10 篇 tuna gurkan
10 篇 xue jingling
10 篇 roy abi zeid dao...
9 篇 roy sankar kumar

语言

1,336 篇 英文
32 篇 其他
8 篇 中文
1 篇 日文
1 篇 俄文
1 篇 土耳其文

检索条件"机构=Computer Programming"

共 1379 条记录，以下是1141-1150 订阅

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

详细简洁

排序：

Efficient techniques for distributed implementation of search-based AI systems

Efficient techniques for distributed implementation of searc...

引用

International Conference on Parallel Processing (ICPP)

作者： G. Gupta E. Pontelli Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM USA

We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing or-parallelism, which when coupled with appropriate scheduling strategies leads to: (i) reduced communication during distributed execution; and, (ii) distribution of larger grain- sized work to processors. The modified technique can also be implemented on shared memory machines and should be quite competitive with existing methods. Indeed, an implementation has been carried out on shared memory machines, and the results are reported here.

关键词： Artificial intelligence Parallel processing Logic programming Laboratories Databases computer science Read only memory Artificial neural networks Tree graphs Image recognition

来源：评论

学校读者我要写书评

暂无评论

Automatic creation of both the topology and parameters for a robust controller by means of genetic programming

Automatic creation of both the topology and parameters for a...

引用

IEEE International Symposium on Intelligent Control (ISIC)

作者： J.R. Koza M.A. Keane F.I. Bennett Jessen Yu W. Mydlowec O. Stiffelman Section on Medical Informatics School of Medicine University of Stanford Stanford CA USA Econometrics Inc. Chicago IL USA Genetic Programming Inc. Los Altos CA USA Computer Science Department University of Stanford Stanford CA USA

The paper describes a general automated method for synthesizing the design of both the topology and parameter values for controllers. The automated method automatically makes decisions concerning the total number of processing blocks to be employed in the controller, the type of each block, the topological interconnections between the blocks, the values of all parameters for the blocks, and the existence, if any, of internal feedback between the blocks of the overall controller. Incorporation of time-domain, frequency-domain, and other constraints on the control or state variables (often analytically intractable using conventional methods) can be readily accommodated. The automatic method described in the paper (genetic programming) is applied to a problem of synthesizing the design of a robust controller for a plant with a second-order lag. A textbook PID compensator preceded by a lowpass pre-filter delivers credible performance on this problem. However, the automatically created controller employs a second derivative processing block (in addition to proportional, integrative, and derivative blocks and a pre-filter). It is better than twice as effective as the textbook controller as measured by the integral of the time-weighted absolute error, has only two-thirds of the rise time in response to the reference (command) input, and is 10 times better in terms of suppressing the effects of disturbance at the plant input.

关键词： Topology Robustness Automatic control Feedback Time domain analysis Frequency domain analysis Genetic programming Robust control PD control Proportional control

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of both the topology and parameters for a robust controller for a nonminimal phase plant and a three-lag plant by means of genetic programming

Automatic synthesis of both the topology and parameters for ...

引用

IEEE Conference on Decision and Control

作者： J.R. Koza M.A. Keane J. Yu F.H. Bennett W. Mydlowec O. Stiffelman Section on Medical Informatics School of Medicine University of Stanford Stanford CA USA Econometrics Inc. Chicago IL USA Genetic Programming Inc. Los Altos CA USA Computer Science Department University of Stanford Stanford CA USA

This paper describes how genetic programming can be used to automate the synthesis of the design of both the topology and parameter values for controllers. The method described in this paper automatically makes decisions concerning the total number of processing blocks to be employed in the controller, the type of each block, the topological interconnections between the blocks, the values of all parameters for the blocks, and the existence, if any, of internal feedback between the blocks of the overall controller. This design process can readily combine optimization of performance (e.g., by a metric such as the integral of the time-weighted error) with time-domain constraints and frequency-domain constraints. Genetic programming is applied to two illustrative problems of controller synthesis: the design of a robust controller for a nonminimal-phase plant and the design of a robust controller for a three-lag plant. The PID compensator of Astrom and Hagglund (1995) for the three-lag plant delivers credible performance. The automatically created controller is better than 7.2 times as effective as the previous controller as measured by the integral of the time-weighted absolute error, has only 50% of the rise time in response to the reference input, has only 35% of the settling time, and is 92.7 dB better in terms of suppressing the effects of disturbance at the plant input.

关键词： Topology Automatic control Genetic programming Robust control Feedback Process design Constraint optimization Design optimization Time domain analysis Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

Information theoretical approach to minimization of AND/EXOR expressions of switching functions

Information theoretical approach to minimization of AND/EXOR...

引用

International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service (TELSIKS)

作者： V. Shmerko D. Popel R.S. Stankovic V. Cheushev S. Yanushkevich Department of Computer Aided Design Systems Technical University of Szczecin Poland Department of Computer Science State University of Informatics and Radioelectronics of Belarus Minsk Belarus Department of Computer Science University of Nis Yugoslavia Department of Programming Technologies State University Minsk Belarus

In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the information in numerical values, is a key notion. In this paper, we relate these two concepts, belonging to different areas, into an approach to the minimisation of exclusive-or sum-of-products (AND/EXOR) expressions for switching functions. The Shannon decomposition, and the closely related Davio decomposition for AND/EXOR expressions are interpreted in terms of basic concepts in the information theory. Thanks to that, we have proposed an entropy based strategy for minimization of AND/EXOR expressions. We have provided a comparison and an experimental verification of this strategy with some known heuristic minimization strategies using benchmarks. In some cases, our program Info-EXOR produces extremely better results. Moreover, the information theory interpretation of classical decomposition of switching functions offers a new point of view to the existing design styles.

关键词： Minimization Entropy Information theory Switching circuits Telecommunication switching Circuit synthesis Data structures Boolean functions Electronic mail Logic design

来源：评论

学校读者我要写书评

暂无评论

RPO constraint solving is in NP 12th

引用

12th International Workshop on computer Science Logic, CSL 1998 held as the Annual Conference of the European Association for computer Science Logic, EACSL 1998

作者： Narendran, Paliath Rusinowitch, Michael Verma, Rakesh Institute of Programming and Logics Department of Computer Science State University of New York at Albany AlbanyNY12222 United States LORIA 615 rue du jardin botanique BP 101 Villers les Nancy cedex54602 France Dept. of Comp. Science University of Houston HoustonTX77204 United States

ISBN: (纸本)3540659226

A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is solvable over the given signature, i.e., the signature over which the terms in the constraints are defined. It is shown that this non-deterministic procedure runs in polynomial time, thus establishing the membership of this problem in the complexity class NP for the first time. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Reuse contracts as component interface descriptions

Reuse contracts as component interface descriptions

引用

Workshops on Object-Oriented Technology, ECOOP 1997

作者： Hondt, Koen De Lucas, Carine Steyaert, Patrick Programming Technology Lab Computer Science Department Vrije Universiteit Brussel Pleinlaan 2 BrusselB-1050 Belgium

ISBN: (纸本)3540640398

Current interface descriptions are poor in describing components, because they only provide an external view on a component and they do not lay down how components interact with each other. Suggestions to improve component interface descriptions at last year’s workshop are reconsidered and reuse contracts are put forward as a solution that goes one step further. © Springer-Verlag Berlin Heidelberg 1998.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Aspect-oriented programming workshop report

Aspect-oriented programming workshop report

引用

Workshops on Object-Oriented Technology, ECOOP 1997

作者： Mens, Kim Lopes, Cristina Tekinerdogan, Bedir Kiczales, Gregor Department of Computer Science Programming Technology Lab Vrije Universiteit Brussel Pleinlaan 2 BrusselB-1050 Belgium Systems and Practices Laboratory Xerox PARC 3333 Coyote Hill Rd Palo AltoCA94304 United States Department of Computer Science Software Engineering University of Twente P.O. Box 217 Enschede7500 AE Netherlands

ISBN: (纸本)3540640398

Whereas it is generally acknowledged that code tangling reduces the quality of software and that aspect-oriented programming (AOP) is a means of addressing this problem, there is — as yet — no clear definition or characterisation of AOP. Therefore, the main goal of the ECOOP’97 AOP workshop was to identify the "good questions" for exploring the idea of AOP. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Fold and unfold for program semantics 98

Fold and unfold for program semantics

引用

Proceedings of the third ACM SIGPLAN international conference on Functional programming

作者： Graham Hutton Languages and Programming Group Department of Computer Science University of Nottingham UK

ISBN: (纸本)9781581130249

In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the dual recursion operator unfold can be used to structure operational semantics, and how algebraic properties of these operators can be used to reason about program semantics. The techniques are explained with the aid of two main examples, the first concerning arithmetic expressions, and the second concerning Milner's concurrent language CCS. The aim of the paper is to give functional programmers new insights into recursion operators, program semantics, and the relationships between them.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new framework for integrated global local scheduling 98

A new framework for integrated global local scheduling

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： S. Mantripragada S. Jain J. Dehnert High Performance Programming Environment Group Silicon Graphics Computer Systems Mountain View CA USA

ISBN: (纸本)9780818685910

Global Instruction Schedulers can be classified as either structure or profile driven. Structure driven approaches attempt to find instruction level parallelism by redistributing instructions along all possible execution paths. When resources are limited, poor choices may penalize the frequently executed paths. By contrast, profile driven approaches use feedback information to identify frequently executed (hot) regions, and attempt to improve their performance. This may be at the expense of less frequently executed (cold) regions, for instance by inserting fixup code. The overall performance improves if the frequency information is accurate and there is a dominant trace in the program. If either of these conditions does not hold, performance may degrade. We present a novel algorithm that attempts to combine the individual merits of the above two approaches while avoiding some of their drawbacks. We have also incorporated several techniques which improve the global scheduling performance on out-of-order (OOO) processors. Our algorithm is integrated with a parametric resource model and can be applied both before and after register allocation. It has been implemented in the SGI MIPSpro compiler, and the results have been evaluated on the MIPS R8000 and R10000 processors.

关键词： Data mining Processor scheduling programming environments Silicon computer graphics High performance computing Electronic switching systems Degradation Out of order Registers

来源：评论

学校读者我要写书评

暂无评论

Nested datatypes 4th

引用

4th International Conference on Mathematics of Program Construction, MPC 1998

作者： Bird, Richard Meertens, Lambert Programming Research Group Oxford University Wolfson Building Parks Road OxfordOX1 3QD United Kingdom CWI and Department of Computer Science Utrecht University P.O. Box 94079 AmsterdamGB1090 Netherlands

ISBN: (纸本)3540645918

A nested datatype, also known as a non-regular datatype, is a parametrised datatype whose declaration involves different instances of the accompanying type parameters. Nested datatypes have been mostly ignored in functional programming until recently, but they are turning out to be both theoretically important and useful in practice. The aim of this paper is to suggest a functorial semantics for such datatypes, with an associated calculational theory that mirrors and extends the standard theory for regular datatypes. Though elegant and generic, the proposed approach appears more limited than one would like, and some of the limitations are discussed. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共138页 << < 111 112 113 114 115 116 117 118 119 120 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：