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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,177 篇 会议
330 篇 期刊文献
7 册 图书
5 篇 学位论文

馆藏范围

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

日期分布

学科分类号

642 篇 工学
- 464 篇 计算机科学与技术...
- 307 篇 软件工程
- 223 篇 电气工程
- 78 篇 控制科学与工程
- 63 篇 信息与通信工程
- 50 篇 机械工程
- 31 篇 电子科学与技术（可...
- 20 篇 仪器科学与技术
- 16 篇 材料科学与工程（可...
- 7 篇 动力工程及工程热...
- 6 篇 力学（可授工学、理...
- 6 篇 生物医学工程（可授...
- 5 篇 建筑学
- 5 篇 化学工程与技术
- 5 篇 生物工程
- 4 篇 土木工程
- 4 篇 航空宇航科学与技...
- 4 篇 核科学与技术
106 篇 理学
- 70 篇 数学
- 14 篇 物理学
- 11 篇 系统科学
- 11 篇 统计学（可授理学、...
- 10 篇 生物学
- 7 篇 科学技术史(分学科...
55 篇 管理学
- 40 篇 管理科学与工程(可...
- 15 篇 图书情报与档案管...
- 8 篇 工商管理
8 篇 医学
- 6 篇 临床医学
6 篇 教育学
- 6 篇 教育学
4 篇 文学
- 4 篇 新闻传播学
2 篇 哲学
2 篇 经济学
2 篇 法学
1 篇 历史学

主题

1,519 篇 automatic progra...
156 篇 programming prof...
145 篇 application soft...
143 篇 automatic contro...
137 篇 computer science
109 篇 robot programmin...
106 篇 robotics and aut...
104 篇 genetic programm...
90 篇 automatic testin...
88 篇 control systems
86 篇 hardware
83 篇 computer languag...
82 篇 humans
80 篇 software enginee...
75 篇 costs
73 篇 automation
72 篇 testing
69 篇 software systems
64 篇 artificial intel...
64 篇 functional progr...

机构

8 篇 the robotics ins...
5 篇 school of comput...
4 篇 fujitsu laborato...
4 篇 national univers...
4 篇 graduate school ...
3 篇 department of co...
3 篇 sandia national ...
3 篇 college of infor...
3 篇 school of machin...
3 篇 swoop cambridge ...
3 篇 ostfold univ col...
3 篇 sri internationa...
3 篇 school of comput...
3 篇 hamilton coll cl...
3 篇 lockheed palo al...
3 篇 research institu...
3 篇 ibm research lab...
3 篇 sivas cumhuriyet...
3 篇 production model...
3 篇 department of el...

作者

11 篇 k. ikeuchi
7 篇 olsson roland
6 篇 h. mizutani
6 篇 arslan sibel
5 篇 akira hara
5 篇 arpaia pasquale
5 篇 c. ramos
5 篇 t. suehiro
5 篇 t. matsudaira
5 篇 j. rocha
5 篇 tetsuyuki takaha...
4 篇 katagiri takahir...
4 篇 helmuth thomas
4 篇 t. thomasma
4 篇 ikeuchi k
4 篇 pantridge edward
4 篇 jun-ichi kushida
4 篇 c.e. moron
4 篇 spector lee
4 篇 t.l. marzetta

语言

1,455 篇 英文
59 篇 其他
3 篇 中文
2 篇 日文
1 篇 法文

检索条件"主题词=Automatic Programming"

共 1519 条记录，以下是1351-1360 订阅

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

详细简洁

排序：

Automated composition of Petri net models for cellular structures

Automated composition of Petri net models for cellular struc...

引用

IEEE Ukraine Conference on Electrical and Computer Engineering (UKRCON)

作者： T. R. Shmeleva A.S. Popov Odessa National Academy of Telecommunications Odessa Ukraine

Cellular networks are significant challenges for high performance data-intensive system designers due to their complexity. Being able to study features and designs before building the actual system is an advantage that a simulation model can offer. This paper presents a Petri net models program generator of communication hexagonal grids of arbitrary size for verification of telecommunication systems protocols with a hexagonal cell. Petri nets parametric description is used for automated composition of cellular grid models. The model, basic parameters are: the cellular grid size, the buffer capacity of the communication device, the number of packets in each device buffer. The basic element of the grid consists of internal buffer with the limited size and six ports, which operate in full duplex mode; the destination ports are chosen in nondeterministic way in the model. A program generator of Petri net models is written in the algorithmic language C. The output format type of generated file is represented as a Tina modeling system graphical format. The technique can be used in a wide range of Petri nets applications, including telecommunications, manufacturing systems and programming.

关键词： Ports (Computers) 1/f noise Petri nets Computational modeling Indexes automatic programming Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Implementing standard and nonstandard parallel cellular automata in CARPET

Implementing standard and nonstandard parallel cellular auto...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： D. Talia ISI-CNR Rende Italy

ISBN: (纸本)0769509878

Cellular automata is a nature inspired parallel processing model. It has been proposed several years ago by J. Von Neumann to simulate complex dynamical processes. In the past two decades several models of cellular automata that differ from the original one proposed by Von Neumann have been defined for modeling real-world systems and phenomena. This paper describes the design and implementation of standard and nonstandard parallel cellular automata in the CARPET language. CARPET is a cellular automata based language that has been implemented on MIMD parallel computers. The language is specifically designed for programming cellular computations supporting concise and efficient coding of parallel cellular algorithms. The paper analyzes the main features of the language and describes as they can be exploited to implement different cellular automata on parallel computers, starting from the standard model to its modifications and generalizations. Inhomogeneous, partitioned, asynchronous, and probabilistic cellular automata programmed in CARPET are presented.

关键词： Concurrent computing Lattices Computational modeling Automata automatic programming Parallel processing Algorithm design and analysis Parallel programming Partitioning algorithms Physics computing

来源：评论

学校读者我要写书评

暂无评论

Co-evolving automata negotiate with a variety of opponents

Co-evolving automata negotiate with a variety of opponents

引用

Congress on Evolutionary Computation

作者： D.D.B. van Bragt J.A. La Poutre Centre for Mathematics and Computer Science CWI Amsterdam Netherlands

Real-life negotiations typically involve multiple parties with (i) different preferences for the different issues and (ii) bargaining strategies which change over time. Such a dynamic environment (with imperfect information) is addressed in this paper with a multi-population evolutionary algorithm (EA). Each population represents an evolving collection of bargaining strategies in our setup. The bargaining strategies are represented by a special kind of finite automata, which require only two transitions per state. We show that such automata (with a limited complexity) are a suitable choice in a computational setting. We furthermore describe an EA which generates highly-efficient bargaining automata in the course of time. A series of computational experiments shows that co-evolving automata are able to discriminate successfully between different opponents, although they receive no explicit information about the identity or preferences of their opponents. These results are important for the further development of evolving automata for real-life (agent system) applications.

关键词： Genetic programming Game theory Learning automata Mathematics Computer science Consumer electronics Standards development Evolutionary computation Multiagent systems automatic programming

来源：评论

学校读者我要写书评

暂无评论

Multiple-goals path planning for coordinate measuring machines

Multiple-goals path planning for coordinate measuring machin...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： S.N. Spitz A.A.G. Requicha Programmable Automation Laboratory University of Southern California

Path planning is a crucial step in automatic programming of coordinate measuring machines(CMMs). The goal is to generate an efficient and collision-free path for the CMM to inspect a collection of points. Previous research concentrates on path planning between two points, or sequencing the points without regard to obstacles and collisions. In this paper we propose a practical path planner that considers both sequencing and collision avoidance. The main idea is to create a roadmap of free-space, where the measurement points are nodes in the network. Once all the measurement points are in a single connected component of the roadmap, then a tour of the points is found by solving the appropriate traveling salesperson problem. CMM heuristics are used to construct the roadmap in an efficient and robust manner. The planner has been implemented and tested on real-world mechanical parts.

关键词： Path planning Coordinate measuring machines Probes Collision avoidance Inspection Automation Laboratories automatic programming Road accidents Robustness

来源：评论

学校读者我要写书评

暂无评论

Preliminary experience with process modeling in the MARVEL software development environment kernel

Preliminary experience with process modeling in the MARVEL s...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： G.E. Kaiser N.S. Barghouti M.H. Sokolsky Department of Computer Science Columbia University NY USA

The authors define a software development environment kernel called MARVEL. Implementing several prototypes and small environments has uncovered some significant flaws and revealed open design problems. Problems connected with the construction and debugging of a process model, with envelope construction, and with support of multiple users are considered. The authors note that they have investigated only a small fraction of the potential for rule-based process modeling and controlled automation. They observe that they do not yet fully understand how rule-based process modeling or controlled automation works and whether the combination is indeed a solid foundation for a software-development environment architecture.< >

关键词： Kernel automatic control Automation Computer languages automatic programming Monitoring Computer science Computer architecture Software prototyping Prototypes

来源：评论

学校读者我要写书评

暂无评论

Towards predicting spatial complexity: a learning classifier system approach to the identification of cellular automata

Towards predicting spatial complexity: a learning classifier...

引用

Congress on Evolutionary Computation

作者： L. Bull I. Lawson A. Adamatzky B. DeLacyCostello Faculty of Computing Engineering and Mathematical Sciences University of West of England Bristol UK Faculty of Applied Sciences University of West of England Bristol UK

This paper presents a novel approach to the programming of automata-based simulation and computation using a machine learning technique. The identification of lattice-based automata for real-world applications is cast as a data mining problem. Our approach to achieving this is to use evolutionary computing and reinforcement learning with performance fed back indicating the predictive accuracy of future behaviour of the given system. The purpose of this work is to develop an approach to identifying automata rules that can achieve good performance using data from a variety of kinds of complex systems

关键词： Learning automata Mathematical model Computational modeling Machine learning Data mining Lattices Concurrent computing Mathematics Differential equations automatic programming

来源：评论

学校读者我要写书评

暂无评论

A correct and complete algorithm for the generation of mechanical assembly sequences

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： L.S. Homem de Mello A.C. Sanderson The Robotics Institute Carnegie Mellon University Pittsburgh PA USA Electrical Computer and Systems Engineering Department Rensselaer Polytechnic Institute Troy NY USA

ISBN: (纸本)0818619384

The authors present an algorithm for the generation of mechanical assembly sequences and a proof of its correctness and completeness. The algorithm uses a relational model which describes the geometry of the assembly and the attachments that bind one part to another. The problem of generating the assembly sequences is transformed into the problem of generating disassembly sequences, in which the disassembly tasks are the reverse of feasible assembly tasks. This transformation leads to a decomposition approach in which the problem of disassembling one assembly is decomposed into distinct subproblems, each involving the disassembly of one subassembly. It is assumed that at each assembly task exactly two subassemblies are mated and that all contacts between the parts in the two subassemblies are established. The algorithm yields an AND/OR graph representation of assembly sequences. The correctness of the algorithm is based on the assumption that it is always possible to decide correctly whether two subassemblies can be joined based on geometrical and physical criteria. An approach to compute this decision is given, and bounds for the amount of computation required are presented.< >

关键词： Robotic assembly Assembly systems Solid modeling Computational geometry Design engineering automatic programming Concurrent engineering Design automation Process planning

来源：评论

学校读者我要写书评

暂无评论

Using configuration and force sensing in assembly task planning and execution

Using configuration and force sensing in assembly task plann...

引用

IEEE International Symposium on Assembly and Manufacturing (ISAM)

作者： R. Suarez L. Basanez J. Rosell Instituto de Cibernética UPC-CSIC Barcelona Spain

A geometric trajectory ensuring the success of an assembly task cannot be determined when the geometric uncertainty is significant. Several solutions like, for instance, passive compliance devices have been applied in order to decrease the influence of geometric uncertainty. However, the general solution appears to be the use of active compliance which implies reaction force/torque feedback, but this use gives rise to some particular problems in the task planning and execution. Sensorial configuration and force information becomes a key point in this field. This paper describes how this sensor information can be used in an assembly fine-motion planner and also during the task execution. The basic concepts have already been implemented and the peg-into-hole assembly task serves as an example to illustrate the results.

关键词： Robotic assembly Uncertainty Torque Force feedback Robotics and automation Force sensors Robot sensing systems automatic programming Robot programming Government

来源：评论

学校读者我要写书评

暂无评论

Turning eureka steps into calculations in automatic program synthesis

Turning eureka steps into calculations in automatic program ...

引用

UK IT 1990 Conference

作者： A. Bundy A. Smaill J. Hesketh University of Edinburgh UK

A description is given of a technique called middle-out reasoning for the control of search in automatic theorem proving. The authors illustrate it use in the domain of automatic program synthesis. Programs can be synthesised from proofs that their logical specifications are satisfiable. Each proof step is also a program construction step. Unfortunately, a naive use of this technique requires a human or computer to produce proof steps which provide the essential structure of the desired program. It is hard to see the justification for these steps at the time that they are made; the reason for them emerges only later in the proof. Such proof steps are often call eureka steps. Middle-out reasoning enables these eureka steps to be produced, automatically, as a side effect of non-eureka steps.< >

关键词： automatic programming Software requirements and specifications Theorem proving

来源：评论

学校读者我要写书评

暂无评论

Robot tasks sequence planning using Petri nets

Robot tasks sequence planning using Petri nets

引用

IEEE International Symposium on Assembly and Manufacturing (ISAM)

作者： J. Rosell N. Munoz A. Gambin Institute de Organización y Control de Sistemas Industriales (IOC-UPC) Barcelona Spain Institut d'Organització i Control de Sistemes Industrials Barcelona SPAIN Barcelona SPAIN

The automatic programming of robots to assemble products must cope with assembly planning and task planning problems. These problems are not independent, since an assembly operation may be performed by a different robot task depending on the previous assembly operations performed. Therefore, the cost of assembly operations vary depending on the assembly sequence. This paper deals with the problem of finding the optimum sequence of robot tasks taking into account this variable cost of assembly operations. The proposed approach can cope with products with AND/OR/XOR relations and uses Petri nets as a modelling methodology. The search of a near-optimum sequence of robot tasks is done with an heuristic search of the reachability tree of the Petri net.

关键词： Petri nets Robotic assembly Service robots Robotics and automation Orbital robotics automatic control Industrial control automatic programming Cost function Assembly systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共152页 << < 132 133 134 135 136 137 138 139 140 141 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：