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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

15,887 篇 partitioning alg...
4,717 篇 clustering algor...
3,101 篇 algorithm design...
1,677 篇 computer science
1,305 篇 heuristic algori...
1,139 篇 data mining
905 篇 computational mo...
756 篇 optimization
752 篇 hardware
746 篇 costs
722 篇 image segmentati...
665 篇 iterative algori...
601 篇 parallel process...
582 篇 testing
579 篇 approximation al...
563 篇 routing
510 篇 computer archite...
478 篇 concurrent compu...
467 篇 very large scale...
444 篇 application soft...

机构

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 篇 university of ch...
15 篇 department of co...
15 篇 department of el...

作者

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,733 篇 英文
119 篇 其他
32 篇 中文

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

共 15887 条记录，以下是891-900 订阅

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

详细简洁

排序：

Rule-Based Constraint Elicitation For Active Constraint-Incremental Clustering

Rule-Based Constraint Elicitation For Active Constraint-Incr...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Aymeric Beauchamp Thi-Bich-Hanh Dao Samir Loudni Christel Vrain LIFO EA 4022 University of Orléans INSA Centre-Val-de-Loire Orléans France TASC (LS2N-CNRS) / GREYC IMT Atlantique / University of Caen Normandy Nantes France

ISBN: (数字)9798331527235

ISBN: (纸本)9798331527242

Constrained clustering algorithms integrate user knowledge as constraints in the clustering process to guide it towards a desired outcome. When interacting with users, it is essential to quickly ask simple questions to identify informative constraints that will efficiently enhance an initial partition. We propose a new active query strategy for incremental clustering that translates user feedback into interpretable decision rules and identifies relevant points for queries using rule-based heuristics Experiments on benchmark datasets highlight the benefits of our new approach, making it suitable for real-world applications.

关键词： Clustering algorithms Benchmark testing partitioning algorithms Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

HW/SW Co-Design of the Secure Hash Function SHA-256

HW/SW Co-Design of the Secure Hash Function SHA-256

引用

International Conference on Advanced Electrical Engineering (ICAEE)

作者： M. Issad N. Anane N. Guenfoud M. Debyeche Centre de Développement des Technologies Avancées CDTA Alger Algérie Université des Sciences et Technologies Houari Boumediene Bab Ezzouar

ISBN: (数字)9798350349351

ISBN: (纸本)9798350349368

Technological developments in data communication has increased the integration cryptographic algorithms. Hash functions are used in many security schemes such as digital signature/verification and block chain network. Secure Hash Algorithm-256 (SHA-256) is an irreversible hash function. Its algorithm is not only fast, but also provides a high security service. However, in terms of computations complexity, it requires a huge amount of arithmetic operations. This paper presents the implementation of SHA-256 core in reconfigurable FPGA circuit. Our work is based on Programmable System on Chip (PSoC) architecture. The Xilinx Microblaze processor is used for the system flexibility. The SHA-256 algorithm is composed by two steps, namely, the padding operation and the hash computation process to produce the 256-bit message digest. The proposed Hardware/Software (HW /SW) partitioning consists in the execution of the padding step in SW whereas the hash computation is implemented in HW within the SHA-256 core. The implementation results on Virtex-5 circuit show that a 512-bit message digest runs in 2.083 us. The PSoC hardware architecture requires 4058 Slices.

关键词： Hash functions Electrical engineering Computer architecture Hardware System-on-chip partitioning algorithms Blockchains Data communication Computational complexity Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Network Routing Based on Node Sociality and Location Information

Opportunistic Network Routing Based on Node Sociality and Lo...

引用

International Conference on Computer Supported Cooperative Work in Design

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

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Opportunistic network nodes exhibit social attributes, and existing community routing algorithms are currently designed for situations where the community structure remains fixed and do not comprehensively analyze the impact of node location information on data forwarding. Over time, the community division results do not match the current network topology structure, and it becomes challenging to select appropriate relay nodes for forwarding. In order to solve this problem, this paper proposes a community routing based on node location information-CRLI. Firstly, the communities are partitioned based on node interaction information, and then the regional affiliation and regional connectivity are defined. Based on these, the CRLI algorithm is designed to comprehensively analyze the influence of node location, movement direction, and dynamic changes in community structure on data forwarding. The experimental results show that the CRLI algorithm can effectively improve the message delivery rate and reduce overhead.

关键词： Epidemics Network topology Federated learning Heuristic algorithms Routing partitioning algorithms Relays

来源：评论

学校读者我要写书评

暂无评论

Unveiling the Power of Neural Program Synthesis in High Level Code Generation

Unveiling the Power of Neural Program Synthesis in High Leve...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： Gurram Kumar Sai Koganti Sri Sai Harshith Kucharlapati Akash Varma G. Yashwanth Kiran J Swaminathan Department of Computer Science and Engineering Amrita Vishwa Vidyapeetham Amritapuri India

ISBN: (数字)9798350370249

ISBN: (纸本)9798350370270

In this research, we delve into a transformative exploration of the realm of code generation, unveiling three fundamental modules that constitute the backbone of our study: the Text-to-Code Generation Model, Code Autocompletion Model, and the formidable Neural Program Synthesis Model. At the forefront of our investigation, we underscore the paramount importance of Neural Program Synthesis—a dynamic force adept at crafting custom programs from input-output examples. Our exploration delves into the intricate landscape of natural language-to-code generation, offering profound insights and invaluable contributions to the field. The ability to automatically generate code from natural language instructions holds immense significance in streamlining software development processes, reducing manual effort, and enhancing productivity. Furthermore, this research addresses a pressing need within the software engineering community for efficient methods of code generation, particularly in domains where human-program interaction is prevalent. Through rigorous experimentation and meticulous analysis, we shed light on methodologies and promising avenues for future research in this burgeoning domain, paving the way for advancements in automated software development and programming assistance tools.

关键词： Training Adaptation models Codes Recurrent neural networks Programming partitioning algorithms Python Testing Software development management Software engineering

来源：评论

学校读者我要写书评

暂无评论

Open Service for Networking Systems of AI: A Case Study in Adaptation Optimization

Open Service for Networking Systems of AI: A Case Study in A...

引用

IEEE World Forum on Internet of Things (WF-IoT)

作者： Bobo Ju Kun Yang Yang Liu Jing Liu Peng Sun Wei Ni Liang Song Academy for Engineering & Technology Fudan University Shanghai China Innovation Platform for Academicians of Hainan Province Haikou China Department of Computer Science University of Toronto Toronto Ontario Canada School of Information Science and Technology Fudan University Shanghai China Division of Natural and Applied Sciences Duke Kunshan University Suzhou China Shanghai East Bund Research Institute on NSAI Shanghai China

ISBN: (数字)9798350373011

ISBN: (纸本)9798350373028

Under the architecture of Networking Systems of AI (NSAI), we propose a three-tier edge computing platform called Open Service for NSAI (OpenSAI), which can jointly configure the application execution and compute-storage-network resources, for online application-network adaption, to ensure the efficiency and reliability of the services. In this research, we investigate a specific task-device adaptation optimization problem in OpenSAI, which recommend application tasks to distributed computing devices. We evaluate the performance of various optimization and search algorithms in recommending optimal task-device combinations, which show significant differences among the algorithms in terms of recommendation runtime costs and task adaptability. Overall, the hybrid recommendation of SCORE Algorithm, Particle Swarm Optimization, and Item-Item Collaborative Filtering demonstrates the best performance in both time efficiency and fitness scores across multiple scenarios.

关键词： Performance evaluation Runtime Scheduling algorithms Heuristic algorithms Collaboration Computer architecture Reliability engineering partitioning algorithms Artificial intelligence Optimization

来源：评论

学校读者我要写书评

暂无评论

A Fair Scheduling Algorithm and Schedulability Analysis for Performance Asymmetric Multiprocessors

A Fair Scheduling Algorithm and Schedulability Analysis for ...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Peng Wu Feihang Jin Tao Yan Institute of Big Data Science and Industry Shanxi University Taiyuan China School of Computer and Information Technology Shanxi University Taiyuan China Institute of Big Data Science and Industry School of Computer and Information Technology Taiyuan China

ISBN: (数字)9798350340266

ISBN: (纸本)9798350340273

We propose a new scheduling policy for performance asymmetric multiprocessors that have identical instruction sets but different processing speeds. The difference between it and the original Pfair scheduling is that when selecting scheduling parameters such as the pseudo deadline of the subtask and selecting the processor when running the highest priority subtask, it can be aware of the performance asymmetry of the underlying processor. In addition, we also propose a sufficient schedulability test for Pfair scheduling on performance asymmetric multiprocessors.

关键词： Schedules Job shop scheduling Processor scheduling Scheduling algorithms Instruction sets partitioning algorithms Time factors

来源：评论

学校读者我要写书评

暂无评论

Research on Cloud Security Protection Based on Microisolation Technology

Research on Cloud Security Protection Based on Microisolatio...

引用

Electronic Information Engineering and Computer Technology (EIECT), International Conference on

作者： Shiyong Dai Jinhua Huang Yulong Wu Xuxian Wang Huiying Lu Wenqian Xu Yixin Jiang Yunan Zhang Electric Power Research Institute of Guangdong Power Grid Co. Ltd Guangzhou China Joint Laboratory on Cyberspace Security CSG Guangzhou China CSG Electric Power Research Institute Co. Ltd Guangzhou China Guangdong Provincial Key La-boratory of Power System Network Security Guangzhou China

ISBN: (数字)9798331528850

ISBN: (纸本)9798331528867

Cloud computing technology is becoming more and more popular in enterprises, but it also breaks the traditional partition mode of enterprises. Starting from the importance of microisolation technology in cloud resource protection, this paper analyzes the key technologies and implementation principles of microisolation application in cloud security protection scenarios, and studies and designs the architecture of microisolation technology. Use the support vector machine algorithm to analyze the security status between microisolation areas, thus forming a microisolation strategy model. Through the analysis of the actual case of power enterprises using microisolation technology, it shows that microisolation technology significantly improves and protects cloud security network security. Compare the application prospects of microisolation technology in private cloud, public cloud and hybrid cloud respectively.

关键词： Support vector machines Cloud computing security Electricity Urban areas Power quality Network security Market research partitioning algorithms Personnel Protection

来源：评论

学校读者我要写书评

暂无评论

Partitionable Task Offloading for Intelligent Ship-assisted Maritime Edge Computing Networks

Partitionable Task Offloading for Intelligent Ship-assisted ...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Shuang Qi Bin Lin Xiaoyu Zhang Lue Yang Information Science and Technology College Dalian Maritime University Dalian China

ISBN: (数字)9798350378412

ISBN: (纸本)9798350378429

Camera-equipped unmanned aerial vehicles (UAVs) can provide instant maritime visual data, playing a crucial role in maritime safety, environmental monitoring, and resource management. By integrating mobile edge computing (MEC) servers onboard UAVs, video data can be pre-processed and analyzed on-site, significantly reducing the volume of data transmission and response time. However, the limited computing capacities of UAVs pose significant challenges to the efficiency of task execution. Benefiting from the cooperation of multiple intelligent ships (ISs), the partitionable tasks with a large data size can be divided into multiple subtasks of different sizes and executed by different ISs. In this paper, we investigate the ISs assisted maritime computing (ISMC) network consisting of one UAV and multiple ISs. Then, we aim to minimize the maximum delay among all subtasks under the energy constraint of the UAV by jointly optimizing the division ratio of subtasks and the transmit power of the UAV. Since the formulated optimization problem is typically hard to solve due to its non-convexity, we propose an effective iterative algorithm by breaking it into two subproblems. Numerical simulation results show the effectiveness of the proposed algorithm with various performance parameters.

关键词： Visualization Autonomous aerial vehicles Numerical simulation Delays partitioning algorithms Safety Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Visual Sensor Denoising Method Based on Event Density Classification

A Dynamic Visual Sensor Denoising Method Based on Event Dens...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Qiangxiao Zhou Hai Xiong Yiheng Wang Yuhao Shen Long Cheng College of Computer Science and Artificial Intelligence WenZhou University Wenzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Dynamic Visual Sensors (DVS) output pixel information asynchronously as an address event, only transmitting information for pixels where the intensity change exceeds a threshold, thereby reducing redundant data generation at the source. They possess advantages such as low-latency response and high efficiency with low power consumption. However, factors such as thermal noise and leakage current can lead to noise events even when the light intensity remains constant, which affects image quality and subsequent processing. In this paper, we propose a new method for calculating event density called Local Density Segmentation (LSD), which divides events and their surrounding neighborhoods into different regions for independent event density calculation. Based on LSD-calculated event density, we further propose a denoising method named Local Density Segmentation K-means (LSD-K), which utilizes event density as a feature to select and remove noise events. Finally, through experiments, we validate the performance of our algorithm.

关键词： Visualization Thermal factors Heuristic algorithms Noise Noise reduction Clustering algorithms Thermal noise Sensors partitioning algorithms Voltage control

来源：评论

学校读者我要写书评

暂无评论

Enhancing Quantum Search: The Potential of Partitioned Grover's Algorithm

Enhancing Quantum Search: The Potential of Partitioned Grove...

引用

Innovative and Intelligent Information Technologies (IC3IT), International Conference on

作者： Ahcene Bounceur Saadat M. Alhashmi Mohamed Abdalla Nour Huseyin Seker University of Sharjah College of Computing and Informatics Sharjah UAE

ISBN: (数字)9798331541064

ISBN: (纸本)9798331541071

Grover's Algorithm is a prominent quantum search algorithm in the rapidly advancing quantum computing study. By exploiting superposition and quantum parallelism, it has the potential to outperform classical brute-force approaches. Nevertheless, the current practical application of quantum technology in decrypting intricate passwords is restricted by its early stage, namely the restricted qubit quantities and short coherence durations. This work presents an innovative distributed quantum computing paradigm that addresses these difficulties by partitioning the password search space among several quantum processors. Each processor executes Grover's Algorithm on a subset of the search space, minimizing the computational complexity and quantum resource requirements for each individual processor. The partial findings are subsequently transmitted to a central classical computer, which amalgamates them to obtain the ultimate password. This distributed methodology not only allows for practicality with current quantum systems but also provides a scalable paradigm that can adapt to the progress of quantum computer technology. By decomposing the quantum brute-force search problem into smaller, more controllable elements, this approach can significantly decrease the time complexity of password retrieval, which has significant consequences for cryptography and cybersecurity.

关键词： Quantum system Quantum computing Program processors Qubit Passwords Transforms Search problems partitioning algorithms Time complexity Standards

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：