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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,398 篇 工学
- 1,896 篇 计算机科学与技术...
- 1,152 篇 软件工程
- 418 篇 电气工程
- 269 篇 控制科学与工程
- 199 篇 信息与通信工程
- 127 篇 机械工程
- 72 篇 石油与天然气工程
- 64 篇 生物医学工程（可授...
- 59 篇 电子科学与技术（可...
- 56 篇 材料科学与工程（可...
- 56 篇 交通运输工程
- 51 篇 生物工程
- 44 篇 化学工程与技术
- 40 篇 动力工程及工程热...
- 38 篇 土木工程
- 35 篇 仪器科学与技术
- 34 篇 冶金工程
672 篇 理学
- 482 篇 数学
- 106 篇 物理学
- 85 篇 系统科学
- 80 篇 统计学（可授理学、...
- 73 篇 生物学
- 51 篇 化学
402 篇 管理学
- 337 篇 管理科学与工程(可...
- 148 篇 工商管理
- 81 篇 图书情报与档案管...
105 篇 教育学
- 103 篇 教育学
70 篇 医学
- 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...
86 篇 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. ...
6 篇 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,510 篇 英文
56 篇 其他
26 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

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

共 3594 条记录，以下是3341-3350 订阅

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

详细简洁

排序：

Application of abductive ILP to learning metabolic network inhibition from temporal data

Application of abductive ILP to learning metabolic network i...

引用

13th international conference on Inductive Logic programming

作者： Tamaddoni-Nezhad, Alireza Chaleil, Raphael Kakas, Antonis Muggleton, Stephen Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England Univ London Imperial Coll Sci Technol & Med Dept Biol Sci London SW7 2AZ England Univ Cyprus Dept Comp Sci Nicosia Cyprus

In this paper we use a logic-based representation and a combination of Abduction and Induction to model inhibition in metabolic networks. In general, the integration of abduction and induction is required when the following two conditions hold. Firstly, the given background knowledge is incomplete. Secondly, the problem must require the learning of general rules in the circumstance in which the hypothesis language is disjoint from the observation language. Both these conditions hold in the application considered in this paper. Inhibition is very important from the therapeutic point of view since many substances designed to be used as drugs can have an inhibitory effect on other enzymes. Any system able to predict the inhibitory effect of substances on the metabolic network would therefore be very useful in assessing the potential harmful side-effects of drugs. In modelling the phenomenon of inhibition in metabolic networks, background knowledge is used which describes the network topology and functional classes of inhibitors and enzymes. this background knowledge, which represents the present state of understanding, is incomplete. In order to overcome this incompleteness hypotheses are considered which consist of a mixture of specific inhibitions of enzymes (ground facts) together with general (non-ground) rules which predict classes of enzymes likely to be inhibited by the toxin. the foreground examples are derived from in vivo experiments involving NMR analysis of time-varying metabolite concentrations in rat urine following injections of toxins. the model's performance is evaluated on training and test sets randomly generated from a real metabolic network. It is shown that even in the case where the hypotheses are restricted to be ground, the predictive accuracy increases with the number of training examples and in all cases exceeds the default (majority class). Experimental results also suggest that when sufficient training data is provided, non-ground hypothese

关键词： abductive ILP bioinformatics modelling metabolic networks

来源：评论

学校读者我要写书评

暂无评论

On-policy Approximate Dynamic programming for Optimal Control of non-linear systems

On-policy Approximate Dynamic Programming for Optimal Contro...

引用

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

作者： Shalini K D. Vrushabh K. Shalini Veermata Jijabai Technological Institute Mumbai India

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

Optimal control theory deals with finding the policy that minimizes the discounted infinite horizon quadratic cost function. For finding the optimal control policy, the solution of the Hamilton-Jacobi-Bellman (HJB) equation must be found i.e. the value function which satisfies the Bellman equation. However, the HJB is a partial differential equation that is difficult to solve for a nonlinear system. the paper employs the approximate dynamic programming method to solve the HJB equation for the deterministic nonlinear discrete-time systems in continuous state and action space. the approximate solution of the HJB is found by the policy iteration algorithm which has the framework of actor-critic architecture. the control policy and value function are approximated using function approximators such as neural network represented in the form of linearly independent basis function. the gradient descent optimization algorithm is employed to tune the weights of the actor and critic network. the control algorithm is implemented for cart pole inverted pendulum system, the effectiveness of this approach is provided in simulations.

关键词： Heuristic algorithms Optimal control Mathematical model Approximation algorithms Neural networks Indexes Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Time-Efficient USV Path Planning Based on Weighted Dynamic programming

Time-Efficient USV Path Planning Based on Weighted Dynamic P...

引用

international conference on Artificial Intelligence and Big Data (ICAIBD)

作者： Chaofan Duan Lijuan Wang Hui Wang Xuechun Wang Ye Peng Academy of Information and Communication National University of Defense Technology Wuhan China College of Electrical Engineering Naval University of Engineering Wuhan China

ISBN: (数字)9798350385106

ISBN: (纸本)9798350385113

Unmanned surface vehicle plays an important role in the implementation of ocean tasks based on its autonomous navigation ability, flexibility, cost-efficiency, and strong adaptability. As the core component of the autonomous navigation capability of USV, path planning is an essential guarantee for safe voyage in an unknown ocean environment. In this paper, a time-efficient USV path planning algorithm based on weighted dynamic programming (WDP) is proposed. the proposed algorithm first discrete the continuous area using direction oriented grid structure method, and all the grids are potential path selection candidates. then, considering the ocean environment factors of the target area, the weighted dynamic planning algorithm is proposed for USV path planning, which aims at generating a safe and time-efficient path. At the same time, the virtual potential field method is applied for the need of sudden dangerous situations for obstacles avoidance. the simulation results show that the weighted dynamic programming algorithm is able to generate a time-efficient path and verified the correctness and superiority of the proposed algorithm.

关键词： Sea surface Heuristic algorithms Simulation Force Path planning Dynamic programming Planning

来源：评论

学校读者我要写书评

暂无评论

Development of the investigation scheduling system using mobile phone utilization of the department of nuclear medicine

Development of the investigation scheduling system using mob...

引用

international conference on e-health Networking, Applications and Services (HealthCom)

作者： Byeong-il Lee Jeong Min Ham Ki Soo Park Su-Ho Ok Jong Min Kim Heoug Kook Choi Department of Nuclear Medicine and Institute for Molecular Photonic Imaging Research Chonnam National University Hospital Choongnam South Korea Department of Information and Media Kosin University busan South Korea Department of Information and Computer engineering Inje University Kangnam South Korea

ISBN: (纸本)0780389409

Telemedicine is important technology for the health care. As the development of computer hardware, network environment is developing rapidly. the wireless internet access using mobile phone is natural in modern society. Hospital system is changing to digital environment. So compatible system is required using modern technologies between hospital and patients. In the case of the department of nuclear medicine, patient scheduling is very important work. Injection time, waiting time, and scanning time are different as a kindness of investigation. In this study, we proposed an automatic scheduling system using mobile programming techniques. Messages for reservation confirm, injection time, waiting time and scanning time were sent to patient using proposed system. And patient could check a progress state of patient themselves using mobile phone through internet. Proposed system will be a useful tool for patient scheduling in a department of nuclear medicine.

关键词： Mobile handsets Nuclear medicine Processor scheduling Internet Hospitals Telemedicine Medical services Computer networks Hardware Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Trajectories Synthesis of a Mobile Robots Group Using Cartesian Genetic programming*

Optimal Trajectories Synthesis of a Mobile Robots Group Usin...

引用

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

作者： Askhat Diveev Galina Balandina Federal Research Center "Computer Science and Control" of Russian Academy of Sciences Moscow Russian Federation Peoples Friendship University of Russia (RUDN University) Moscow Russian Federation

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

the paper is devoted to application of Cartesian Genetic programming (CGP) for generating optimal trajectories of a mobile robots group. the problem of a control system synthesis for a mobile robots group is solved. the proposed algorithm uses numerical approach from the class of symbolic regression methods to which Cartesian Genetic programming belonging. It allows to receive a control function in the form of a mathematical expression. We consider several stages to get optimal trajectories for mobile robots group moving along which the robots wouldn't collide with each other and obstacles. Initially, we solve the problem of synthesis for each robot in order to get the stabilized robot control system relative some point in the state space. At the second stage, spatial trajectories are found along which robots move from the current state to the obtained equilibrium points without collisions. It was proposed to improve an initial algorithm by using the principal of small variation of basic solution. there is considered a group of three robots and the control system for them with phase constraints in the paper.

关键词： Robots Optimal control Mathematical model Genetic programming Collision avoidance Trajectory Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

Large Disturbance Stability Analysis of DC Microgrid with Constant Power Load Based on Sum of Square programming Estimating Attraction Domain

Large Disturbance Stability Analysis of DC Microgrid with Co...

引用

Energy, Electrical and Power Engineering (CEEPE), international conference on

作者： Yongxiang Cai Yang Wang Huajun Zheng Yutao Xu Molin He Xiankui Wen Electric Power Research Institute Guizhou Power Grid Co. Ltd Guiyang China School of Electrical Engineering Guizhou University Guiyang China

ISBN: (数字)9798350375794

ISBN: (纸本)9798350375800

In DC microgrids, constant power loads with negative impedance characteristics are prone to instability when the DC bus voltage is subjected to large disturbances. To ensure the stable operation of DC microgrids with constant power loads under large disturbance conditions, this paper proposes a large disturbance stability analysis method based on sum of square programming to estimate the maximum attraction domain. Firstly, a typical DC microgrid is simplified and its equivalent average mathematical model is established. Secondly, based on the sum of squares programming method, the domain of attraction of the DC microgrid with a constant power load is estimated. then, the stability of this system under large disturbance conditions is analyzed based on the domain of attraction, and the influence of the system parameters on stability is studied. Finally, time-domain simulation based on MATLAB/Simulink verified the effectiveness of the proposed method in stability analysis and the correctness of the conclusions on the impact of system parameters on stability analysis.

关键词： Power filters Power engineering Inductance Microgrids Voltage programming Stability analysis

来源：评论

学校读者我要写书评

暂无评论

A flexible framework for verifying agent programs 08

A flexible framework for verifying agent programs

引用

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3

作者： Louise A. Dennis Berndt Farwer Rafael H. Bordini Michael Fisher University of Liverpool UK Durham University UK

ISBN: (纸本)9780981738123

there is an increasing number of agent-oriented programming languages that have working interpreters and platforms, with significant progress in the quality of such platforms over the last few years. With these platforms becoming more popular, and multi-agent systems being increasingly used for safety-critical applications, the need for verification techniques that apply to systems written in such languages is proportionally intensified. Building on our previous work on model checking for a particular agent-oriented programming language, we have developed a new approach whereby model checking techniques can be used directly on a variety of such languages. the approach also supports the verification of multi-agent systems where individual agents have been programmed in different agent languages.

关键词： BDI agents Java pathfinder agent-oriented programming languages model checking verification

来源：评论

学校读者我要写书评

暂无评论

Object Specialization to Partially Reduce Polymorphism of Attributes 23

Object Specialization to Partially Reduce Polymorphism of At...

引用

Proceedings of the 2023 7th international conference on Computer Science and Artificial Intelligence

作者： Alena Vasileva Yegor Bugayenko Faculty of Computer Science HSE University Russia System Programming Laboratory Huawei RRI Russia

ISBN: (纸本)9798400708688

In object-oriented programming languages, objects with polymorphic attributes can negatively impact performance and hinder static analysis. these attributes require dynamic dispatch, which is slower than static binding, and complicate the analysis process. We propose a novel algorithm for object specialization that addresses this issue by replacing polymorphic attributes with monomorphic ones, resulting in improved performance and simplified static analysis. Our algorithm is a new approach compared to existing function specialization algorithms. We provide a proof of the algorithm’s soundness and correctness, and present an implementation of the algorithm as a software tool. Empirical evaluation shows that our approach achieves significant improvements in performance and simplifies the static analysis process. Our algorithm can be applied to a variety of object-oriented languages such as Java and Python.

关键词： Object-Oriented programming Polymorphism Specialization

来源：评论

学校读者我要写书评

暂无评论

Color detection using Python

Color detection using Python

引用

7th IET Smart Cities Symposium (SCS 2023)

作者： Mrinal Bachute Aditya Singh Akash Kumar Aman Sahil Electronics and Telecommunication Symbiosis International University Pune 412308 Maharashtra India

RGB color detection is a fundamental component of computer vision with a wide range of applications, including image processing, object recognition, industrial automation, and design. this article provides a comprehensive overview of RGB color detection in Python, a popular and versatile programming language, with the aim of accurately identifying and analysing colors in digital images or video streams in a real-time context. this approach uses Python's powerful libraries and packages, like OpenCV or NumPy, to quickly and easily access and process image data. It uses the RGB color space to represent and detect colors. the process includes getting the image, setting the color threshold, and segmenting the objects to identify and track specific colors in the image or *** experimental results show how powerful and fast the RGB color detection system is. It's really good at picking up pre-defined colors in different lighting conditions and different color palettes. It's really useful for tracking objects, recognizing gestures, and sorting colors, so it's great for research and industry. this research is not only useful for computer vision, but it's also a great resource for Python developers and researchers who want to use RGB color detection in their projects. It's a great way to explore and come up with new ideas for color-based apps, and it shows how important color detection is in modern tech and automation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An improved dynamic programming algorithm for coalition structure generation 08

An improved dynamic programming algorithm for coalition stru...

引用

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3

作者： Talal Rahwan Nicholas R. Jennings University of Southampton Southampton UK

ISBN: (纸本)9780981738123

Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such that the social welfare is maximized. this coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. Specifically, given n agents, there are O(nn) possible partitions. To date, the only algorithm that can find an optimal solution in O(3n) is the Dynamic programming (DP) algorithm, due to Rothkopf et al. However, one of the main limitations of DP is that it requires a significant amount of memory. In this paper, we devise an Improved Dynamic programming algorithm (IDP) that is proved to perform fewer operations than DP (e.g. 38.7% of the operations given 25 agents), and is shown to use only 33.3% of the memory in the best case, and 66.6% in the worst.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共360页 << < 331 332 333 334 335 336 337 338 339 340 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：