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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

12 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

7 篇 工学
- 7 篇 计算机科学与技术...
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 电子科学与技术（可...
- 1 篇 生物医学工程（可授...
- 1 篇 软件工程
4 篇 理学
- 4 篇 数学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

2 篇 algorithms
1 篇 quantum computin...
1 篇 graph algorithms
1 篇 computational co...
1 篇 forest fire simu...
1 篇 cellular automat...
1 篇 undecidability
1 篇 pseudo
1 篇 computer communi...
1 篇 discrete event s...
1 篇 discrete geometr...
1 篇 computational me...
1 篇 uncertainty prin...
1 篇 epilepsy
1 篇 computer graphic...
1 篇 media
1 篇 aircraft
1 篇 image coding
1 篇 predictive model...
1 篇 discrete mathema...

机构

1 篇 univ bonn dept c...
1 篇 school of inform...
1 篇 zhejiang normal ...
1 篇 fujian provincia...
1 篇 carleton univ sc...
1 篇 institute of nat...
1 篇 faculty of compu...
1 篇 department of ch...
1 篇 ocean univ china...
1 篇 department of co...
1 篇 pimpri chinchwad...
1 篇 department of in...
1 篇 beijing inst tec...
1 篇 chin acdey of lu...
1 篇 department of ma...
1 篇 college of mathe...
1 篇 department of ma...
1 篇 yanan univ coll ...
1 篇 department of co...
1 篇 department of co...

作者

1 篇 xu saijuan
1 篇 zhuang zhen
1 篇 majid forghani
1 篇 tian yunna
1 篇 tong liu
1 篇 sack joerg-ruedi...
1 篇 xiaodi wang
1 篇 changmao qin
1 篇 ding-zhu du
1 篇 abu bakar zainab
1 篇 schwarzwald barb...
1 篇 thakare anuradha
1 篇 ismail suryani
1 篇 abbas darbani
1 篇 gore sonal
1 篇 cheng t.m.
1 篇 liu genggeng
1 篇 abdul jalil masi...
1 篇 haotian zhou
1 篇 wang xiaodong

语言

13 篇 英文

检索条件"任意字段=5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019"

共 13 条记录，以下是1-10 订阅

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

详细简洁

排序：

5th international conference on algorithms and discrete applied mathematics, caldam 2019

5th International Conference on Algorithms and Discrete Appl...

引用

5th international conference on algorithms and discrete applied mathematics, caldam 2019

ISBN: (纸本)9783030115081

the proceedings contain 23 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On rectangle intersection graphs with stab number at most two;dominating induced matching in some subclasses of bipartite graphs;localized query: Color spanning variations;a lower bound for the radio number of graphs;improved descriptional complexity results on generalized forbidding grammars;on selecting leaves with disjoint neighborhoods in embedded trees;the balanced connected subgraph problem;covering and packing of triangles intersecting a straight line;h-free coloring on graphs with bounded tree-width;the induced star partition of graphs;the relative signed clique number of planar graphs is 8;bumblebee visitation problem;on graphs with minimal eternal vertex cover number;on chordal and perfect plane triangulations;fault-tolerant additive weighted geometric spanners;maintaining the visibility graph of a dynamic simple polygon;on the bitprobe complexity of two probe adaptive schemes storing two elements;on m-Bonacci-sum graphs;linear time algorithm to check the singularity of block graphs;b-coloring of the mycielskian of regular graphs;drawing bipartite graphs in two layers with specified crossings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

11th international conference on algorithms and discrete applied mathematics, caldam 2025

11th International Conference on Algorithms and Discrete App...

引用

11th international conference on algorithms and discrete applied mathematics, caldam 2025

ISBN: (纸本)9783031834370

the proceedings contain 30 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: Parameterized Complexity of Coupon Coloring of Graphs;spectra of Eccentricity Matrices of Product of Graphs;almost Empty Monochromatic Polygons in Planar Point Sets;on the Parameterized Complexity of Odd Coloring;on Full-Separating Sets in Graphs;polynomial Time algorithms for Hop Domination;charging Station Placement for Limited Energy Robots;multipacking in the Euclidean Metric Space;partial Domination in Some Geometric Intersection Graphs;generalized Lettericity of Graphs;polynomial-Time algorithms for Path Cover on Trees and Graphs of Bounded Treewidth;Fast FPT algorithms for Grundy Number on Dense Graphs;on a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis;algorithms and Hardness Results for the (3, 1)-Cover Problem;extension Perfect Roman Domination;a Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks;two Step Graph Protection Game;bipartite Domination in Graphs: Complexity and algorithms;packing Sets of Paths, Stars and Triangles: Tractability and Approximability;structural Parameterization of Minus Domination;an Algebraic Characterization of Strong Graphs;there are Finitely Many Uniformly Most Reliable Graphs of Corank 5;helly Number, Radon Number and Rank in Δ-Convexity on Graphs;forbidden Induced Subgraphs in Iterative Higher Order Line Graphs;total Domination and Open Packing in Two Subclasses of Triangle-Free Graphs;the MASEMPR Problem and Its Applications in Logistics;Broadcast Graph is NP-Complete;maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

8th international conference on algorithms and discrete applied mathematics, caldam 2022

8th International Conference on Algorithms and Discrete Appl...

引用

8th international conference on algorithms and discrete applied mathematics, caldam 2022

ISBN: (纸本)9783030950170

the proceedings contain 24 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On cd-Coloring of { P5, K4} -free Chordal Graphs;an Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs;covering a Graph with Densest Subgraphs;coresets for (k, ) -Median Clustering Under the Fréchet Distance;bounds and algorithms for Geodetic Hulls;voronoi Games Using Geodesics;approximation and Parameterized algorithms for Balanced Connected Partition Problems;algorithms for Online Car-Sharing Problem;algebraic algorithms for Variants of Subset Sum;chromatic Bounds for Some Subclasses of (P3∪ P2) -free graphs;hardness and Approximation Results for Some Variants of Stable Marriage Problem;on Fair Division with Binary Valuations Respecting Social Networks;parameterized Intractability of Defensive Alliance Problem;on the Approximability of Path and Cycle Problems in Arc-Dependent Networks;approximation algorithms in Graphs with Known Broadcast Time of the Base Graph;list Homomorphisms to Separable Signed Graphs;some Position Problems for Graphs;comparability Graphs Among Cover-Incomparability Graphs;Complexity of Paired Domination in AT-free and Planar Graphs;the Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs;on Conflict-Free Spanning Tree: algorithms and Complexity;B0 -VPG Representation of AT-free Outerplanar Graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A New Model in Firefighting theory 6th

A New Model in Firefighting Theory

引用

6th international conference on algorithms and discrete applied mathematics

作者： Klein, Rolf Kubelb, David Langetepe, Elmar Sack, Joerg-Ruediger Schwarzwald, Barbara Univ Bonn Dept Comp Sci D-53115 Bonn Germany Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9783030392185;9783030392192

Continuous and discrete models [1,5] for firefighting problems are well-studied in theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied terrains. We present three different firefighting problems in the context of this model;for two of which, we provide efficient polynomial time algorithms and for the third, we show NP-completeness. We also discuss possible extensions of the model and their implications on the computational complexity.

关键词： Cellular automaton Combinatorial algorithms Computational complexity discrete geometry Fire spread models Fire behaviour modeling Firefighting Forest fire simulation Frontal propagation Graph algorithms Graph theory NP-completeness Undecidability

来源：评论

学校读者我要写书评

暂无评论

X-Architecture Steiner Minimal Tree Construction Based on discrete Differential Evolution 15th

X-Architecture Steiner Minimal Tree Construction Based on Di...

引用

15th international conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th international conference on Harmony Search, Soft Computing and Applications, ICHSA 2019

作者： Wu, Hailin Xu, Saijuan Zhuang, Zhen Liu, Genggeng College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Department of Information Engineering Fujian Business University Fuzhou350012 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

ISBN: (纸本)9783030324551

As the best connection model for the multi-pin net of the non-Manhattan architecture global routing problem, the X-architecture Steiner Minimum Tree (XSMT) construction is a Non-deterministic Polynomial hard (NP-hard) problem. the Differential Evolution (DE) algorithm has shown good application effect in solving various NP-hard problems. For this reason, based on the idea of DE algorithm, this paper proposes an XSMT construction algorithm for solving this problem. First of all, because the traditional DE algorithm is designed for continuous problems, the optimization ability is limited in solving discrete problems. this paper proposes a novel crossover operator and mutation operator. At the same time, in order to maintain the effectiveness of the evolutionary algorithm, an Edge-to-Point coding strategy suitable for evolutionary algorithms is proposed to better preserve the optimal substructure of the population. Finally, in order to speed up the convergence speed and quality of the algorithm, this paper proposes an initial solution based on the minimum tree generation algorithm. Experiments show that the effectiveness of the proposed algorithm and related strategies can construct a high-quality XSMT solution. © Springer Nature Switzerland AG, 2020.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A discrete Wolf Pack Algorithm for Job Shop Scheduling Problem 5

A Discrete Wolf Pack Algorithm for Job Shop Scheduling Probl...

引用

5th international conference on Control, Automation and Robotics (ICCAR)

作者： Wang, Feng Tian, Yunna Wang, Xiaodong Beijing Inst Technol Sch Comp Sci Beijing Peoples R China Yanan Univ Coll Math & Comp Sci Yanan Peoples R China Ocean Univ China Coll Informat Sci & Engn Qingdao Peoples R China

ISBN: (纸本)9781728133263

the job shop scheduling problem is demonstrated to be one of the NP-complete problems. Many meta-heuristics are proposed to solve this problem. In this paper, wolf pack algorithm is applied to this problem. this algorithm simulates predation behavior and prey allocation mode of wolf pack, providing a new method to solve the job shop scheduling problem. Due to the discrete characteristics of the scheduling solutions, some adjustments are added to develop a discrete wolf pack algorithm (DWPA). Also a computational result shows that DWPA has a good performance on the time efficiency and accuracy compared with other algorithms.

关键词： discrete wolf pack algorithm job shop makespan swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

A Methodology for Classification of Seizure disorder using EEG Signals 5

A Methodology for Classification of Seizure disorder using E...

引用

5th international conference on Computing, Communication Control and Automation (ICCUBEA)

作者： Shinde, Rutuja thakare, Anuradha Gore, Sonal Pimpri Chinchwad Coll Engn Comp Engn Pune Maharashtra India

ISBN: (纸本)9781728140421

Epilepsy is a chronological disorder affects millions of people worldwide. the abnormal electrical activity of a group of brain cells is known as a seizure. Electroencephalography (EEG) is a non-invasive technique most commonly used for monitoring brain activities and diagnosis the neurological disorder. EEG signals are measured with multi-electrode placed properly at the scalp. this work presents a system and method in order to classify seizure disorder. In this work, discrete wavelet transform (DWT) is used to extract the features and based on particle swarm optimization (PSO) new approach probability particle swarm optimization (PPSO) using probability function feature selection algorithm is applied on feature vector and feature selection process is performed. For performance analysis, machine learning classification algorithms are applied.

关键词： Epilepsy discrete Wavelet Transform Feature Extraction Feature selection Classification

来源：评论

学校读者我要写书评

暂无评论

the Use of Hybrid Information Retrieve Technique and Bayesian Relevance Feedback Classification on Clinical Dataset 5th

The Use of Hybrid Information Retrieve Technique and Bayesia...

引用

5th international conference on Soft Computing in Data Science, SCDS 2019

作者： Mohd, Fatihah Abdul Jalil, Masita @ Masila Mohamad Noor, Noor Maizura Ismail, Suryani Abu Bakar, Zainab School of Informatics and Applied Mathematics Universiti Malaysia Terengganu Kuala TerengganuTerengganu21030 Malaysia Faculty of Computer and Information Technology Al-Madinah International University Shah AlamSelangor Malaysia

ISBN: (纸本)9789811503986

Retrieval of information related to a subset variable or feature has become the attention of many researchers in data mining fields. the objective of feature selection (FS) is to improve the performance of the prediction. this contributes to providing a better definition of the features, feature structure, feature ranking, feature selection functions, efficient search techniques, and feature validation methods. In this study, a retrieval method that integrates correlation and linear forward selection algorithms to evaluate and generate the subset of clinical features are present. the objective of the research is to find the optimal features of a cancer dataset and to classify the disease into multiple cancer stages: one, two, three, and four. the research methodology is developed based on data mining, knowledge data discovery with four phases: pre-processing, resampling, feature selection, and classification. the proposed Bayesian Relevance Feedback (BRF) for classification is also described to resolve the zero value of posterior probabilities, concentrating on increasing the accuracy in the diagnosis of cancer stages. the experimental works are done on oral cancer dataset by applying WEKA. the analysis on accuracy performance was done on several classification algorithms using 15 optimal features that were chosen by a hybrid features selection method. the result shows that, BRF has outperformed others achieving 97.25% classification accuracy compared to the six classifiers, which are K-Nearest Neighbors Classifier, Multi Class Classifier, Tree-Random, Multilayer Perceptron, Naïve Bayes, and Support Vector Machine. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Research on Demand Forecast of Aircraft Spare Parts Based on Fractional Order discrete Grey Model

Research on Demand Forecast of Aircraft Spare Parts Based on...

引用

IEEE international conference on Computer and Communications

作者： Qunhai Qiu ChangMao Qin Jiao Shi Haotian Zhou Chin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice Technoogy

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

Exact spare parts demand forecast is an important task of equipment maintenance support. In spare parts demand forecast of aircraft, there exists problems such as the lack of comparable existing equipments, less historical data of fault or spare parts demand and lack of understanding of the aircraft's own guarantee characteristics. In this paper, a spare parts demand forecast method based on fractional-order discrete gray model is proposed. In this method, a fractional-order cumulative gray model is established from historical data containing "small sample" and "poor information". then, the genetic algorithm is applied to determine the optimal order of the model and the generation coefficient. Finally, the spare parts demand is predicted. Experimental results based on specific examples show that the proposed method can effectively predict the spare parts demand, and have good performance compared with the traditional integer-order model.

关键词： Predictive models Data models Autoregressive processes Atmospheric modeling Aircraft Prediction algorithms Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Steganography Method for Embedding Message in JPEG Images

A New Steganography Method for Embedding Message in JPEG Ima...

引用

international conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Abbas Darbani Mohammad M. AlyanNezhadi Majid Forghani Department of computer engineering Shahrood Non-profit and Non-government Higher Edu. Inst. Shahrood Iran Institute of natural sciences and mathematics Ural Federal University Yekaterinburg Russia

Steganography is widely applied by information security systems. the aim of steganography is to create a secret and secure channel between the sender and receiver. Steganography is basically performed in the different data types, such as image and video. Given the rapid growth of digital systems and imaging tools, the number of images and transmission of secret information is also growing. JPEG images are very popular because of their smaller size that makes them suitable for the transmission. the steganography procedure in an image can usually be performed in two domain, space domain and transform domain such as Fourier. In this preliminary study, a text steganography technique in JPEG images is presented. the text steganography is carried out on the bits with the least significant value in the discrete matrix, thus the embedded message insertion has less impact on the image quality. In the proposed method, two less significant bits of pixels are used to hide the embedded message in the image. In JPEG compression procedure before encoding, the steganography operation is applied on the image after its transformation from time into the frequency space and exactly(or right away) after the discretization of transformed data. the experimental results suggest that our approach has high capacity performance in comparison with the conventional methods.

关键词： Transform coding Image coding discrete cosine transforms Media Wavelet transforms Receivers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：