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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

15,781 篇 partitioning alg...
4,701 篇 clustering algor...
3,074 篇 algorithm design...
1,672 篇 computer science
1,293 篇 heuristic algori...
1,136 篇 data mining
894 篇 computational mo...
748 篇 optimization
747 篇 hardware
741 篇 costs
723 篇 image segmentati...
660 篇 iterative algori...
590 篇 parallel process...
580 篇 approximation al...
575 篇 testing
560 篇 routing
505 篇 computer archite...
472 篇 concurrent compu...
459 篇 very large scale...
442 篇 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,643 篇 英文
104 篇 其他
32 篇 中文

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

共 15781 条记录，以下是831-840 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Network Routing Algorithm Based on Overlapping Communities and Communication Willingness

Opportunistic Network Routing Algorithm Based on Overlapping...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Gaofeng Zhang Yanhe Fu Gang Xu Xing Wang Jia Hao Ru Yi College of Computer Science Inner Mongolia University Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The movement of nodes in opportunistic networks exhibits characteristics of clustering and regularity. Consequently, routing algorithms based on communities have become a current research hotspot. However, existing community-based routing algorithms do not comprehensively analyze both the overlap of node communities and the impact of neighboring nodes on message transmission. To address this issue, this paper proposes a novel opportunistic routing algorithm called CWON, based on overlapping communities and communication willingness. First, we utilize the PercoMCV method to partition overlapping communities. Subsequently, we define the concept of communication willingness and design the CWON algorithm based on this concept. The CWON algorithm effectively addresses the problem of overlapping community partitioning and measures the importance of different neighboring nodes in message transmission. Our simulation results demonstrate that the CWON algorithm significantly enhances the success rate of message delivery while reducing routing overhead.

关键词： Epidemics Federated learning Simulation Clustering algorithms Routing partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Basketball Player Tracking Method Based on Multi-Feature Fusion

Research on Basketball Player Tracking Method Based on Multi...

引用

Image Processing, Electronics and Computers (IPEC), Asia-Pacific Conference on

作者： Meiheng Zhang College of General Education Harbin Huade University Harbin China

ISBN: (数字)9798350374407

ISBN: (纸本)9798350374414

Multi-object tracking is a hot topic in the field of computer vision, which is widely used in intelligent transportation, intelligent surveillance, autonomous driving, and other fields. With the rapid development of the sports industry, the problem of athlete tracking in sports has gradually attracted attention. Unlike pedestrian tracking in ordinary surveillance scenarios, athlete tracking in sports scenarios faces great challenges due to frequent occlusion, large pose changes, and the similar appearance of athletes. This article takes basketball player tracking as the research object, focusing on the methods of athlete detection and tracking. To address the problem of low accuracy due to the similarity of athletes’ appearance, this paper proposes a basketball player tracking algorithm based on multi-feature fusion. First, a multi-branch re-identification model for athletes is designed. The global branch learns the global semantic information of the athletes; the local branch horizontally partitions the body parts of the athletes to learn fine-grained features; the feature deletion branch deletes the most activated part of the features, forcing the network to learn the remaining significant features. Then, the features of the three branches are merged to improve the discriminability of the athletes. Finally, experiments are conducted on the dataset, and the results show that the proposed method achieves good performance.

关键词： Accuracy Pedestrians Surveillance Semantics Transportation Feature extraction Trajectory partitioning algorithms Time factors Sports

来源：评论

学校读者我要写书评

暂无评论

Clustering Routing Algorithm Based on Wireless Sensor

Clustering Routing Algorithm Based on Wireless Sensor

引用

Computer Communication, Networks and Information Science (CCNIS), International Conference on

作者： Peishun Ye Yulin University

ISBN: (数字)9798331507046

ISBN: (纸本)9798331507053

In the clustering routing algorithm of wireless sensor networks, how to select the appropriate cluster head is the key to affect the network life cycle. To solve this problem, this paper proposes a Game-oriented Clustering Routing Algorithm (GCRA). The GCRA algorithm divides the network area according to the optimal number of cluster heads, and each area adopts a mixed strategy game model to select cluster heads. Furthermore, that energy consumption of the network is balanced through a probability return to zero mechanism. The simulation results show that compared with LEACH and CROSS, GCRA can effectively reduce the network energy consumption and prolong the network lifetime.

关键词： Wireless communication Energy consumption Wireless sensor networks Information science Simulation Clustering algorithms Games Routing partitioning algorithms Game theory

来源：评论

学校读者我要写书评

暂无评论

Resource Optimized Task Offloading in Delay Sensitive Edge Networks

Resource Optimized Task Offloading in Delay Sensitive Edge N...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Nasif Fahmid Prangon Abdalaziz Sawwan Jie Wu Center for Networked Computing Temple University USA

ISBN: (数字)9798331520960

ISBN: (纸本)9798331520977

Task offloading is a popular approach in distributed systems to optimize resource usage by splitting the workload among devices in the network. This technique is effective in reducing the workload on individual devices, and helping achieve more efficient task execution by reducing execution time and conserving energy among devices. In this paper, we propose a novel method to evaluate task partitioning using a unique metric, effective processing rate (EPR) for edge networks with heterogenous devices. This unique approach focuses on simplifying task offloading based on the communication delay, task processing rate, and the energy available in each device. This approach also covers the impact of extending offloading beyond one-hop neighbors to two-hop neighbors and single-source versus multi-source offloading. We also discuss the willingness to help factor among one-hop and two-hop neighbors and its significance in task offloading performance. An effective strategy to meet these challenges is introduced and validated through theoretical analysis and extensive simulations.

关键词： Performance evaluation Analytical models Multi-access edge computing Computational modeling Collaboration Energy efficiency Delays partitioning algorithms Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

Online Partitioned Scheduling over RSU for Computation Offloading in Vehicular Edge Computing

Online Partitioned Scheduling over RSU for Computation Offlo...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Tanniru Abhinav Siddharth Kethu Sesha Sarath Reddy Joseph John Cherukara Deepak Gangadharan Computer Systems Group IIIT Hyderabad

ISBN: (数字)9798331517786

ISBN: (纸本)9798331517793

With advances in vehicular communications technology such as Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V), the computation of vehicular tasks has become distributed facilitated by computation offloading from the vehicular platform to road side units (RSUs) or the cloud infrastructure. In this work, due to communication overheads, we do not consider the cloud and only consider offloading horizontally across RSU nodes. However, the advantage of offloading depends upon how the tasks are scheduled across the RSUs. Unlike existing horizontal offloading works, this work explores the benefits of online task partitioned scheduling for computation offloading from multiple vehicles to RSUs or edge nodes. Specifically, we propose a new efficient timeslot-based online hybrid partitioned scheduling algorithm, which splits some tasks into subtasks and schedules them across RSU nodes while considering vehicle flow constraints. We compared and evaluated the effectiveness of our proposed hybrid partitioned scheduling algorithm with the fully partitioned algorithm. We also compared the performance of the aforementioned algorithms with an optimal scheduling algorithm utilizing several experiments conducted on a real-world vehicular dataset.

关键词： Vehicular and wireless technologies Schedules Scheduling algorithms Heuristic algorithms Vehicle-to-infrastructure Road side unit Optimal scheduling Dynamic scheduling partitioning algorithms Edge computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 80 81 82 83 84 85 86 87 88 89 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：