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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,492 篇 会议
1,260 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,755 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,647 篇 工学
- 1,935 篇 计算机科学与技术...
- 1,710 篇 电气工程
- 706 篇 信息与通信工程
- 556 篇 控制科学与工程
- 540 篇 软件工程
- 286 篇 机械工程
- 233 篇 仪器科学与技术
- 232 篇 电子科学与技术（可...
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 19 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
308 篇 理学
- 131 篇 系统科学
- 72 篇 数学
- 54 篇 物理学
- 28 篇 生物学
- 25 篇 地球物理学
- 12 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,755 篇 partitioning alg...
4,692 篇 clustering algor...
3,074 篇 algorithm design...
1,672 篇 computer science
1,286 篇 heuristic algori...
1,133 篇 data mining
892 篇 computational mo...
746 篇 hardware
743 篇 optimization
740 篇 costs
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
578 篇 approximation al...
575 篇 testing
559 篇 routing
505 篇 computer archite...
473 篇 concurrent compu...
459 篇 very large scale...
440 篇 shape

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
17 篇 department of co...
17 篇 school of electr...
17 篇 at and t bell la...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,617 篇 英文
105 篇 其他
32 篇 中文

检索条件"主题词=Partitioning Algorithms"

共 15755 条记录，以下是201-210 订阅

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

详细简洁

排序：

Machine Learning Model for Predicting Non-Performing Agricultural Loans in an Imbalanced Lending Environment

Machine Learning Model for Predicting Non-Performing Agricul...

引用

Computing and Information Technology (ICCIT-1441), 2020 International Conference on

作者： Mohamed Ahmed Elnaggar Mostafa Abd El Azeem Fahima A. Maghraby Computer Science Dept. College of Computing & Information Technology Arab Academy for Science Technology and Maritime Transport (AASTMT) Cairo Egypt

ISBN: (数字)9798350353839

ISBN: (纸本)9798350353846

Granting a variety of agricultural loans to clients is necessary to support both markets and the agricultural sector. There are many types of risks that affect the banking sector. The most common and important one is the credit risk. The prediction of agricultural credit risk (ACR) has become more important for credit-granting institutions. ACR models seek to predict rather the clients will default on a loan (bad applicant) or non-default (good applicant). Predicting agricultural credit is thus an important part of the decision-making process to consider and to approve loans by the bank. In this paper, we propose a None Performing Agricultural Loans model (NPALSM). We focus only on the binary classifications whether the loan will be default or not by using machine learning classification techniques to build a proactive model to deal with credit approval. Proposed NPALSM consists of oversampling technique to balance data distribution. Empirical results show that the use of methods of resampling the amount of data consistently improves the performance of the original imbalanced data and outperforms other existing base methods using Egyptian credit data from an agricultural bank in Egypt. The meta classifier extra tree algorithm produces the highest accuracy with, 0.97% after sampling.

关键词： Support vector machines Accuracy Computational modeling Training data Predictive models Prediction algorithms Data models Classification algorithms partitioning algorithms Random forests

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Outlier Detection algorithms in Agricultural IoT Datasets

Comparative Analysis of Outlier Detection Algorithms in Agri...

引用

Innovative Research in Applied Science, Engineering and Technology (IRASET),Conference on

作者： Ahmed Amamou Bilal Ben Mahria Younes Balboul Said Hraoui Computer Science Department National School of Applied Sciences Fes Morocco Computer Science Department Faculty of Science and Technology Fes Morocco Network and Telecommunications Department National School of Applied Sciences Fes Morocco

ISBN: (数字)9798331532970

ISBN: (纸本)9798331532987

This paper evaluates the efficiency of eleven outlier detection algorithms applied to three agricultural IoT datasets: Weather in Szeged, Greenhouse, and Crop Recommendation. It focuses on how data quality affects IoT systems' reliability in agriculture. The analyzed algorithms include statistical, distance-based, density-based, ensemble, and hybrid methods, and their ability to detect outliers is investigated using recall, precision, and F1-score. The results demonstrate that algorithm performance is influenced by dataset characteristics such as dimensionality, nonlinearity, and temporal dependencies. Isolation Forest (iForest) consistently outperformed other algorithms due to its non-parametric design and recursive partitioning. In contrast, algorithms like Cluster-Based Local Outlier Factor (CBLOF), K-Nearest Neighbors (KNN), and Gaussian Mixture Model (GMM) showed variable effectiveness depending on dataset features. The study emphasizes the need for selecting the appropriate outlier detection method tailored to specific agricultural datasets and recommends future research on hybrid models or deep learning approaches to enhance anomaly detection in agricultural IoT systems.

关键词： Deep learning Data integrity Clustering algorithms Forestry Nearest neighbor methods partitioning algorithms Internet of Things Anomaly detection Gaussian mixture model Meteorology

来源：评论

学校读者我要写书评

暂无评论

Advanced Graph-MLPs Distillation based on Global and Local Hyperbolic Geometry Learning

Advanced Graph-MLPs Distillation based on Global and Local H...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yao Guan Wenzhu Yan Ting Yuan Yanmeng Li Nanjing Normal University Nanjing China Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Graph Neural Networks (GNNs) have drawn great research attention for graph machine learning. However, graph learning techniques are extremely difficult for practical deployments in the industry applications owing to the scalability challenges incurred by data dependency. Although some works attempt to establish the known efficient MLPs with GNNs based on knowledge distillation (KD), they are primarily designed for graphs in Euclidean spaces, which can not provide the most powerful geometry for graph representation as numerous real- world graphs display a combination of Euclidean and Hyperbolic geometry. To achieve comprehensive expression for complex graph data with high efficiency, in this paper, we proposed a novel Advanced Graph-MLPs Distillation Framework (AGMDF) based on global and local hyperbolic geometry learning. The key point of our method is to fully exploit the complex graph with additional hyperbolic properties based on knowledge distillation. Specifically, the global cross-geometric knowledge fusion can exploit the compensation information learned from Euclidean view and Hyperbolic domain. Then, the local hyperbolic knowledge enhancement can employ prominent tree-likeness components among graph data to improve the graph representation ability. Thus, the distilled MLP model enjoys the high expressive ability of graph context-awareness based on global and local hyperbolic geometry learning. Extensive experiments show that AGMDF achieves competitive accuracy with GNNs and improves over stand-alone MLPs by 21.84% on average while inferring faster than GNNs across five benchmark datasets.

关键词： Geometry Manifolds Scalability Industry applications Signal processing algorithms Machine learning Signal processing Graph neural networks partitioning algorithms Speech processing

来源：评论

学校读者我要写书评

暂无评论

Design and testing of Hybrid Slime Mold Algorithm for Real-Time Adaptive Mobile Robot Path Planning in Dynamic Environments

Design and testing of Hybrid Slime Mold Algorithm for Real-T...

引用

Advancement in Computation & Computer Technologies (InCACCT), International Conference on

作者： Sachin Gupta Shivali Gupta Shaik Mohammed Raith Anand Kumar Salil Bharany Vishnu Kant Ch.Sandeep Department of Robotics and Control Engineering School of Electronics and Control Engineering Lovely Professional University Phagwara India Department of Chemistry School of Chemical Engineering and Physical Sciences Lovely Professional University Phagwara India Department of Computer Science and Engineering Lovely Professional University Phagwara Punjab India Chitkara University Institute of Engineering and Technology Chitkara University Rajpura India School of Computer Science and Artificial Intelligence SR University Warangal Telangana

ISBN: (数字)9798331543891

ISBN: (纸本)9798331543907

Dynamic path planning and collision prevention is one of the key tasks for autonomous vehicles in relation to dynamic movement of obstacles. In this paper, a novel hybrid approach based on integration of Slime Mold Algorithm (SMA), Triangle Inequality Principle (TIP), and Partition Method Strategy (PMS) for solution of this problem statement. The SMA algorithm is very flexible and adaptive by nature due to its biological working mechanism which is associated with TIP and PMS strategies in relation to their optimization and efficient path planning capabilities and robust solutions. This integrated module is tested in virtual environment and the results are compared with other updated algorithms such as A*, Genetic Algorithm (GA), and Particle Swarm Optimization (PSO) for the same static and dynamic environment. It has been observed from the results that this hybrid strategy significantly improves the path planning task several times than other algorithms in terms of multiple aspects. Under testing conditions, the path length was reduced to 25% than other algorithms in a dynamic environment. During this calculation, the computational efficiency of the system has been improved to 60% than conventional methods. The chances of collision have been improved to 34.23% especially in environment where the obstacles are moving. The capability of SMA has been improved due to the synergy between TIP and PMS. The dynamic and adaptive nature of this algorithm is suitable for various applications such as search-and-rescue operations, manufacturing units’ automation and other hazardous environment exploration.

关键词： Navigation Heuristic algorithms Virtual environments Path planning partitioning algorithms Safety Mobile robots Vehicle dynamics Testing Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Hypergraphic representation for adaptive quantum circuits

Hypergraphic representation for adaptive quantum circuits

引用

Quantum Communications, Networking, and Computing (QCNC), International Conference on

作者： Waldemir Cambiucci Regina Melo Silveira Wilson Vicente Ruggiero Dept. of Computing Engineering and Digital Systems University of São Paulo São Paulo Brasil

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

Adaptive quantum circuits enhance flexibility and efficiency over traditional static circuits by dynamically adjusting their structure and parameters in real-time based on intermediate measurement outcomes. This paper introduces a novel hypergraph representation for adaptive quantum circuits, where groups of gates are considered as participants of hyperedges. By incorporating these gate groups into hyperedges, we create an extended hypergraph that includes constraints usable during the partitioning process. This approach guides the partitioning to maintain groups of ports associated with classical operations, ensuring that the resulting partitions prioritize qubits involved in the same sections of classical operations inherent to the adaptive approach. We present a new hypergraph partitioning algorithm based as an extension of Fiduccia-Mattheyses heuristic, to support hypergraphs created from adaptive quantum circuits. Comparative analysis between static and adaptive methods demonstrates the effectiveness of the proposed hypergraph techniques for adaptive circuits. Experimental results using benchmark quantum circuits validate our theoretical insights, showing improvements in circuit representation for partitioning heuristics. These findings highlight the practical benefits of hypergraph representation in adaptive quantum computing.

关键词： Adaptive systems Atmospheric measurements Heuristic algorithms Qubit Logic gates Benchmark testing Particle measurements Real-time systems partitioning algorithms Quantum circuit

来源：评论

学校读者我要写书评

暂无评论

Improved Reinforcement Learning Path Planning Algorithm

Improved Reinforcement Learning Path Planning Algorithm

引用

Intelligent Systems (ETIS), Emerging Technologies for

作者： S. Anu Santhiya N. Janavee B. Yazhini K. Subramanian Department of ECE National Engineering College (Affiliated by Anna university) Kovilpatti India

ISBN: (数字)9798331507541

ISBN: (纸本)9798331507558

The topic on coverage path planning (CPP) for multiple cooperative mobile robots using a “partition and cover” approach with Voronoi partitioning to prevent task duplication. By incorporating geodesic-distance-based and Manhattan-distance-based Voronoi generalizations, partition continuity is ensured even in the presence of obstacles, avoiding coverage gaps. The area is divided into $\mathbf{2}\mathbf{D} \ast \mathbf{2}\mathbf{D}$ grids, where D represents the robot's footprint size. The proposed partitioning method eliminates coverage gaps and overlaps, as demonstrated by two single-robot CPP techniques: Boustrophedon decomposition and Spanning Tree coverage. Validation is done through simulations and experiments.

关键词： Base stations Navigation Robot kinematics Reinforcement learning Path planning Land vehicles partitioning algorithms Mobile robots Vehicle dynamics Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Word Break on SLP-Compressed Texts

Word Break on SLP-Compressed Texts

引用

Data Compression Conference (DCC)

作者： Rajat De Dominik Kempa Department of Computer Science Stony Brook University Stony Brook NY USA

ISBN: (数字)9798331534714

ISBN: (纸本)9798331534721

Word Break is a prototypical factorization problem in string processing: Given a word $w$ of length $N$ and a dictionary $\mathcal{D}=\{d_{1},\ d_{2},\ \ldots,\ d_{K}\}$ of $K$ strings, determine whether we can partition $w$ into words from $\mathcal{D}$ . We propose the first algorithm that solves the Word Break problem over the SLP-compressed input text $w$ . Specifically, we show that, given the string $w$ represented using an SLP of size $g$ we can solve the Word Break problem in $\mathcal{O}(g\cdot m^{\omega}+M)$ time, where $m=\max_{i=1}^{K}\vert d_{i}\vert M=\sum_{i=1}^{K}\vert d_{i}\vert$ , and $\omega\geq 2$ is the matrix multiplication exponent. We obtain our algorithm as a simple corollary of a more general result: We show that in $\mathcal{O}(g\cdot m^{\omega}+M)$ time, we can index the input text $w$ so that solving the Word Break problem for any of its substrings takes $\mathcal{O}(m^{2}\log N)$ time (independent of the substring length). Our second contribution is a lower bound: We prove that, unless the Combinatorial $k$ -Clique Conjecture fails, there is no combinatorial algorithm for Word Break on SLP-compressed strings running in $\mathcal{O}(g\cdot m^{2-\epsilon}+M)$ time for any $\epsilon > 0$ .

关键词： Lower bound Dictionaries Data compression partitioning algorithms Indexes

来源：评论

学校读者我要写书评

暂无评论

Fusion of Information in Multiple Particle Filtering in the Presence of Unknown Static Parameters

Fusion of Information in Multiple Particle Filtering in the ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Xiaokun Zhao Marija Iloska Yousef El-Laham Monica F. Bugallo Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY USA

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

An important and often overlooked aspect of particle filtering methods is the estimation of unknown static parameters. A simple approach for addressing this problem is to augment the unknown static parameters as auxiliary states that are jointly estimated with the time-varying parameters of interest. This can be impractical, especially when the system of interest is high-dimensional. Multiple particle filtering (MPF) methods were introduced to try to overcome the curse of dimensionality by using a "divide and conquer" approach, where the vector of unknowns is partitioned into a set of subvectors, each estimated by a separate particle filter. Each particle filter weighs its own particles by using predictions and estimates communicated from the other filters. Currently, there is no principled way to implement MPF methods where the particle filters share unknown parameters or states. In this work, we propose a fusion strategy to allow for the sharing of unknown static parameters in the MPF setting. Specifically, we study the systems which are separable in states and observations. It is proved that optimal Bayesian fusion can be obtained for state-space models with non-interacting states and observations. Simulations are performed to show that MPF with fusion strategy can provide more accurate estimates within fewer time steps comparing to existing algorithms.

关键词： Signal processing algorithms Estimation Approximation algorithms Particle filters Vectors Acoustics State-space methods partitioning algorithms Bayes methods Speech processing

来源：评论

学校读者我要写书评

暂无评论

String Partition for Building Long BWTs

String Partition for Building Long BWTs

引用

Data Compression Conference (DCC)

作者： Enno Adler Stefan Böttcher Rita Hartel Paderborn University Paderborn Germany

ISBN: (数字)9798331534714

ISBN: (纸本)9798331534721

Constructing the Burrows-Wheeler transform (BWT) for long strings poses significant challenges regarding construction time and memory usage. We enable the use of multi-string BWT construction algorithms to construct the BWT of a long string by partitioning it into shorter substrings using a prefix of the suffix array. We prove that except for a single run of sentinel symbols $, the BWT of the shorter substrings is equal to the BWT of the long string. The proposed partitioning idea is applicable to string collections of any alphabet.

关键词： Buildings Symbols Data compression Transforms partitioning algorithms Arrays

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Intra-Picture Coding Tools of Versatile Video Coding (VVC) Standard for 8K Video Resolution

Analysis of the Intra-Picture Coding Tools of Versatile Vide...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Altuğ Şimşek Günhan Dündar Electrical & Electronics Engineering Dept. Boğaziçi University Istanbul Türkiye

ISBN: (数字)9798331521165

ISBN: (纸本)9798331521172

Versatile Video Coding (VVC), standardized in 2022 as ITU-T Recommendation H.266, ISO/IEC 23090–3 and MPEG-I Part3, is the latest block-based hybrid video coding standard which claims to fulfill all the requirements of todays and tomorrow's video applications. VVC defines more tools to increase compression efficiency while maintaining the same level of quality. The tradeoff is the computational complexity. H.266/VVC, especially the intra-coding loop, is computationally very complex due to its nature of iteratively trying all possible QTMT partitioning tree alternatives with all options of compression technologies. In this paper, we focus on the intra-coding loop of VVC for 8K video and study the effects of technologies like MTS, LFNST, MIP etc. on the compression efficiency (bits), quality (Y-PSNR), and computational complexity (runtime). By switching off all those optional technologies, we observe 46.07% runtime gain with only 5.00% increase in bitrate, and 0.0423 dB decrease in Y-PSNR on average. Since this is a remarkable gain in complexity with a limited effect on efficiency and quality, this tradeoff can be taken into consideration for many 8K applications utilizing VVC.

关键词： Video coding Runtime ISO Standards Bit rate Transform coding Switches partitioning algorithms Computational complexity Standards Gain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：