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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

29 篇 会议
22 篇 期刊文献
10 册 图书

馆藏范围

61 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

36 篇 工学
- 26 篇 计算机科学与技术...
- 15 篇 软件工程
- 7 篇 信息与通信工程
- 7 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 光学工程
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 电气工程
- 2 篇 化学工程与技术
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
22 篇 理学
- 14 篇 数学
- 5 篇 物理学
- 4 篇 系统科学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 1 篇 海洋科学
11 篇 管理学
- 7 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 医学
1 篇 经济学
- 1 篇 理论经济学
1 篇 法学
- 1 篇 社会学

主题

13 篇 artificial intel...
11 篇 computational in...
4 篇 fuzzy logic
2 篇 complex networks
2 篇 fuzzy sets
2 篇 graphics process...
2 篇 companies
2 篇 computational mo...
2 篇 evolutionary alg...
2 篇 time series anal...
2 篇 combinatorial op...
2 篇 vehicles
2 篇 intelligent syst...
1 篇 investment
1 篇 disjunctive oper...
1 篇 computer science
1 篇 tools
1 篇 aggregates
1 篇 computer circuit...
1 篇 maintenance engi...

机构

6 篇 faculty of engin...
5 篇 department of co...
4 篇 department of th...
4 篇 facultad de cien...
4 篇 uow malaysia kdu...
4 篇 school of econom...
4 篇 laboratory of no...
4 篇 department of co...
4 篇 department of co...
4 篇 department of co...
4 篇 modeling evoluti...
4 篇 department of in...
3 篇 faculty of engin...
3 篇 statistics and o...
3 篇 faculty of elect...
3 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 research group o...
2 篇 department of me...

作者

10 篇 pandian vasant
10 篇 elias munapo
10 篇 j. joshua thomas
10 篇 gerhard-wilhelm ...
9 篇 mohammad shamsul...
9 篇 vladimir panchen...
5 篇 roman rodriguez-...
4 篇 rolly intan
3 篇 barahona-ríos ad...
3 篇 dombi józsef
3 篇 collins tom
3 篇 józsef dombi
2 篇 zelinka ivan
2 篇 jakob rehof
2 篇 zsuzsanna eszter...
2 篇 vasant pandian
2 篇 khalil elias b.
2 篇 koliechkina liud...
2 篇 tamás jónás
2 篇 constantin chaum...

语言

59 篇 英文
2 篇 其他

检索条件"机构=Department of Computer Algorithms and Artificial Intelligence"

共 61 条记录，以下是11-20 订阅

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

详细简洁

排序：

Spiking neural P system simulations on a high performance GPU platform

Spiking neural P system simulations on a high performance GP...

引用

11th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2011

作者： Cabarle, Francis George Adorna, Henry Martínez-Del-Amor, Miguel A. Pérez-Jiménez, Mario J. Algorithms and Complexity Lab. Department of Computer Science University of the Philippines Diliman Quezon City Diliman 1101 Philippines Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Seville Avda. Reina Mercedes s/n Sevilla 41012 Spain

ISBN: (纸本)9783642246685

In this paper we present our results in adapting a Spiking Neural P system (SNP system) simulator to a high performance graphics processing unit (GPU) platform. In particular, we extend our simulations to larger and more complex SNP systems using an NVIDIA Tesla C1060 GPU. The C1060 is manufactured for high performance computing and massively parallel computations, matching the maximally parallel nature of SNP systems. Using our GPU accelerated simulations we present speedups of around 200x for some SNP systems, compared to CPU only simulations. © 2011 Springer-Verlag.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Differential evolution based on node strength

Differential evolution based on node strength

引用

作者： Skanderova, Lenka Fabian, Tomas Zelinka, Ivan Department of Computer Science Faculty of Electrical Engineering and Computer Science VSB – Technical University of Ostrava Ostrava Czech Republic Modeling Evolutionary Algorithms Simulation and Artificial Intelligence Faculty of Electrical and Electronics Engineering Ton Duc Thang University Ho Chi Minh Viet Nam

In this paper, three novel algorithms for optimisation based on the differential evolution algorithm are devised. The main idea behind those algorithms stems from the observation that differential evolution dynamics can be modelled via complex networks. In our approach, the individuals of the population are modelled by the nodes and the relationships between them by the directed lines of the graph. Subsequent analysis of non-trivial topological features further influence the process of parent selection in the mutation step and replace the traditional approach which is not reflecting the complex relationships between individuals in the population during evolution. This approach represents a general framework which can be applied to various kinds of differential evolution algorithms. We have incorporated this framework with the three well-performing variants of differential evolution algorithms to demonstrate the effectiveness of our contribution with respect to the convergence rate. Two well-known benchmark sets (including 49 functions) are used to evaluate the performance of the proposed algorithms. Experimental results and statistical analysis indicate that the enhanced algorithms perform better or at least comparable to their original versions. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Foreword

引用

ACTA CYBERNETICA 2007年第1期18卷 3-3页

作者： Gecseg, Ferenc Turan, Gyoergy Department of Computer Algorithms and Artificial Intelligence University of Szeged Szeged Hungary Research Group on Artificial Intelligence Hungarian Academy of Sciences University of Szeged Szeged Hungary Department of Mathematics Statistics and Computer Science University of Illinois at Chicago Chicago IL United States

来源：评论

学校读者我要写书评

暂无评论

Depthwise Convolutions using Physicochemical Features of DNA for Transcription Factor Binding Site Classification Physicochemical Features for DNA-Protein Classification with Depthwise Convolutions 6

Depthwise Convolutions using Physicochemical Features of DNA...

引用

6th International Conference on Advances in artificial intelligence, ICAAI 2022

作者： Gergely, Pap Krisztián, Ádám Zoltán, Györgypál László, Tóth Zoltán, Hegedűs Department of Computer Algorithms and Artificial Intelligence University of Szeged Szeged Hungary Institute of Biophysics Biological Research Centre Eötvös Loránd Research Network Szeged Hungary Department of Biochemistry and Medical Chemistry Medical School University of Pécs Pécs Hungary

ISBN: (纸本)9781450396943

Classifying DNA sequences based on a nucleotide representation has enjoyed considerable success with the advancement of Deep Learning, as the proper usage and combination of different layers and architecture choices led to an increase in performance. The most common approaches rely on convolutional, recurrent and attention layer types. Moreover, the inclusion of further information in addition to the nucleotide sequence provides increases in performance, even though the methods of combining the input feature representations with distinct model structures could pose a challenge. To examine this topic, we applied depthwise separable convolutional layers to a physicochemical DNA sequence representation and train models to detect the binding sites of DNA binding proteins. While convolutional kernels learn the local feature patterns of motifs, the behaviour of the depthwise separable convolution better exploits the feature, shape and physicochemical information that could be stored in the input representation. Our models with depthwise separable convolution achieve increases in accuracy compared to the convolutional and nucleotide-based approaches on several datasets. © 2022 Association for Computing Machinery.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC PLANNING OF VEHICLE AND DRIVER SCHEDULES FOR PUBLIC TRANSPORTATION: A CASE STUDY 17

AUTOMATIC PLANNING OF VEHICLE AND DRIVER SCHEDULES FOR PUBLI...

引用

17th International Symposium on Operational Research in Slovenia, SOR 2023

作者： Békési, József Galambos, Gábor Papp, Imre University of Szeged Institute of Informatics Department of Computer Algorithms and Artificial Intelligence Árpád tér 2 SzegedH-6720 Hungary University of Szeged Juhász Gyula Faculty of Education Department of Applied Informatics Boldogasszony sgt. 6 SzegedH-6725 Hungary

ISBN: (纸本)9789616165617

The combined vehicle and driver scheduling problem consists of scheduling a fleet of vehicles and their drivers to cover a set of tasks at minimum costs. The tasks are given by predetermined time intervals and vehicles are supplied by different depots. There are several known mathematical models that can be used to solve this problem resulting valid schedules of both the vehicles and the drivers. In practical problems there are a lot of vehicle and driver requirements that can not be handled easily and usually have a significant computational demand. We present the results of our research and development project through a case study based on real life experiments at the Budapest Transport Corporation. © Proceedings of the 17th International Symposium on Operational Research in Slovenia, SOR 2023. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Improved Accuracy Rates of a Prototype Based Classifier Using Evolutionary Computation

Improved Accuracy Rates of a Prototype Based Classifier Usin...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Gustavo Recio Yago Saez Pedro Isasi Department of Computer Science Evolutionary Algorithms Neural Networks and Artificial Intelligence Carlos III Technical University of Madrid Madrid Spain

Prototype based classifiers allow to determine the class of a new example based on a reduced set of prototypes instead of using a large set of known samples. By doing this, the computational time gets substantially decreased as the initial set is replaced by a reduced one and hence the classification requires less computations to estimate nearest neighbours. In most simple classification problems the samples associated to each class are in general gathered in a particular region of the euclidean space defined by their characteristic features. In these particular problems prototype classifiers reach their best performance. Unfortunately, not all classification problems have their samples distributed in this way and therefore improvements are needed in order to reach acceptable classification accuracy rates. This work proposes a nearest prototype classifier that uses evolutionary computation techniques to increase the classification accuracy. A genetic algorithm was used to evolve the spatial location of each prototype resulting in a better distribution of prototypes which are able to obtain larger classification accuracy rates.

关键词： Prototypes Evolutionary computation Genetic algorithms artificial intelligence Spatial databases Hybrid power systems Intelligent systems Intelligent networks Application software computer science

来源：评论

学校读者我要写书评

暂无评论

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs 17

Three Colors Suffice: Conflict-Free Coloring of Planar Graph...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Zachary Abel Victor Alvarez Erik D. Demaine Sandor P. Fekete Aman Gour Adam Hesterberg Phillip Keldenich Christian Scheffer Mathematics Department MIT Algorithms Group TU Braunschweig Computer Science and Artificial Intelligence Laboratory MIT Computer Science and Engineering IIT Bombay

ISBN: (纸本)9781510836358

A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well-studied in graph theory. Here we study the natural problem of the conflict-free chromatic number χ_(CF)(G) (the smallest k for which conflict-free k-colorings exist), with a focus on planar graphs. For general graphs, we prove the conflict-free variant of the famous Hadwiger Conjecture: If G does not contain K_(k+1) as a minor, then χ_(CF)(G) ≤ k. For planar graphs, we obtain a tight worst-case bound: three colors are sometimes necessary and always sufficient. In addition, we give a complete characterization of the algorithmic/computational complexity of conflict-free coloring. It is NP-complete to decide whether a planar graph has a conflict-free coloring with one color, while for outer-planar graphs, this can be decided in polynomial time. Furthermore, it is NP-complete to decide whether a planar graph has a conflict-free coloring with two colors, while for outerplanar graphs, two colors always suffice. For the bicriteria problem of minimizing the number of colored vertices subject to a given bound k on the number of colors, we give a full algorithmic characterization in terms of complexity and approximation for outerplanar and planar graphs.

关键词： planning drawings Color Planar vertex head Graph theory

来源：评论

学校读者我要写书评

暂无评论

Horizontal Method Application to Multiobjective Combinatorial Optimization over Permutations 3

Horizontal Method Application to Multiobjective Combinatoria...

引用

3rd IEEE International Conference on System Analysis and Intelligent Computing, SAIC 2022

作者： Koliechkina, Liudmyla Pichugina, Oksana Dvirna, Olena University of Lodz Algorithms and Databases Department ul. Narutowicza 68 90-136 Lodz90-136 Poland National Aerospace University 'Kharkiv Aviation Institute' Mathematical Modelling and Artificial Intelligence Department Kharkiv Ukraine National University 'Yuri Kondratyuk Poltava Polytechnic' Computer and Information Technologies and Systems Department Poltava Ukraine

ISBN: (数字)9798350396744

ISBN: (纸本)9798350396744

The article considers multiobjective combinatorial problems on a general configuration of permutations. As is known, combinatorial optimization problems arise in many areas and are associated with solving complex problems. These problems are usually relatively easy to formulate mathematically, but most are computationally complex and require a systematic approach to solve them. The solution to such problems becomes more complicated if two or more objective functions appear in the problem statement, which can characterize different statistical and economic performance indicators. A horizontal method (HM) is proposed for solving multiobjective combinatorial problems on a general set of permutations. The main idea of this method is to use the properties of combinatorial configurations and polytopes of these configurations. The proposed method reduces the search area to solving auxiliary unbounded combinatorial problems and cuts off a part of the polyhedron based on the properties of linear objective functions on graphs. The applicability of the horizontal method to the general configuration of permutations is substantiated. The proposed method for solving multiobjective combinatorial problems belongs to the group of branch and bound methods. © 2022 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A knowledge discovery based approach to long-term forecasting of demand for electronic spare parts

A knowledge discovery based approach to long-term forecastin...

引用

International Symposium on Computational intelligence and Informatics

作者： Tamás Jónás Zsuzsanna Eszter Tóth József Dombi Department of Management and Corporate Economics Budapest University of Technology and Economics Budapest Hungary Department of Computer Algorithms and Artificial Intelligence University of Szeged Szeged Hungary

This paper deals with modeling and predicting purchase life-cycles of electronic spare parts that are supplied to the repair vendors by companies which provide the so-called spare parts logistics service. We introduce a soft computational method that can be used to discover the typical purchase life-cycles of end-of-life spare parts that belong to the same commodity class. In our approach, the discovered knowledge is embodied by typical demand models which can be utilized to forecast the demand for active spare parts, that is, for components for which there are current demands. We apply a fuzzy similarity based approach to generate the forecast from the typical demand models. The introduced forecasting method is advantageous in long-term prediction, it can be especially useful in supporting purchase planning decisions in the ramp-up and declining phases of purchase life-cycles. The application of our method is demonstrated through real-life examples.

关键词： Time series analysis Predictive models Consumer electronics Forecasting Maintenance engineering Computational modeling Companies

来源：评论

学校读者我要写书评

暂无评论

A Smart Microgrid Approach for Distributed Network Combined with Power Line Fault Location Detection

A Smart Microgrid Approach for Distributed Network Combined ...

引用

2021 IEEE International Conference on Automatic Control and Intelligent Systems, I2CACIS 2021

作者： Khushi, Farha Motakabber, S.M.A. Bhattacharjee, Amit Zahirul Alam, A.H.A. Wong Azman, Amelia Hussain, Fayaz Kulliyyah of Engineering IIUM Dept. of Electronic and Computer Engineering Gombak Malaysia The City University Of New York Department Of Electrical And Computer Engineering New YorkNY United States Ton Duc Thang University Modeling Evolutionary Algorithms Simulation and Artificial Intelligence Faculty of Electrical Electronics Engineering Ho Chi Minh City Viet Nam

ISBN: (纸本)9781665403436

For every researcher, uncertainties connected to the Smart Grid and Distribution Network are a common element. Thousands of sources are part of the renewable energy system and they are situated at varying distances. In due course, certain sources may be inefficient, or a natural disaster can destroy the source causing power supply failures or require routine maintenance to improve service. Some of these defects grow slowly and some have a strong impact. The systems, however, contain safety components to remove the problem, but impact the generation of electricity and conduct intelligent grid errors. An intelligent microgrid should feature an intelligent fault location detection and fault removal device to avoid unwanted loads and insecurities. This research shaped a smart grid system, together with a defective technique to identify uncertainty efficiently. The originality of this research is to model an SMG based on an isolated small area's SGC mechanism in conjunction with a defective detecting system to manage uncertainties in an efficient way. The FLD technique is focused upon wavelet trigger signal and mathematical morphology method. In this approach, the wavelet activator signal created by the equivalent current or voltage for a short period of time is simulated to go to both terminals to determine that the fault takes place in the short branch using the mathematical morphological technique. The SMG modeled system is separated into a few branches for the FLD system. A smart technique is presented via mixed human machine interface (HMI) for SMG performance and FLD monitoring. The integrated process of the SMG system modeling in the MATLAB performance validation simulation platform. © 2021 IEEE.

关键词： Mathematical morphology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：