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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,455 篇 会议
1,287 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

15,745 篇 partitioning alg...
4,684 篇 clustering algor...
3,088 篇 algorithm design...
1,673 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
749 篇 hardware
735 篇 costs
724 篇 optimization
720 篇 image segmentati...
658 篇 iterative algori...
593 篇 parallel process...
576 篇 approximation al...
576 篇 testing
561 篇 routing
505 篇 computer archite...
477 篇 concurrent compu...
461 篇 very large scale...
444 篇 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...
18 篇 at and t bell la...
17 篇 department of co...
17 篇 school of electr...
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,591 篇 英文
122 篇 其他
32 篇 中文

检索条件"主题词=partitioning algorithms"

共 15745 条记录，以下是171-180 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deicide: Decomposing Complex Classes into Responsibility Modules

Deicide: Decomposing Complex Classes into Responsibility Mod...

引用

Working IEEE/IFIP Conference on Software Architecture

作者： Jason Lefever Yuanfang Cai Rick Kazman Ernst Pisch Drexel University Philadelphia USA University of Hawaii Honolulu USA

ISBN: (数字)9798331520908

ISBN: (纸本)9798331520915

Refactoring a large and complex class can be challenging, not only because the class aggregates many different responsibilities but also because of its potentially extensive impact on external classes. Although many extract class methods have been proposed, few support a holistic decomposition that can uncover multiple distinct responsibilities within a complex class, along with their system-wide impacts. Recent research highlights the need for such a holistic view before an organization can commit to redesigning and refactoring. To identify distinct responsibilities while minimizing internal and external impacts, we created Deicide, a new decomposition algorithm that uses an internal call graph, external usage patterns, and semantic similarity of identifiers to calculate a hierarchical set of cohesive clusters, each forming a responsibility module. We evaluated Deicide against three state-of-the-art extract class recommenders using 123 large, change-prone classes from 9 open-source projects. Our results show that the entities within the clusters identified by Deicide are more likely to be changed together and changed by the same group of developers, indicating de facto cohesive responsibilities. The implication is that refactoring based on Deicide’s recommendations would have minimal impact on the system, and these newly extracted classes would be able to evolve independently.

关键词： Codes Statistical analysis Software architecture Aggregates Semantics Software algorithms Clustering algorithms Organizations partitioning algorithms History

来源：评论

学校读者我要写书评

暂无评论

Difficulties of Cluster Analysis on Mixed-Type Variables

Difficulties of Cluster Analysis on Mixed-Type Variables

引用

International Russian Smart Industry Conference (SmartIndustryCon)

作者： Tina Rakic Lyudmila Gadasina Saint Petersburg State Uiversity Saint Petersburg Russia Center for econometrics and business analytics Saint Petersburg State Uiversity Saint Petersburg Russia

ISBN: (数字)9798331511241

ISBN: (纸本)9798331511258

Working with real data often involves clustering of mixed-type variable datasets, which is followed by certain difficulties resulting from lack of guidelines on the usage of clustering methods for mixed-type data. Instead of choosing the optimal method for mixed data clustering, this study aims to determine on which conditions do the specialized cluster analysis methods - hierarchical clustering using Gower's distance and ${k}$ -prototypes algorithm, produce similar partitioning results. Resulting clusterings were after compared with clusters attained by the usage of one-hot encoding technique for transforming categorical data into numerical values. To determine the degree of similarity between methods special metrics were used. Data used in this study is real data obtained from real estate sales advertisements in Saint Petersburg.

关键词： Measurement Industries Hands Clustering methods Prototypes Clustering algorithms Encoding partitioning algorithms Guidelines Business

来源：评论

学校读者我要写书评

暂无评论

Lightweight Clustered Federated Learning via Feature Extraction

Lightweight Clustered Federated Learning via Feature Extract...

引用

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

作者： Guanzhang Lao Xinglin Zhang Yun Li Yue-Jiao Gong South China University of Technology Guangzhou China University of Electronic Science and Technology of China Shenzhen China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Clustered federated learning (FL), which groups clients with similar data distributions for collaborative training, represents a pivotal technique within federated learning for effectively addressing the challenges posed by non-IID data on clients. Existing clustered FL algorithms typically endeavor to learn distribution similarities of clients iteratively or indirectly through representations like gradients and loss. This necessitates resource-intensive pre-training or multiple iterations to attain stable clusters, thereby incurring additional communication cost and computational overhead. To address the above issues, we propose lightweight Clustered Federated Learning via Feature Extraction (FECFL). FECFL adopts a simple but effective client representation, i.e., the features extracted from the clients’ data using identically initialized models without any pre-training, to perform efficient one-shot clustering. Moreover, client data distribution is often dynamic in practice. To tackle distribution shift, we embed a distribution monitoring mechanism in FECFL, enabling adaptive re-grouping for new distributions. Finally, we demonstrate the benefits of FECFL over the baselines by conducting experiments on various datasets and distributions.

关键词： Training Federated learning Heuristic algorithms Signal processing algorithms Clustering algorithms Signal processing Feature extraction partitioning algorithms Speech processing Monitoring

来源：评论

学校读者我要写书评

暂无评论

Experimental Study of Clustering Approaches for Text Embeddings

Experimental Study of Clustering Approaches for Text Embeddi...

引用

International Russian Smart Industry Conference (SmartIndustryCon)

作者： Polina Martynyuk Assistant of the Department ICS-6 Bauman Moscow State Technical University Moscow Russian Federation

ISBN: (数字)9798331511241

ISBN: (纸本)9798331511258

With the rapid growth of text data, effective automated analysis methods are essential. Text clustering helps uncover patterns and structure large datasets, but existing algorithms face challenges due to high-dimensional text representations from language models. This study compares clustering algorithms to evaluate their strengths, weaknesses and applicability. The research examines partition-based, hierarchical and density-based clustering, analyzing k-means, agglomerative clustering and DBSCAN on the 20Newsgroups dataset. Performance is assessed using key clustering quality metrics. Results show that k-means effectively captures data structure, while DBSCAN struggles with high-dimensional text data. The study highlights the impact of distance metrics on clustering outcomes and provides recommendations for improving algorithm performance in text analysis. This research is valuable for professionals in automated text processing and machine learning. It offers practical insights into selecting suitable clustering methods based on task requirements and data characteristics, enhancing text analysis in fields such as IT, marketing and analytics.

关键词： Measurement Industries Text analysis Machine learning algorithms Clustering algorithms Machine learning Natural language processing partitioning algorithms Faces Text processing

来源：评论

学校读者我要写书评

暂无评论

Research on Distribution Network Zoning Planning Method Based on Community Discovery Algorithm

Research on Distribution Network Zoning Planning Method Base...

引用

Electrical Automation and Artificial Intelligence (ICEAAI), International Conference on

作者： Yuchi Zhang Quanli Guo Graduate Department of Shenyang Institute of Engineering Shenyang China

ISBN: (数字)9798331506797

ISBN: (纸本)9798331506803

In order to solve the current grid division method's ability to cope with faults and lack of flexibility, the division method is studied. Firstly, the target network structure is optimized and the community discovery partition is used to partition the distribution network. The network simplification method and solution algorithm are studied. Secondly, the network is further divided by using the regional capacity load ratio. On this basis, according to the simulation of the fault, the reliability of the division results is verified, and the feasibility of the partition method is verified. It provides the possibility for the economy of urban distribution network transformation and improves the ability and flexibility of distribution network to cope with faults.

关键词： Substations Costs Power supplies Stability criteria Distribution networks Complex networks Power system stability Planning partitioning algorithms Reliability

来源：评论

学校读者我要写书评

暂无评论

Semantic Neuroanatomical Segmentation of Brain MRI Scans Using Pretrained SynthSeg Neural Network

Semantic Neuroanatomical Segmentation of Brain MRI Scans Usi...

引用

International Conference on Intelligent Control and Information Processing (ICICIP)

作者： Kaiya Baker-Adell Nian Zhang Max Denis Department of Mechanical Engineering University of the District of Columbia Washington D.C. USA Department of Electrical and Computer Engineering University of the District of Columbia Washington D.C. USA

ISBN: (数字)9798331516147

ISBN: (纸本)9798331516154

Deep 3D convolutional neural networks (CNNs) with trained algorithms have proven the possibility to distinctively partition brain regions to reduce manual division and expert labeling of neuroanatomical structures. Although many machine learning techniques implement this strategy, most can be time-consuming and quite difficult to interpret as contrast modeling with varying resolutions can be obscure upon differentiating across regions. SynthSeg, a 3D U-Net algorithm, contains the ability to segment scans in datasets of multiple modalities and a variety of target domains without the need to retrain as it is trained with preconstructed data derived from a general 3D U-Net model for volumetric segmentation, thus facilitating the analysis of large quantities of bioimaging data in short periods of time. This is made possible due to the randomization technique where the contrast and resolution of the preconstructed training data are selected randomly to increase deep learning performance and accuracy. Due to its ability to learn from fluctuating contrast and resolution types via the randomization technique, its segmentation robustness is maintained across datasets. SynthSeg can learn from pretrained designated labels for characterization of diverse populations to improve detection and diagnoses of a vast array of diseases. Using SynthSeg, a subset of the Child and Adolescent NeuroDevelopment Initiative (CANDI) dataset containing brain MRI volume for a single patient was used with its corresponding ground truth image to analyze and exhibit highly accurate predictive modeling within each scan. The average Dice index across all labels for the MRI volume is 0.80793, which indicates an almost perfect segmentation accuracy.

关键词： Solid modeling Accuracy Three-dimensional displays Magnetic resonance imaging Semantics Predictive models Brain modeling Robustness partitioning algorithms Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：