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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,396 篇 会议
132 篇 期刊文献
76 册 图书

馆藏范围

3,602 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

2,403 篇 工学
- 1,901 篇 计算机科学与技术...
- 1,151 篇 软件工程
- 419 篇 电气工程
- 270 篇 控制科学与工程
- 199 篇 信息与通信工程
- 128 篇 机械工程
- 72 篇 石油与天然气工程
- 64 篇 生物医学工程（可授...
- 59 篇 电子科学与技术（可...
- 56 篇 交通运输工程
- 55 篇 材料科学与工程（可...
- 51 篇 生物工程
- 45 篇 化学工程与技术
- 41 篇 动力工程及工程热...
- 38 篇 土木工程
- 35 篇 仪器科学与技术
- 34 篇 冶金工程
674 篇 理学
- 485 篇 数学
- 104 篇 物理学
- 85 篇 系统科学
- 80 篇 统计学（可授理学、...
- 74 篇 生物学
- 50 篇 化学
404 篇 管理学
- 339 篇 管理科学与工程(可...
- 149 篇 工商管理
- 81 篇 图书情报与档案管...
105 篇 教育学
- 102 篇 教育学
71 篇 医学
- 46 篇 临床医学
- 36 篇 基础医学(可授医学...
64 篇 经济学
- 64 篇 应用经济学
40 篇 法学
22 篇 文学
12 篇 农学
9 篇 艺术学
3 篇 军事学

主题

309 篇 linear programmi...
251 篇 programming
185 篇 dynamic programm...
142 篇 computer program...
119 篇 integer programm...
116 篇 optimization
109 篇 logic programmin...
87 篇 genetic programm...
83 篇 functional progr...
73 篇 computational mo...
68 篇 object oriented ...
66 篇 programming prof...
64 篇 parallel program...
56 篇 software enginee...
54 篇 costs
51 篇 mathematical mod...
48 篇 computer program...
47 篇 heuristic algori...
42 篇 quadratic progra...
42 篇 artificial intel...

机构

9 篇 univ london impe...
7 篇 inesc tec porto
6 篇 feup porto
6 篇 russian acad sci...
5 篇 c mast ubi covil...
4 篇 univ leicester l...
4 篇 vienna univ tech...
4 篇 institute of fun...
4 篇 chinese acad sci...
4 篇 university of am...
4 篇 univ nottingham ...
4 篇 beijing universi...
3 篇 weizmann inst sc...
3 篇 univ nottingham ...
3 篇 delft center for...
3 篇 international is...
3 篇 international bu...
3 篇 department of co...
3 篇 school of comput...
3 篇 univ cyprus dept...

作者

8 篇 catalao joao p. ...
7 篇 musirin ismail
5 篇 weiss gera
5 篇 marron assaf
4 篇 hirschfeld rober...
4 篇 ghani n
4 篇 katz guy
4 篇 saraswat vijay
4 篇 xiong rui
4 篇 funabiki nobuo
4 篇 fitiwi desta z.
4 篇 shi yong
4 篇 boercsoek josef
4 篇 jagadeesan radha
4 篇 gupta vineet
4 篇 michael n. young
4 篇 pesant gilles
4 篇 harel david
3 篇 muggleton stephe...
3 篇 faisal a. aldo

语言

3,431 篇 英文
144 篇 其他
28 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

检索条件"任意字段=7th International Conference on Functional Programming"

共 3604 条记录，以下是1591-1600 订阅

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

详细简洁

排序：

Differential Dynamic programming for Multistage Uncertain Optimal Control 7

Differential Dynamic Programming for Multistage Uncertain Op...

引用

7th international Joint conference on Computational Sciences and Optimization (CSO)

作者： Qian, Xiaodong Zhu, Yuanguo Nanjing Univ Sci & Technol Dept Appl Math Nanjing 210094 Jiangsu Peoples R China

ISBN: (纸本)9781479953721

When a multistage system is transferred from one stage to the next one, it could be affected by some disturbance. this kind of system is called a multistage uncertain system if the disturbance is an uncertain factor. Based on the uncertainty theory and the equation of optimality in uncertain optimal control, a differential dynamic programming algorithm for an optimal control problem subject to a multistage uncertain system is established. the differential dynamic programming algorithm is implemented from an initial nominal control, which is provided by the genetic algorithm, to an optimal control of the problem step by step. Finally, a numerical example that the system is nonlinear with the disturbance of linear uncertain variables is given to illustrate the feasibility of the algorithm.

关键词： multistage uncertain system uncertain optimal control differential dynamic programming genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Decentralized Bilevel Optimization for Supplier Selection Problem with Multiple Items under Fuzzy Random Environment 7

Decentralized Bilevel Optimization for Supplier Selection Pr...

引用

7th international Joint conference on Computational Sciences and Optimization (CSO)

作者： Tu, Yan Zhou, Xiaoyang Lev, Benjamin Sichuan Univ Uncertainty Decis Making Lab Chengdu 610065 Peoples R China Shaanxi Normal Univ Int Business Sch Xian 710062 Peoples R China Drexel Univ LeBow Coll Business Decis Sci Dept Philadelphia PA 19104 USA

ISBN: (纸本)9781479953721

the aim of this paper is to consider the supplier selection problem under a hierarchical decision system. With consideration of the inherent uncertainty, An decentralized bilevel optimization model under fuzzy random environment is developed for tracking a supplier selection problem with multiple items. For solving the bi-level programming model, an interactive fuzzy programming technique and an improved particle swarm optimization based on fuzzy random simulation (IPSO based FRS) are designed as a combined solution method. Finally, the results and comparisons analysis of a case study are presented to demonstrate the practicality and efficiency of the optimization method.

关键词： supplier selection decentralized bilevel programming fuzzy random interactive fuzzy programming optimization

来源：评论

学校读者我要写书评

暂无评论

Assigning and scheduling hierarchical task graphs to heterogeneous resources 10

Assigning and scheduling hierarchical task graphs to heterog...

引用

10th international conference on the Practice and theory of Automated Timetabling, PATAT 2014

作者： Alefragis, Panayiotis Gogos, Christos Valouxis, Christos Goulas, George Voros, Nikolaos Housos, Efthymios Technological Educational Institute of Western Greece Dept. of Computer and Informatics Engineering Greece University of Patras-Greece Dept. of Electrical and Computer Engineering Greece Technological Educational Institute of Epirus Dept. of Accounting and Finance Greece

ISBN: (纸本)9780992998400

Task Scheduling is an important problem having many practical applications. More often than not, precedence constraints exist between tasks, and a common way to capture them is through Directed Acyclic Graphs (DAGs). A DAG might contain a great number of tasks representing complex real life scenarios. It might be the case that logical groupings of tasks exist giving a hierarchical nature to the graph. Such Hierarchical Task Graphs (HTGs) have nodes that are further analyzed to DAGs or to other HTGs. In this paper a method of solving an HTG problem is presented based on the idea of gradually solving the problem by replacing subgraphs with virtual nodes. Integer programming is used to generate virtual nodes that replace a subgraph, results from solving the subgraph problem using. So a series of subproblems are solved and starting from the deeper levels of the HTG a solution to the full problem emerges. © PATAT 2014 - Proceedings of the 10th international conference on the Practice and theory of Automated Timetabling. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Software Language Engineering, SLE 2014

7th International Conference on Software Language Engineerin...

引用

7th international conference on Software Language Engineering, SLE 2014

ISBN: (纸本)9783319112442

the proceedings contain 19 papers. the special focus in this conference is on Software Language Engineering. the topics include: Framework for generating domain-specific property languages;a SAT-based debugging tool for state machines and sequence diagrams;towards user-friendly projectional editors;island parsing without shipwrecks;a language composition editor;a framework for developing domain-specific debuggers;evaluating the usability of a visual feature modeling notation;a metamodel family for role-based modeling and programming languages;a choreographic framework for safe adaptive distributed applications;fUML as an assembly language for model transformation;respect your parents: how attribution and rewriting can get along;a disintegrated development environment;model checking of CTL-extended OCL specifications;unifying and generalizing relations in role-based data modeling and navigation;origin tracking in attribute grammars;dynamic scope discovery for model transformations;streamlining control flow graph construction with DCFlow and test-data generation for xtext (tool paper).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Test Suite Optimization for Incremental Product Family Testing

Multi-Objective Test Suite Optimization for Incremental Prod...

引用

7th IEEE international conference on Software Testing, Verification and Validation (ICST)

作者： Baller, Hauke Lity, Sascha Lochau, Malte Schaefer, Ina Tech Univ Carolo Wilhelmina Braunschweig Inst Programming & React Syst D-38106 Braunschweig Germany Tech Univ Darmstadt Time Syst Lab Darmstadt Germany Tech Univ Carolo Wilhelmina Braunschweig Inst Software Engn & Automot Informat D-38106 Braunschweig Germany

ISBN: (纸本)9780769551852

the design of an adequate test suite is usually guided by identifying test requirements which should be satisfied by the selected set of test cases. To reduce testing costs, test suite minimization heuristics aim at eliminating redundancy from existing test suites. However, recent test suite minimization approaches lack (1) to handle test suites commonly derived for families of similar software variants under test, and (2) to incorporate fine-grained information concerning cost/profit goals for test case selection. In this paper, we propose a formal framework to optimize test suites designed for sets of software variants under test w.r.t. multiple conflicting cost/profit objectives. the problem representation is independent of the concrete testing methodology. We apply integer linear programming (ILP) to approximate optimal solutions. We further develop an efficient incremental heuristic for deriving a sequence of representative software variants to be tested for approaching optimal profits under reduced costs. We evaluated the algorithm by comparing its outcome to the optimal solution.

关键词： Testing Strategies Test Coverage of Specifications Constrained Optimization Linear programming

来源：评论

学校读者我要写书评

暂无评论

Auto Gain-Tuning for Trajectory Following Control based on Neural Network 7

Auto Gain-Tuning for Trajectory Following Control based on N...

引用

Joint 7th international conference on Soft Computing and Intelligent Systems (SCIS) and 15th international Symposium on Advanced Intelligent Systems (ISIS)

作者： Otsuka, Akimasa Nagata, Fusaomi Tokyo Univ Sci Dept Mech Engn Yamaguchi 7560884 Japan

ISBN: (纸本)9781479959556

Serial link manipulators have been used for various situations in industry, i.e. welding, assembling, painting, polishing and machining. In machining by the manipulator, material is must be soft such as polystyrene foam because the rigidity of the manipulator is small. Recently, polystyrene form machining by the manipulator is desired to make a lost pattern used in full-mold casting. In the machining operation, a trajectory following control is usually used because the desired trajectory can be generated from a cutter location data. When a manipulator is controlled to cut the polystyrene along the designed shape, various desired trajectories are generated in terms of robot coordinate system. To reduce the positioning error of the manipulator, suitable feedback gains of the controller should be calculated for each trajectory. However, the calculation of the feedback gains consumes much time because it needs to solve a non-convex optimization problem. therefore, faster calculation method of suitable feedback gains for each trajectory is desired. In this study, we propose an auto gain-tuning method of feedback gains using neural network with training. A training set has six training pairs prepared in advance, which consists of displacement of manipulator as input and optimized feedback gains as target. In the preparation, the feedback gains for the each trajectory calculated by the 4-1-4 polynomial interpolation is optimized by using the genetic algorithms. the neural network are trained by updating the synaptic weights with back propagation. After the training, the neural network can output suitable feedback gains for any trajectories. the effectiveness of the proposed method is confirmed through 1,000 times dynamic simulations with randomly generated trajectories.

关键词： backpropagation concave programming feedback genetic algorithms interpolation manipulators neurocontrollers trajectory control 4-1-4 polynomial interpolation assembling auto gain-tuning back propagation dynamic simulations feedback gains full-mold casting machining neural network nonconvex optimization problem painting polishing polystyrene foam positioning error reduction randomly generated trajectories robot coordinate system serial link manipulators synaptic weights trajectory following control welding Genetic algorithms Manipulator dynamics Neural networks Training Trajectory

来源：评论

学校读者我要写书评

暂无评论

Reproducing Field Failures for Programs with Complex Grammar Based Input

Reproducing Field Failures for Programs with Complex Grammar...

引用

7th IEEE international conference on Software Testing, Verification and Validation (ICST)

作者： Kifetew, Fitsum Meshesha Jin, Wei Tiella, Roberto Orso, Alessandro Tonella, Paolo Fdn Bruno Kessler Trento Italy Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9780769551852

To isolate and fix failures that occur in the field, after deployment, developers must be able to reproduce and investigate such failures in-house. In practice, however, bug reports rarely provide enough information to recreate field failures, thus making in-house debugging an arduous task. this task becomes even more challenging for programs whose input must adhere to a formal specification, such as a grammar. To help developers address this issue, we propose an approach for automatically generating inputs that recreate field failures in-house. Given a faulty program and a field failure for this program, our approach exploits the potential of grammar-guided genetic programming to iteratively find legal inputs that can trigger the observed failure using a limited amount of runtime data collected in the field. When applied to 11 failures of 5 real-world programs, our approach was able to reproduce all but one of the failures while imposing a limited amount of overhead.

关键词： failure reproduction Field failures genetic programming search-based software engineering

来源：评论

学校读者我要写书评

暂无评论

On the implementation of weak constraints in WASP (Preliminary report) 7

On the implementation of weak constraints in WASP (Prelimina...

引用

7th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2014 - Affiliated with the international conference on Logic programming, ICLP 2010, part of the Federated Logic conference 2014

作者： Alviano, Mario Dodaro, Carmine Marques-Silva, Joao Ricca, Francesco Department of Mathematics and Computer Science University of Calabria Rende87036 Italy CSI/CASL University College Dublin Ireland

Optimization problems in Answer Set programming (ASP) are usually modeled by means of programs with weak constraints. these programs can be handled by algorithms for solving Maximum Satisfiability (MaxSAT) problems, if properly ported to the ASP framework. this paper reports on the implementation of several of these algorithms in the ASP solver WASP, whose empirical analysis highlights pros and cons of different strategies for computing optimal answer sets. © ASPOCP *** rights reserved.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing secure sets in graphs using answer set programming 7

Computing secure sets in graphs using answer set programming

引用

作者： Abseher, Michael Bliem, Bernhard Charwat, Günther Dusberger, Frederico Woltran, Stefan Institute of Information Systems 184/2 Vienna University of Technology Favoritenstrasse 9–11 Vienna1040 Austria

Problems from the area of graph theory always served as fruitful benchmarks in order to explore the performance of Answer Set programming (ASP) systems. A relatively new branch in graph theory is concerned with so-called secure sets. It is known that verifying whether a set is secure in a graph is already co-NP-hard. the problem of enumerating all secure sets thus is challenging for ASP and its systems. In particular, encodings for this problem seem to require disjunction and also recursive aggregates. In this paper, we provide such encodings and analyze their performance using the Clingo system. © ASPOCP *** rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Negotiation based framework for Attribute-Based Access Control policy evaluation 14

Negotiation based framework for Attribute-Based Access Contr...

引用

7th international conference on Security of Information and Networks, SIN 2014

作者： Caprin, Edward Zhang, Yan Artificial Intelligence Research Group School of Computing Engineering and Mathematics University of Western Sydney Kingswood Australia

ISBN: (纸本)9781450330336

Attribute-Based Access Control (ABAC) maps of characteristics of users, objects and the environment to authorisations. ABAC is a highly versatile access control model well suited to domains such as web services. With the recent set of draft ABAC guidelines by NIST there is a clear desire to promote further adoption of the model. Despite this ABAC continues to face challenges relating to policy evaluation. In this paper we present a novel framework for ABAC policy evaluation based on negotiations and formalised in Answer Set programming. Categories and Subject Descriptors: C.2.0 [Computer-Communication Networks]: General - Security and Protection. D.4.6 [Operating Systems]: Security and protection - Access controls. I.2.3 [Artificial Intelligence]: Deduction and theorem Proving - Logic programming. General Terms: Security. Copyright 2014 ACM 978-1-4503-3033-6/14/09...$15.00.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共361页 << < 156 157 158 159 160 161 162 163 164 165 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：