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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
4 册 图书

馆藏范围

855 篇 电子文献
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...
43 篇 discrete cosine ...
32 篇 discrete fourier...
27 篇 signal processin...
25 篇 discrete event s...
25 篇 feature extracti...
18 篇 signal processin...
18 篇 genetic algorith...
16 篇 image coding
16 篇 watermarking
12 篇 robustness
11 篇 transform coding
11 篇 wavelet transfor...
11 篇 heuristic algori...
10 篇 support vector m...
10 篇 data mining
10 篇 computational mo...
10 篇 algorithm design...
9 篇 optimization
9 篇 discrete wavelet...

机构

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...
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.
3 篇 huang f.

语言

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

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

共 857 条记录，以下是31-40 订阅

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

详细简洁

排序：

Parameterized Complexity of Coupon Coloring of Graphs 11th

Parameterized Complexity of Coupon Coloring of Graphs

引用

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

作者： Ashok, Pradeesha Devarakonda, Pradyun Phogat, Shiven Rayala, Swaroop A. Ram Sherin, J.A. International Institute of Information Technology Bangalore Bengaluru India PSG College of Technology Coimbatore India

Given a graph G(V,60;E), a q-coupon coloring of G refers to a coloring f:V→[q] such that the following is true for all v∈V: for all i∈[q], there exists u∈N(v) such that f(u)=i. Given a graph G, the q-Coupon Col... 详细信息

ISBN: (纸本)9783031834370

Given a graph G(V, E), a q-coupon coloring of G refers to a coloring f:V→[q] such that the following is true for all v∈V: for all i∈[q], there exists u∈N(v) such that f(u)=i. Given a graph G, the q-Coupon Coloring problem is to decide whether G admits a q-coupon coloring. the q-Coupon Coloring problem is shown to be NP-complete. We initiate the study of parameterized complexity of the q-Coupon Coloring problem. It is implied by existing results that parameterization by q is unlikely to admit FPT algorithms. We study the q-Coupon Coloring problem parameterized by structural parameters including neighborhood diversity, twin cover, distance to clique and treewidth of the graph. We show FPT algorithms when the parameter is neighborhood diversity, twin cover and distance to clique and prove tight lower bounds when the parameter is treewidth. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Parkinsonian Gait Severity in Older Adults with Dementia Using Natural Gait Video Analysis

Parkinsonian Gait Severity in Older Adults with Dementia Usi...

引用

2024 international Telecommunications conference, ITC-Egypt 2024

作者： Islam, Eissa Medhat, Mariam Waleed, Farah Deif, Mohanad A. Alkhazaleh, Shawkat Hafez, Mohamed 6th of October City Department of Artificial intelligence 12566 Egypt Jadara University Faculty of Science and Information Technology Department of Mathematics Jordan FEQS INTI-IU-University Faculty of Engineering Nilai Malaysia

ISBN: (纸本)9798350351408

Parkinson's disease presents challenges in assessing severity, especially in older adults with dementia. this study introduces a novel approach using vision-based systems for gait analysis [1]. 2D human pose tracking in video data from a dementia unit extracted gait features. Correlation between these features and parkinsonism severity, assessed by UPDRS, was observed [6]. Five machine learning algorithms were evaluated, with KNN demonstrating superior performance [9]. Random Forest and Extra Trees also performed well [10], while Logistic Regression faced challenges [11], [12]. XGBoost showed exceptional predictive ability [8]. the study underscores the effectiveness of these algorithms in non-invasively identifying gait abnormalities, particularly highlighting KNN's adeptness with high-dimensional features [9]. this research advances healthcare diagnostics by showcasing machine learning's potential in early detection and ongoing monitoring of neurodegenerative disorders, promising improved medical outcomes. © 2024 IEEE.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

Monoclinic Elastic Medium Under the Effect of Initial Stress with Repeated Eigen Values 6th

Monoclinic Elastic Medium Under the Effect of Initial Stress...

引用

6th international conference on Mathematical Modelling, applied Analysis and Computation, ICMMAAC 2023

作者： Gaba, Aanchal Goyal, Ritu Department of Mathematics Noida International University Noida203201 India Department of Mathematics Chaudhary Bansi Lal University Bhiwani127021 India

ISBN: (纸本)9783031563034

With the help of equal eigen value technique, we have derived the closed form analytical expression for an initially stressed monoclinic elastic medium under the effect of inclined line-load. For the procedure, we have assumed the field to be distributed sinusoidally and then uses matrix method for computation. the effect of inclined line-load and initial stress on the dimensionless displacements and stresses has been depicted graphically with the help of MATLAB. Further, we have also presented the particular case for Orthotropic, Isotropic and Transversely isotropic elastic medium. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

A Robust Digital Audio Watermarking Algorithm 6

A Robust Digital Audio Watermarking Algorithm

引用

6th IEEE international conference on Electronics and Communication Engineering, ICECE 2023

作者： Zhang, Yongmei Jiao, Shuai Zhang, Tianxin North China University of Technology School of Information Science and Technology Beijing China

ISBN: (纸本)9798350328721

Aiming at the problems of insufficient embedding strength and single attack mode, this paper proposes a robust digital audio watermarking algorithm for binary images. the watermark encryption, embedding, attack, extraction and decryption are completed. the watermark image is encrypted by Arnold transform, the feature sequence is extracted by wavelet transform, and discrete Cosine Transform (DCT) and Singular Value Decomposition (SVD) are performed. Finally, the watermark image is embedded into the audio signal. Watermark extraction is the reverse operation of watermark embedding. Arnold inverse transform is applied to the extracted watermark to obtain the decrypted watermark image. Low-pass filtering, random noise, cropped audio, and resampling are used for the attacks. Normalized Correlation coefficient (NC), Symbol Error Rate (SER), Pearson Correlation Coefficients (PCCs), and Signal-to-Noise Ratio (SNR) are used for objective evaluation. Experiment results show the proposed algorithm has better robustness and invisibility, which is favorable for the privacy protection of audio information. © 2023 IEEE.

关键词： discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem 26

Tighter Approximation for the Uniform Cost-Distance Steiner ...

引用

26th international conference on Approximation algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th international conference on Randomization and Computation, RANDOM 2023

作者： Foos, Josefine Held, Stephan Dustin Spitzley, Yannik Kyle Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Germany

ISBN: (纸本)9783959772969

Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. they are applied when the tree is intended for signal transmission, e.g. in chip design or telecommunication networks. they are a special case of general cost-distance Steiner trees, where different distance functions are used for total length and path lengths. We improve the best published approximation factor for the uniform cost-distance Steiner tree problem from 2.39 [15] to 2.05. If we can approximate the minimum-length Steiner tree problem arbitrarily well, our algorithm achieves an approximation factor arbitrarily close to 1 + √12 . this bound is tight in the following sense. We also prove the gap 1 + √12 between optimum solutions and the lower bound which we and all previous approximation algorithms for this problem use. Similarly to previous approaches, we start with an approximate minimum-length Steiner tree and split it into subtrees that are later re-connected. To improve the approximation factor, we split it into components more carefully, taking the cost structure into account, and we significantly enhance the analysis. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Computation of Two-Dimensional Poisson Equation Using the third-Order discrete Scheme of Finite Difference Method Based on Node Set Vector 6

Computation of Two-Dimensional Poisson Equation Using the Th...

引用

2022 6th international conference on Mechanics, mathematics and applied Physics, ICMMAP 2022

作者： Luo, Zhizhong School of Mechatronics and Vehicle Engineering East China Jiaotong University Nanchang China

A novel third-order discrete scheme of finite difference method based on node set vector for two dimensional Poisson equation is proposed in this paper. Studies on the basic discrete scheme of this method as well as the discrete scheme of the interior node and boundary node are carried out in detail. Computer programs are also developed to emulate a computation sample. the numerical computation results show that this discrete scheme is effective for the numerical computation of two dimensional Poisson equation. © Published under licence by IOP Publishing Ltd.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

A 10/7-Approximation for discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs 26

A 10/7-Approximation for Discrete Bamboo Garden Trimming and...

引用

26th international conference on Approximation algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th international conference on Randomization and Computation, RANDOM 2023

作者： Höhne, Felix van Stee, Rob Fraunhofer Institute for Industrial Mathematics ITWM Kaiserslautern Germany University of Siegen Germany

ISBN: (纸本)9783959772969

In the discrete bamboo garden trimming problem we are given n bamboo that grow at rates v1, . . ., vn per day. Each day a robotic gardener cuts down one bamboo to height 0. the goal is to find a schedule that minimizes the height of the tallest bamboo that ever exists. We present a 10/7-approximation algorithm that is based on a reduction to the pinwheel problem. this is consistent with the approach of earlier algorithms, but some new techniques are used that lead to a better approximation ratio. We also consider the continuous version of the problem where the gardener travels in a metric space between plants and cuts down a plant each time he reaches one. We show that on the star graph the previously proposed algorithm Reduce-Fastest is a 6-approximation and the known Deadline-Driven Strategy is a (3 + 2√2)-approximation. the Deadline-Driven Strategy is also a (9 + 2√5)-approximation on star graphs with multiple plants on each branch. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Human Action Recognition for Quality Control in Industrial Environments 6

Unsupervised Human Action Recognition for Quality Control in...

引用

6th IEEE international conference on Artificial Intelligence in Engineering and Technology, IICAIET 2024

作者： Vexo, Wetu Jeenanunta, Chawalit Chanyachatchawan, Sapa Tunpan, Apinun Sirimarnkit, Nisit School of Management Technology Sirindhorn International of Technology Thammasat University Phatum Thani Thailand National Electronics and Computer Technology Center National Science and Technology Development Agency Phatum Thani Thailand Smart Sense Industrial Design Co. Ltd Bangkok Thailand

ISBN: (纸本)9798350389692

Ensuring robust and efficient quality control in industrial environments is critical as automation and artificial intelligence continue to advance. Human action recognition (HAR) plays a vital role in monitoring and maintaining the accuracy and safety of industrial processes. Traditional HAR methods rely on supervised learning, requiring extensive labeled datasets, and are often impractical due to high costs and time constraints. this research addresses these gaps by proposing a hybrid model integrating Beta Variational Autoencoders AE) with various clustering algorithms to enhance unsupervised human action recognition in industrial environments. the method begins with extracting 2D keypoints from video data using MediaPipe, a powerful tool for keypoint detection. these keypoints are then processed through a β-VAE to extract a latent space representation, capturing the essential features of the actions. Various clustering algorithms, including K-means, DBSCAN, spectral clustering, hierarchical clustering, and mean shift, are applied to the latent space to group similar actions. Evaluation of these clustering methods shows that hierarchical clustering performs the best, achieving an accuracy of 91.67%, indicating that the approach effectively groups similar actions, enhancing the reliability of HAR systems in industrial environments. © 2024 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Research on automatic vehicle lane changing model based on MASAC-discrete algorithm 6

Research on automatic vehicle lane changing model based on M...

引用

6th international conference on Advanced Electronic Materials, Computers, and Software Engineering, AEMCSE 2023

作者： Liu, Qi Hu, Xiaohui Li, Shaobing School of Electronic and Information Engineering Lanzhou Jiaotong University Lanzhou730070 China

ISBN: (纸本)9781510668249

Reinforcement learning has great potential in solving complex decision-making problems in autonomous driving, especially in traffic scenarios where autonomous and human driving vehicles are mixed. this article describes the lane changing problem of mixed traffic expressway vehicles as a multi-Agent reinforcement learning problem, in which autonomous vehicles learn a strategy adapted to human driving vehicles through collaboration to maximize traffic throughput. this article extends the SAC-discrete algorithm to the multi-Agent reinforcement learning framework and proposes the MASAC-discrete algorithm. In addition, this article also proposes a motion prediction safety controller that includes a motion predictor and motion replacement module to ensure driving safety during training and testing. this article trains, evaluates, and tests the proposed method on a highway simulator under three different levels of traffic modes. the simulation results show that even in high traffic density situations, this method can significantly reduce collision rates while maintaining high efficiency. In the considered highway scenarios, its performance is superior to several state-of-theart benchmark algorithms. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Modeling and Simulation of Link 16 Message Distribution in Operational Applications 6

Modeling and Simulation of Link 16 Message Distribution in O...

引用

6th IEEE international conference on Electronic Information and Communication Technology, ICEICT 2023

作者： Tian, Wanyong Li, Fuqiang Chen, Chilian 20th Institute Key Laboratory of Technology on Data Link Xi'an China

ISBN: (纸本)9798350399059

Data link is an information system conforming to specified message formats and communication protocols that links combat units such as sensors, weapons, and command and control (C2) platforms. It could automatically share formatted tactical data, for instance, battlefield situation, command and guidance, tactical coordination and weapon control instructions among combat participants in real time. As a typical data link, Link 16 has been the major means of information dissemination in joint tactical operations of the US military, and has played an important role in all previous wars over the past decades. Link 16 is capable of achieving interoperability and realizing various tactical functions for all combat participants based on unified information distribution and processing mechanisms. this paper investigates message exchanging procedure and applies discrete event system specification (DEVS) method in modeling and simulation (M&S) of information distribution in air interception operations. the experimental results show that the method can be widely applied to modeling information distribution with good scalability. It is able to provide technical reference for subsequent information processing optimization. © 2023 IEEE.

关键词： Information dissemination

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：