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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

781 篇 会议
72 篇 期刊文献
61 册 图书

馆藏范围

912 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

504 篇 工学
- 336 篇 计算机科学与技术...
- 199 篇 软件工程
- 95 篇 控制科学与工程
- 88 篇 电气工程
- 71 篇 信息与通信工程
- 40 篇 机械工程
- 29 篇 生物医学工程（可授...
- 27 篇 电子科学与技术（可...
- 27 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 力学（可授工学、理...
- 24 篇 建筑学
- 21 篇 仪器科学与技术
- 20 篇 光学工程
- 20 篇 土木工程
- 19 篇 化学工程与技术
- 17 篇 航空宇航科学与技...
- 15 篇 交通运输工程
383 篇 理学
- 310 篇 数学
- 66 篇 物理学
- 62 篇 系统科学
- 48 篇 统计学（可授理学、...
- 36 篇 生物学
- 22 篇 化学
93 篇 管理学
- 61 篇 管理科学与工程(可...
- 31 篇 图书情报与档案管...
- 28 篇 工商管理
27 篇 医学
- 24 篇 临床医学
- 17 篇 基础医学(可授医学...
15 篇 法学
- 13 篇 社会学
11 篇 农学
10 篇 经济学
10 篇 教育学
4 篇 军事学
2 篇 文学
1 篇 艺术学

主题

74 篇 discrete wavelet...
49 篇 discrete mathema...
43 篇 discrete cosine ...
42 篇 algorithm analys...
32 篇 discrete fourier...
27 篇 signal processin...
25 篇 discrete event s...
25 篇 feature extracti...
19 篇 algorithms
18 篇 signal processin...
18 篇 genetic algorith...
18 篇 data structures
16 篇 computer communi...
16 篇 image coding
16 篇 numeric computin...
16 篇 watermarking
15 篇 artificial intel...
13 篇 computer graphic...
12 篇 robustness
11 篇 mathematical log...

机构

8 篇 carleton univ sc...
3 篇 università di ca...
3 篇 infn sezione di ...
3 篇 north-west unive...
3 篇 infn sezione di ...
3 篇 indian stat inst...
3 篇 in2p3 lpc campus...
3 篇 institut univers...
3 篇 national centre ...
3 篇 tno technical sc...
3 篇 université de st...
3 篇 simon fraser uni...
3 篇 faculty of compu...
3 篇 nikhef national ...
3 篇 laboratoire univ...
3 篇 university moham...
3 篇 university würzb...
3 篇 université de ha...
3 篇 university of jo...
3 篇 university moham...

作者

8 篇 azar ahmad taher
4 篇 catalani f.
4 篇 de souza v.
4 篇 chudoba j.
4 篇 maheshwari anil
4 篇 ammar hossam has...
4 篇 weili wu
3 篇 chen a.
3 篇 benoit d.m.
3 篇 ferrara g.
3 篇 ardid m.
3 篇 calvo d.
3 篇 gagliardini s.
3 篇 eddymaoui a.
3 篇 kulikovskiy v.
3 篇 labalme m.
3 篇 gal t.
3 篇 bozza c.
3 篇 khatun a.
3 篇 kalekin o.

语言

880 篇 英文
32 篇 其他
3 篇 中文

检索条件"任意字段=6th International Conference on Algorithms and Discrete Applied Mathematics"

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

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

详细简洁

排序：

6th international conference on algorithms and discrete applied mathematics, CALDAM 2020

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

引用

6th international conference on algorithms and discrete applied mathematics, CALDAM 2020

ISBN: (纸本)9783030392185

the proceedings contain 38 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: Determining Number of Generalized and Double Generalized Petersen Graph;self-centeredness of Generalized Petersen Graphs;weak Roman Bondage Number of a Graph;on the Geodetic and Hull Numbers of Shadow Graphs;indicated Coloring of Complete Expansion and Lexicographic Product of Graphs;smallest C2l+1-Critical Graphs of Odd-Girth 2k+1;ramsey Numbers for Line Graphs;Δ-Convexity Number and Δ-Number of Graphs and Graph Products;on Cartesian Products of Signed Graphs;partitioning Cographs into Two Forests and One Independent Set;list Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph;on Algebraic Expressions of Two-Terminal Directed Acyclic Graphs;the Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10;on the Minimum Satisfiability Problem;waiting for Trains: Complexity Results;oriented Diameter of Star Graphs;gathering over Meeting Nodes in Infinite Grid;0-1 Timed Matching in Bipartite Temporal Graphs;arbitrary Pattern Formation by Opaque Fat Robots with Lights;greedy Universal Cycle Constructions for Weak Orders;monitoring the Edges of a Graph Using Distances;a New Model in Firefighting theory;an Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties;overlaying a Hypergraph with a Graph with Bounded Maximum Degree;parameterized algorithms for Directed Modular Width;on the Parameterized Complexity of Spanning Trees with Small Vertex Covers;minimum Conflict Free Colouring Parameterized by Treewidth;planar Projections of Graphs;new algorithms and Bounds for Halving Pseudolines;algorithms for Radon Partitions with Tolerance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

10th international conference on algorithms and discrete applied mathematics, CALDAM 2024

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

引用

10th international conference on algorithms and discrete applied mathematics, CALDAM 2024

ISBN: (纸本)9783031522123

the proceedings contain 22 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On Total Chromatic Number of Complete Multipartite Graphs;parameterized Aspects of Distinct Kemeny Rank Aggregation;on Query Complexity Measures and their Relations for Symmetric Functions;improved algorithms for Minimum-Membership Geometric Set Cover;semi-total Domination in Unit Disk Graphs;geometric Covering Number: Covering Points with Curves;growth Rate of the Number of Empty Triangles in the Plane;distance-2-Dispersion with Termination by a Strong Team;monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity;total Coloring of Some Graph Operations;impact of Diameter and Convex Ordering for Hamiltonicity and Domination;eternal Connected Vertex Cover Problem in Graphs: Complexity and algorithms;unique Least Common Ancestors and Clusters in Directed Acyclic Graphs;open Packing in H-free Graphs and Subclasses of Split Graphs;the Frobenius Problem for the Proth Numbers;preface;star Colouring of Regular Graphs Meets Weaving and Line Graphs;the Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability;location-Domination Type Problems Under the Mycielski Construction;star Covers and Star Partitions of Cographs and Butterfly-free Graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

9th international conference on algorithms and discrete applied mathematics, CALDAM 2023

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

引用

9th international conference on algorithms and discrete applied mathematics, CALDAM 2023

ISBN: (纸本)9783031252105

the proceedings contain 34 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On Locally Identifying Coloring of Graphs;on Structural Parameterizations of Star Coloring;perfectness of G-generalized Join of Graphs;on Coupon Coloring of Cayley Graphs;coloring of a Superclass of 2 K2 -free graphs;the Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures;short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs;some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs;monitoring Edge-Geodetic Sets in Graphs;optimal Length Cutting Plane Refutations of Integer Programs;cyclability, Connectivity and Circumference;on three Domination-Based Identification Problems in Block Graphs;computational Aspects of Double Dominating Sequences in Graphs;relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs;cops and Robber on Oriented Graphs with Respect to Push Operation;mind the Gap: Edge Facility Location Problems in theory and Practice;complexity Results on Cosecure Domination in Graphs;latin Hexahedra and Related Combinatorial Structures;algorithms and Complexity of Strongly Stable Non-crossing Matchings;minimum Maximal Acyclic Matching in Proper Interval Graphs;fault-Tolerant Dispersion of Mobile Robots;transitivity on Subclasses of Chordal Graphs;maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength;graph Covering Using Bounded Size Subgraphs;axiomatic Characterization of the Toll Walk Function of Some Graph Classes;structural Parameterization of Alliance Problems;resource Management in Device-to-Device Communications;algorithms for k-Dispersion for Points in Convex Position in the Plane;arbitrary-Oriented Color Spanning Region for Line Segments;rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane;diverse Fair Allocations: Complexity and algorithms;new Bounds and Constructions

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

7th international conference on algorithms and discrete applied mathematics, CALDAM 2021

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

引用

7th international conference on algorithms and discrete applied mathematics, CALDAM 2021

ISBN: (纸本)9783030678982

the proceedings contain 39 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: Parameterized Complexity of Locally Minimal Defensive Alliances;new Variants of Perfect Non-crossing Matchings;cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data;a Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes;on the Intersections of Non-homotopic Loops;on cd-Coloring of Trees and Co-bipartite Graphs;cut Vertex Transit Functions of Hypergraphs;lexicographic Product of Digraphs and Related Boundary-Type Sets;the Connected Domination Number of Grids;scheduling Trains with Small Stretch on a Unidirectional Line;on Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs;cops and Robber on Butterflies and Solid Grids;b-Coloring of Some Powers of Hypercubes;chromatic Bounds for the Subclasses of pK2 -Free Graphs;axiomatic Characterization of the Median Function of a Block Graph;on Coupon Coloring of Cartesian Product of Some Graphs;on the Connectivity and the Diameter of Betweenness-Uniform Graphs;on algorithms to Find p-ordering;experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem;algorithmic Analysis of Priority-Based Bin Packing;algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs;recursive Methods for Some Problems in Coding and Random Permutations;achieving Positive Rates with Predetermined Dictionaries;characterization of Dense Patterns Having Distinct Squares;failure and Communication in a Synchronized Multi-drone System;memory Optimal Dispersion by Anonymous Mobile Robots;quantum and Approximation algorithms for Maximum Witnesses of Boolean Matrix Products;balanced Connected Graph Partition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A N-Dimensional discrete Chaotic Map and Its Performance 6

A N-Dimensional Discrete Chaotic Map and Its Performance

引用

6th international conference on Natural Language Processing (ICNLP)

作者： Gao, Xin Cai, Xiumei Wu, Chengmao Xian Univ Post & Telecommun Sch Automat Xian 710121 Peoples R China Xian Univ Post & Telecommun Sch Elect Engn Xian 710121 Peoples R China

ISBN: (纸本)9798350349122;9798350349115

In order to solve the problems of small key space and simple chaotic behavior of low-dimensional chaotic systems in discrete domain, an N-dimensional discrete chaotic mapping system is proposed. An N-dimensional discrete chaotic system is obtained by coupling Chebyshev mapping with ICMIC mapping. Taking two-dimensional chaotic mapping as an example, the Lyapunov index, bifurcation graph, correlation and other properties of the discrete chaotic system are analyzed and applied to more classical image encryption algorithms. Experimental simulation results show that the N-dimensional discrete chaotic mapping system has larger key space, better chaotic behavior, and better security performance for image encryption algorithms.

关键词： combined chaos Chebyshev map key space Lyapunov exponent

来源：评论

学校读者我要写书评

暂无评论

Speech Emotion Recognition System Using discrete Wavelet Transform and Support Vector Machine 6

Speech Emotion Recognition System Using Discrete Wavelet Tra...

引用

6th international conference on Intelligent Systems and Computer Vision, ISCV 2024

作者： Abakarim, Fadwa Abenaou, Abdenbi National School of Applied Sciences Ibn Zohr University Research Team of Applied Mathematics and Intelligent Systems Engineering Agadir Morocco

ISBN: (纸本)9798350350180

this paper presents a speech emotion recognition system. the features are extracted by the discrete Wavelet Transform method (DWT) with the calculation of energy, variance, skewness, standard deviation, average and kurtosis values. the classification is done using Support Vector Machine (SVM), and to test the performance of our system, we used the Ryerson Audio-Visual Database of Emotional Speech and Song (RAVDESS). the proposed system reached an average accuracy of 82.29% for the recognition of happy, sad, angry and neutral emotions. © 2024 IEEE.

关键词： discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

discrete-Time Stochastic Approximation Consensus algorithms on Directed Matrix-Weighted Networks 6

Discrete-Time Stochastic Approximation Consensus Algorithms ...

引用

6th international conference on Electronic Engineering and Informatics, EEI 2024

作者： Song, Guanhao Feng, Jun-E Tang, Huaibin School of Integrated Circuits Shandong University Jinan China School of Mathematics Shandong University Jinan China

this paper introduces one stochastic approximation consensus type algorithm for discrete-time multi-agent systems (MASs) under general matrix-weighted topologies. By analyzing the consensus error convergence, we estab... 详细信息

ISBN: (纸本)9798350353594

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Growth Rate of the Number of Empty Triangles in the Plane 10th

Growth Rate of the Number of Empty Triangles in the Plane

引用

10th international conference on algorithms and discrete applied mathematics (CALDAM)

作者： Bhattacharya, Bhaswar B. Das, Sandip Islam, Sk. Samim Sen, Saumya Univ Penn Philadelphia PA USA Indian Stat Inst Kolkata India

ISBN: (纸本)9783031522123;9783031522130

Given a set P of n points in the plane, in general position, denote by N-Delta(P) the number of empty triangles with vertices in P. In this paper we investigate by how much N-Delta(P) changes if a point x is removed from P. By constructing a graph G(P)(x) based on the arrangement of the empty triangles incident on x, we transform this geometric problem to the problem of counting triangles in the graph G(P)(x). We study properties of the graph G(P)(x) and, in particular, show that it is kite-free. this relates the growth rate of the number of empty triangles to the famous Ruzsa-Szemeredi problem.

关键词： discrete geometry Empty triangles Kite-free graph

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：