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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,394 篇 会议
133 篇 期刊文献
76 册 图书

馆藏范围

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

日期分布

学科分类号

2,401 篇 工学
- 1,896 篇 计算机科学与技术...
- 1,152 篇 软件工程
- 420 篇 电气工程
- 272 篇 控制科学与工程
- 199 篇 信息与通信工程
- 128 篇 机械工程
- 74 篇 石油与天然气工程
- 64 篇 生物医学工程（可授...
- 61 篇 电子科学与技术（可...
- 56 篇 材料科学与工程（可...
- 56 篇 交通运输工程
- 51 篇 生物工程
- 45 篇 化学工程与技术
- 43 篇 动力工程及工程热...
- 38 篇 土木工程
- 37 篇 仪器科学与技术
- 34 篇 冶金工程
675 篇 理学
- 482 篇 数学
- 106 篇 物理学
- 85 篇 系统科学
- 80 篇 统计学（可授理学、...
- 74 篇 生物学
- 53 篇 化学
402 篇 管理学
- 337 篇 管理科学与工程(可...
- 148 篇 工商管理
- 81 篇 图书情报与档案管...
105 篇 教育学
- 103 篇 教育学
71 篇 医学
- 46 篇 临床医学
- 35 篇 基础医学(可授医学...
64 篇 经济学
- 64 篇 应用经济学
40 篇 法学
22 篇 文学
12 篇 农学
9 篇 艺术学
3 篇 军事学

主题

309 篇 linear programmi...
251 篇 programming
187 篇 dynamic programm...
142 篇 computer program...
118 篇 integer programm...
116 篇 optimization
109 篇 logic programmin...
87 篇 genetic programm...
82 篇 functional progr...
73 篇 computational mo...
68 篇 object oriented ...
66 篇 programming prof...
65 篇 parallel program...
56 篇 software enginee...
54 篇 costs
49 篇 mathematical mod...
48 篇 computer program...
46 篇 heuristic algori...
42 篇 artificial intel...
41 篇 computer science

机构

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,496 篇 英文
79 篇 其他
26 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

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

共 3603 条记录，以下是1321-1330 订阅

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

详细简洁

排序：

Automatic parallel programming using the descartes specification language

Automatic parallel programming using the descartes specifica...

引用

international conference on Information and Communication Systems (ICICS)

作者： Nina Sakhnini Venkata N. Inukollu Joseph E. Urban Computer Engineering Jordan Uni. of Science and Tech Irbid Jordan School of Science and Computer University of Houston Clear Lake TX USA Arizona State University Tempe AZ USA

ISBN: (纸本)9781467386159

Automatic programming can be defined as developing software in a high abstraction level. the definition of automatic programming is not precise because what is meant by automatic programming is changing over time. the goal of automatic programming has the programmer set the specifications of a program and the computer generate the source code of that program. there exists a group of specification languages that vary in their properties; the Descartes specification language is known to be comprehensible and easily constructible. Descartes represents the specifications by defining a system's inputs and outputs, as well as the relationship between these as functions. Descartes has been extended to support concurrent systems. these features made Descartes to be a good basis to build this research effort on. this research effort studied automatic programming approaches and created a shortcut between specifications and implementation with all its benefits. this research created a way to transform Descartes specifications into C source code automatically. Automatic programming can apply to all fields of knowledge that can be automated; therefore, the scope of this research project was restricted to a few case studies that involve parallel programming.

关键词： Automatic programming Specification languages Parallel programming Software Computers Communication systems

来源：评论

学校读者我要写书评

暂无评论

How to Avoid Proving the Absence of Integer Overflows 7th

How to Avoid Proving the Absence of Integer Overflows

引用

7th international conference on Verified Software - theories, Tool and Experiments (VSTTE)

作者： Clochard, Martin Filliatre, Jean-Christophe Paskevich, Andrei Univ Paris 11 CNRS Rech Informat Lab F-91405 Orsay France INRIA Saclay Ile De France F-91893 Orsay France

ISBN: (纸本)9783319296135;9783319296128

When proving safety of programs, we must show, in particular, the absence of integer overflows. Unfortunately, there are lots of situations where performing such a proof is extremely difficult, because the appropriate restrictions on function arguments are invasive and may be hard to infer. Yet, in certain cases, we can relax the desired property and only require the absence of overflow during the first n steps of execution, n being large enough for all practical purposes. It turns out that this relaxed property can be easily ensured for large classes of algorithms, so that only a minimal amount of proof is needed, if at all. the idea is to restrict the set of allowed arithmetic operations on the integer values in question, imposing a "speed limit" on their growth. For example, if we repeatedly increment a 64-bit integer, starting from zero, then we will need at least 2 64 steps to reach an overflow;on current hardware, this takes several hundred years. When we do not expect any single execution of our program to run that long, we have effectively proved its safety against overflows of all variables with controlled growth speed. In this paper, we give a formal explanation of this approach, prove its soundness, and show how it is implemented in the context of deductive verification.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Software readability practices and the importance of their teaching

Software readability practices and the importance of their t...

引用

international conference on Information and Communication Systems (ICICS)

作者： Isabel Braga Sampaio Luís Barbosa Institute of Engineering of Porto Polytechnic Institute of Porto Porto Portugal School of Science and Technology University of Trás-os-Montes and Alto Douro Vila Real Portugal

It is known that code readability has an impact on software quality. this paper introduces a preliminary list of 33 good practices for code readability that could be taught in object oriented programming courses of informatics programs. In this set are included practices with both positive and negative impact, the latter mainly from bad smells. A survey was made with OOP teachers in order to assess the significance of teaching a set of good practices. the results showed that teachers consider it important to teach the defined set. Such result was statistically significant. Still, the same level of significance was not awarded to all practices. Some additional results are presented.

关键词： Education Informatics Software Bibliographies Instruments Electronic mail Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Hybrid single node genetic programming for symbolic regression 7

Hybrid single node genetic programming for symbolic regressi...

引用

7th international Joint conference on Computational Intelligence, IJCCI 2015

作者： Kubalìk, Jiřì Alibekov, Eduard Žegklitz, Jan Babuška, Robert Czech Institute of Informatics Robotics and Cybernetics CTU in Prague Prague Czech Republic Department of Cybernetics Faculty of Electrical Engineering CTU in Prague Prague Czech Republic Delft Center for Systems and Control Delft University of Technology Delft Netherlands

ISBN: (纸本)9783662535240

this paper presents a first step of our research on designing an effective and efficient GP-based method for symbolic regression. First, we propose three extensions of the standard Single Node GP, namely (1) a selection strategy for choosing nodes to be mutated based on depth and performance of the nodes, (2) operators for placing a compact version of the best-performing graph to the beginning and to the end of the population, respectively, and (3) a local search strategy with multiple mutations applied in each iteration. All the proposed modifications have been experimentally evaluated on five symbolic regression benchmarks and compared with standard GP and SNGP. the achieved results are promising showing the potential of the proposed modifications to improve the performance of the SNGP algorithm. We then propose two variants of hybrid SNGP utilizing a linear regression technique, LASSO, to improve its performance. the proposed algorithms have been compared to the state-of-the-art symbolic regression methods that also make use of the linear regression techniques on four real-world benchmarks. the results show the hybrid SNGP algorithms are at least competitive with or better than the compared methods. © Springer-Verlag Berlin Heidelberg 2016.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Research progress of engineering structural optimization in aerospace field

Research progress of engineering structural optimization in ...

引用

international conference on Mechanical and Aerospace Engineering (ICMAE)

作者： Lei Liu Aijun Ma Hongying Liu Xuemei Feng Meng Shi Rui Dong Yaxiong Zhao Spacecraft Environment Simulation Laboratory China Astronaut Research and Training Center Beijing China

ISBN: (纸本)9781467388306

Recently optimal design for engineering structures is being a research hotspot, and the core technology is structural optimization technology, which is being used in more and more fields. In this paper, its research progress was reviewed which was consists of research condition and prospect in future. Firstly, the fundamental concept of structural optimization was introduced, and then structural optimization levels such as size optimization, shape optimization, and topology optimization and its application in aerospace field were presented. Afterwards, optimization algorithms like optimality criteria methods, mathematical programming methods, and genetic algorithms were reviewed, and finally, probable research directions of structural optimization technology in the future were prospected.

关键词： Topology Shape Algorithm design and analysis Genetic algorithms Mathematical programming Aerospace engineering

来源：评论

学校读者我要写书评

暂无评论

Interest management through policy programming language

Interest management through policy programming language

引用

international conference on Computer Science and Information Technology (CSIT)

作者： Suzana Ahmad Siti Z.Z. Abidin Nasiroh Omar Universiti Teknologi MARA Shah Alam Selangor MY

ISBN: (纸本)9781467389150

Managing interest in collaborative data sharing involves determining interest of both owner and other parties. Interest management method is bound to information such as user request, location, history, preferences and data policies. Considering other researchers' works, managing data interest of sharing for its' constitutional adhered policy are rarely done in computerize manner. With attention that data shared are constituted with policy implicitly or explicitly, this paper proposes an automatic design of data policy via policy programming language in order to handle interest management. the study starts by analyzing secondary data through massive literature reviews. Two pertinent issues on interest management and data policy are explored, analyzed and summarized. Based on the research gap found in these analyses, an interest management for automated data policy is designed. As a case study, a new set of programming constructs are implemented and embedded into an existing collaborative language called JACIE (Java-based Authoring language for Collaborative Interactive Environments) that acts as a policy programming language. the results of this study conform that automated data policy is feasible and functioning well. thus, this helps an interest manager to have flexible data policy in handling collaborative activities.

关键词： Collaboration Computer languages programming History Adaptation models Information technology

来源：评论

学校读者我要写书评

暂无评论

Optimization of vessel and quay crane emissions during the hoteling phase

Optimization of vessel and quay crane emissions during the h...

引用

international conference on Information, Intelligence, Systems and Applications (IISA)

作者： Abel Meza Talavera Jose Gerardo Gonzalez Barron Caio Martin Tessari Campo Passamani Engineering Systems and Management Masdar Institute of Science and Technology Abu Dhabi UAE

ISBN: (纸本)9781509034307

Since maritime transportation is the most cost-efficient way to transport goods, it has experienced a significant growth in the last few decades due to global trade and economic development. Consequently, CO 2 emissions accounting for this sector have also risen. the purpose of this paper is to estimate and minimize the amount of CO 2 emissions generated while a vessel is in the hoteling phase, both from the perspective of the vessel and the cranes servicing it, while providing an insight into the share of emissions from both sources and the potential solutions to reduce them. A Mixed Integer programming model was formulated using General Algebraic Modeling System (GAMS). the results of the study show that the quay crane emissions play a significant role of the total emissions during the hoteling phase, affecting quay crane workload distribution and bay allocation, and they should be taken into account when trying to minimize emissions at the terminal operations.

关键词： Containers Cranes Fuels Minimization Optimization Linear programming Pollution

来源：评论

学校读者我要写书评

暂无评论

Combination of a dynamic-hybrid berth allocation problem with a quay crane scheduling problem

Combination of a dynamic-hybrid berth allocation problem wit...

引用

international conference on Information, Intelligence, Systems and Applications (IISA)

作者： Bushra Alnaqbi Hanan Alrubaiai Shaikha Al Alawi Engineering Systems and Management Masdar Institute of Science and Technology Abu Dhabi UAE

ISBN: (纸本)9781509034307

Recently due to the increasing pressure to improve the efficiency of port operations, a great deal of research has been devoted to optimizing container terminal operations. Most papers deal with either the berth allocation problem or the crane scheduling problem. However only a limited number of papers deal with both, berth allocation and crane scheduling through either a combined model of the two problems, or two models with nested loops of each problem feeding into each other. In this paper, however, a mixed integer programming model is proposed for the integrated berth allocation and quay crane scheduling. Numerical experiments are conducted to test the performance of the proposed approach, using commercial software. the results illustrate that predefining both the berth allocation and crane scheduling before the vessel is processed results in improved time optimization.

关键词： Cranes Resource management Scheduling Containers Schedules Linear programming Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

15th international conference on Cryptology and Network Security, CANS 2016

15th International Conference on Cryptology and Network Secu...

引用

7th Chinese conference on Pattern Recognition, CCPR 2016

ISBN: (纸本)9789811030048

the proceedings contain 56 papers. the special focus in this conference is on Cryptanalysis of Symmetric Key, SideChannel Attacks, Implementation, Lattice-Based Cryptography, Virtual Private Network, Signatures, Hash, MultiParty Computation, Symmetric Cryptography, Authentication, System Security, Homomorphic Encryption, Network Security, Privacy, and Authentication. the topics include: Linear regression attack with f-test: a new SCARE technique for secret block ciphers;compact representation for division property;an automatic cryptanalysis of transposition ciphers using compression;diversity within the rijndael design principles for resistance to differential power analysis;server-aided revocable identity-based encryption from lattices;implementation state of HSTS and HPKP in both browsers and servers;group signature with deniability;how to disavow a signature;secure error-tolerant graph matching protocols;verifiable message-locked encryption;security of online AE Schemes in RUP setting;AAL and static conflict detection in policy;generic access control system for ad hoc MCC and fog computing;FHE over the integers and modular arithmetic circuits;efficient and secure multiparty computations using a standard deck of playing cards;improved attacks on extended generalized feistel networks;on the power of public-key function-private functional encryption;an efficient construction of non-interactive secure multiparty computation;implementation of verified set operation protocols based on bilinear accumulators;integral privacy;user authentication from mouse movement data using SVM classifier;language-based hypervisors and network flooding as a side channel in cloud environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using GPUs to speed-up Levenshtein edit distance computation

Using GPUs to speed-up Levenshtein edit distance computation

引用

international conference on Information and Communication Systems (ICICS)

作者： Khaled Balhaf Mohammed A. Shehab Wala'a T. Al-Sarayrah Mahmoud Al-Ayyoub Mohammed Al-Saleh Yaser Jararweh Jordan University of Science and Technology Irbid Jordan

ISBN: (纸本)9781467386159

Sequence comparison problems such as sequence alignment and approximate string matching are part of the fundamental problems in many fields such as natural language processing, data mining and bioinformatics. However, the algorithms proposed to address these problems suffer from high computational complexities prohibiting them from being widely used in practical large-scale settings. Many researchers used parallel programming to reduce the execution time of these algorithms. In this paper, we follow this approach and use the parallelism capabilities of the Graphics Processing Unit (GPU) to accelerate one of the most common algorithms to compute the edit distance between two strings, which is known as the Levenshtein distance. To take full advantage of the large number of cores in a GPU, we employ a diagonal-based tracing technique which results in even greater improvements in terms of the running time. In fact, our CUDA implementation of the Levenshtein algorithm is about 11X faster than the sequential implementation. this is achieved without affecting the accuracy.

关键词： Graphics processing units Central Processing Unit Bioinformatics Acceleration Parallel programming DNA Instruction sets

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共361页 << < 129 130 131 132 133 134 135 136 137 138 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：