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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是881-890 订阅

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

详细简洁

排序：

the Selection and Development of High-efficiency Jerusalem Artichoke

The Selection and Development of High-efficiency Jerusalem A...

引用

7th international conference on Advanced Materials and Computer Science (ICAMCS)

作者： Xue Zhizhong Yang Yahua Wu Zhe Wang Xiuping Jiang Jianmei Xu Tingting Hebei Acad Agr & Forestry Sci Inst Coastal Agr Shijiazhuang 063200 Hebei Peoples R China Tangshan Topo Biotechnol Co Ltd Tangshan 063020 Hebei Peoples R China

ISBN: (纸本)9781989348062

this paper analyzes the sugar components of different Jerusalem artichoke (Helianthus tuberosus L.) tubers and their leaves. the results showed that the total sugar content of Jerusalem artichoke tuber accounted for more than 70% of dry weight. the content of inulin reached 77.5% on average, and the highest is "Binyu no. 1" tuber. the content of inulin in the stem leaf was more than 11.73%, reaching an average of 12.93%. And the effect of inulin was then tested by functional test on constipation model mice. ICR male mice were randomly divided into blank control group, model control group, positive control group, low dose inulin group, medium dose inulin group and high dose inulin group. After 7 or 15 days of continuous inulin infusion, we observe the small intestine movement, initial stool time and amount of black stool. the results showed that inulin had a significant effect on constipation in mice. Finally, we analyse 27 varieties of Jerusalem artichoke by experiments, and select 6 varieties with high efficacy.

关键词： Jerusalem artichoke Variety screening Relaxing bowel

来源：评论

学校读者我要写书评

暂无评论

Memory Based Hybrid Dragonfly Algorithm (MHDA): a New Technique for Determining Model Parameter in Vertical Electrical Sounding (VES) Data 7

Memory Based Hybrid Dragonfly Algorithm (MHDA): a New Techni...

引用

7th Biannual international conference on Mathematics and Natural Sciences (ICMNS)

作者： Ramadhani, I. Minarto, E. Sungkono Inst Teknol Sepuluh Nopember Dept Phys Kampus ITS Sukolilo Surabaya 60111 Indonesia

Vertical Electrical Sounding (VES) data inversion is a nonlinear inversion problem because several models can fit to the observed data. therefore, a new approach based on nonlinear optimization technique is implemented which is called Memory based Hybrid Dragonfly Algorithm (MHDA). It is proposed to solve drawback of Dragonfly Algorithm (DA), i.e. low convergence rate which is caused by high exploration behaviour of DA. the drawback can lead to the local optimum solutions. MHDA successfully balances exploration and exploitation behaviours of DA to obtain global optimum solution. In this research, initially, MHDA is tested for the noise contaminated synthetic VES data to assess its performance. Subsequently, MHDA is applied for the field VES data. In both results, MHDA is able to provide Posterior Distribution Model (PDM) which is obtained from exploration process. All accepted models of PDM have lower misfit value than specified tolerance value in the inversion process. the PDM can be used to estimate solution via median value of PDM. Additionally, the uncertainty estimation of obtained solution can be determined from standard deviation value of PDM. the inversion results of synthetic and field VES data indicate that MHDA is an innovative technique to solve VES data inversion problem.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Resolution of a Routing and Wavelength Assignment Problem by Independent Sets in Conflict Graphs

Resolution of a Routing and Wavelength Assignment Problem by...

引用

international conference on Control, Decision and Information Technologies (CoDIT)

作者： Olivier Hudry Télécom-Paris / LTCI Palaiseau France

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

In an optical network, a Scheduled Lightpath Demand (SLD) is a connection demand between two nodes, during a certain time and with a certain wavelength. We consider the following NP-hard Routing and Wavelength Assignment problem dealing with SLDs: given a set of SLDs and a number W of wavelengths, maximize the number of SLDs to which we can assign a lightpath (i.e. a routing path and a wavelength) without exceeding the number W of available wavelengths. the constraints are: a same wavelength must be assigned all along the routing path of any SLD; at any time, a given wavelength on a given edge of the network cannot be used to satisfy more than one SLD. To solve this problem, we study an approach stating the problem as the successive searches of independent sets in some conflict graphs. Moreover, we improve this approach thanks to a post-optimization method. the experimental results show that this model and the post-optimization method are quite efficient to provide a large number of routed SLDs.

关键词： Superluminescent diodes Routing Linear programming Greedy algorithms Wavelength assignment Optical fibers Information technology

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage ϵ-Constraint Strategy-Based Heuristic for Bi-Objective Quadratic Multiple Knapsack Problems

A Two-Stage ϵ-Constraint Strategy-Based Heuristic for Bi-Ob...

引用

international conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Méziane Aïder Oussama Gacem Mhand Hifi LaROMaD USTHB BP 32 El Alia Alger Algérie EPROAD UPJV 7 rue du Moulin Neuf Amiens France

ISBN: (数字)9781728175591

ISBN: (纸本)9781728175607

In this paper, we propose a two-stage method for solving the Bi-Objective Quadratic Multiple Knapsack Problem (BO-QMKP). the method combines both a special local branching (the first stage) and the ε-constraint (the second stage) strategies, where the local branching tries to intensify the search process while a series of ε-constraints are added to tailor a diversification of the search space. the method is based on solving a series of mono-objective optimization problems: from the current problem, provided by combining the original problem and an ε-constraint (using a single objective function), an optimization phase is applied in order to generate a set of non-dominated solutions. A preliminary experimental part is given, where the performance of the proposed two-stage method is evaluated on a set of benchmark containing large-scale instances. Its provided results are compared to those achieved by one of the best method available in the literature. Encouraging results have been obtained.

关键词： Optimization Search problems Linear programming Benchmark testing MONOS devices Convergence Complexity theory

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Software Process Improvement, CIMPS 2018

7th International Conference on Software Process Improvement...

引用

7th international conference on Software Process Improvement, CIMPS 2018

ISBN: (纸本)9783030011703

the proceedings contain 26 papers. the special focus in this conference is on Software Process Improvement. the topics include: Identifying the orientations of sustainable supply chain research using data mining techniques: Contributions and new developments;a systematic literature review on word embeddings;model for the improvement of knowledge management processes based on the use of gamification principles in companies in the software sector;intelligent mathematical modelling agent for supporting decision-making at industry 4.0;MBT4J: Automating the model-based testing process for java applications;Identification of UIDPs for developing medical apps;conceptual modelling of a mobile app for occupational safety using process and objectives patterns;pulAm: An app for monitoring crops;a computational measure of saliency of the texture based a saliency map by color;Methodologies, methods, techniques and tools used on SLR elaboration: A mapping study;automating an image processing chain of the sentinel-2 satellite;automated configuration of monitoring systems in an immutable infrastructure;using convolutional neural networks to recognition of dolphin images;a smart city’s model secured by blockchain;framework for the analysis of smart cities models;performance analysis of monolithic and micro service architectures – containers technology;a proposal for an electronic negotiation platform for tourism in low-density regions: Characterizing a functional analysis and prototype for the douro valley;from craftsmen into engineers during undergraduate education;gamification for improving software project management processes: A systematic literature review;information technology service management processes for very small organization: A proposed model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementation of threshold Comparator Using Cartesian Genetic programming on Embryonic Fabric 1

引用

9th international conference on Innovations in Bio- Inspired Computing and Applications (IBICA) / 7th World Congress on Information and Communication Technologies (WICT)

作者： Malhotra, Gayatri Lekshmi, V Sudhakar, S. Udupa, S. UR Rao Satellite Ctr Bangalore Karnataka India

ISBN: (数字)9783030166816

ISBN: (纸本)9783030166816;9783030166809

Recent research in the area of evolvable design clearly indicates its advantage in the electronics system domain. this biologically inspired approach for design automation and reconfiguration is required for the hardware that needs online adaptation. the Cartesian Genetic programming (CGP) represents a circuit genotype in the form of grid of nodes. In satellite for safe mode detection, a threshold comparator circuit is used. the comparator circuit can be evolved using CGP architecture by evolutionary algorithm. An evolutionary algorithm (EA) is designed and applied on the CGP pattern of comparator. the evolved comparator in the cascaded form can be further implemented on embryonic fabric. the embryonic fabric has cellular structure that makes it suitable for self-healing and self-replication. the CGP approach to generate configuration data for embryonic array is better than the LUT based data generation approach. In this paper a 2-bit comparator is evolved using customized evolutionary algorithm. the implementation of cascaded 8-bit threshold comparator on the embryonic array is also demonstrated. this comparator design needs configuration data for 2-bit and the data can be cloned to next cells for scalable design on embryonic fabric.

关键词： CGP Evolutionary algorithm Comparator Evolvable hardware Embryonics

来源：评论

学校读者我要写书评

暂无评论

Statistical optical image analysis for information system 7

Statistical optical image analysis for information system

引用

7th international conference on Future Internet of things and Cloud Workshops, FiCloudW 2019

作者： Ryazantsev, Oleksandr Khoroshun, Ganna Riazantsev, Andrii Ivanov, Vitalii Baturin, Aleksandr Volodymyr Dahl East Ukrainian National University Faculty of Information Technology and Electronics Severodonetsk Ukraine Dept. of Programming and Mathematics Volodymyr Dahl East Ukrainian National University Severodonetsk Ukraine

ISBN: (纸本)9781728144115

Optical image processing methods are important for creation and development of an automated measuring information optical system. Statistical methods provide additional information, a better understanding of the object that is being studied. they allow describing main features of the image by several parameters, such as mean value, median and standard deviation. For correlation of the computer simulation and experimental data the method of signal quantization is described. It is defined the parameters of the fitted normal distribution for the optical image variation curve and consent criteria of empirical and theoretical data by Romanovsky method. Obtained results can be used as the preliminary analysis for digital processing of the optical image with application in compression and encryption, holography, identification and tracking. © 2019 IEEE.

关键词： Optical systems

来源：评论

学校读者我要写书评

暂无评论

Verification of Applicability of MOEAs to Many-Objective GP Problem

Verification of Applicability of MOEAs to Many-Objective GP ...

引用

international conference on Control, Decision and Information Technologies (CoDIT)

作者： Makoto Ohki Tottori Univeristy Tottori Japan

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

In this paper, an trial application on Multi-Objective Evolutionary Algorithms (MOEAs) to a Many-Objective Genetic programming (MaOGP) Problem and their effectiveness verification. In several works, Multi-Objective GP (MOGP) using MOEAs is effective on such a function estimation problem for the cutting process of steel, a modeling of a non-linear systems and a truss optimization. However, their targets are two or three objective GP problems. there is not many researches on GP problems with more than four objectives, or MaOGP. Recent studies have reported that MOEAs are inappropriate for Many-Objecitve Optimization Problems (MaOPs), which includes four or more objectives. Although MOEA/D and NSGA-III, which are one of MaOEA, are known as effective algorithms for MaOPs, these algorithms, for example, require an many scalarization vectors or appropriate reference set to obtain a Pareto front that is widely and evenly distributed, they are not always easy to apply to real world problems. the MaOEAs are actually very sensitive techniques to the vectors or the reference set in the real problems. On the other hand, although it has been pointed out that MOEAs are not suitable for MaOP in verification reports with several benchmarks, there is no fact that MOEAs have been applied to MaOGP problems and their effectiveness has been denied. therefore, this paper tries to apply MOEAs, NSGA-II and SPEA2, to a test MaOGP problem and verify their effectiveness. Since we can easily change the difficulty and/or also parameters such as the number of objectives of the test problem, it is also expected to contribute to MaOGP research in the future.

关键词： Optimization Linear programming Sorting Information technology Indexes Statistics Sociology

来源：评论

学校读者我要写书评

暂无评论

7th international Working conference on Human-Centered Software Engineering, HCSE 2018

7th International Working Conference on Human-Centered Softw...

引用

7th international Working conference on Human-Centered Software Engineering, HCSE 2018

ISBN: (纸本)9783030059088

the proceedings contain 23 papers. the special focus in this conference is on Human-Centered Software Engineering. the topics include: A visual tool for analysing IoT trigger/action programming;software support for coherent prototyping of 3D gesture interactions;towards tool-support for robot-assisted product creation in fab labs;usability evaluation of model-driven cross-device web user interfaces;absolute indirect touch interaction: Impact of haptic marks and animated visual feedback on usability and user experience;factors affecting the choice of usability evaluation methods for interactive adaptive systems;towards a model to address the interplay between IoT applications and users in complex heterogeneous contexts;user evaluations of virtually experiencing mount everest;early incremental user testing design approach validation for satellite command center’s application;Get realistic! - UCD course design and evaluation;graphical user interface redefinition addressing users’ diversity;Integrating HCD into BizDevOps by using the subject-oriented approach;Intuitive user-centered interaction design for ATV;trade-Off between system effectiveness and context constraints in the design of an iot system giving access to health care in African rural villages;helping teams to help themselves: An industrial case study on interdependencies during sprints;participatory ideation for gamification: Bringing the user at the heart of the gamification design process;a method for optimizing complex graphical interfaces for fast and correct perception of system states;data-driven usability test scenario creation;MIODMIT: A generic architecture for dynamic multimodal interactive systems;adding measures to task models for usability inspection of the cloud access control services.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the share Operator for Field-Based Coordination 21st

The share Operator for Field-Based Coordination

引用

21st IFIP WG 6.1 international conference on Coordination Models and Languages (COORDINATION,) Held as Part of the 14th international Federated conference on Distributed Computing Techniques (DisCoTec)

作者： Audrito, Giorgio Beal, Jacob Damiani, Ferruccio Pianini, Danilo Viroli, Mirko Univ Torino Dipartimento Informat Turin Italy Raytheon BBN Technol Cambridge MA USA Alma Mater Studiorum Univ Bologna Cesena Italy

ISBN: (纸本)9783030223977;9783030223960

Recent work in the area of coordination models and collective adaptive systems promotes a view of distributed computations as functions manipulating computational fields (data structures spread over space and evolving over time), and introduces the field calculus as a formal foundation for field computations. With the field calculus, evolution (time) and neighbor interaction (space) are handled by separate functional operators: however, this intrinsically limits the speed of information propagation that can be achieved by their combined use. In this paper, we propose a new field-based coordination operator called share, which captures the space-time nature of field computations in a single operator that declaratively achieves: (i) observation of neighbors' values;(ii) reduction to a single local value;and (iii) update and converse sharing to neighbors of a local variable. In addition to conceptual economy, use of the share operator also allows many prior field calculus algorithms to be greatly accelerated, which we validate empirically with simulations of a number of frequently used network propagation and collection algorithms.

关键词： Aggregate programming Computational field Information propagation speed Spatial computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共361页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：