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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,011 篇 会议
2,090 篇 期刊文献
5 册 图书

馆藏范围

5,106 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,231 篇 工学
- 2,021 篇 计算机科学与技术...
- 1,565 篇 软件工程
- 565 篇 信息与通信工程
- 485 篇 控制科学与工程
- 427 篇 电子科学与技术（可...
- 396 篇 电气工程
- 325 篇 机械工程
- 282 篇 生物工程
- 255 篇 光学工程
- 198 篇 仪器科学与技术
- 175 篇 化学工程与技术
- 164 篇 生物医学工程（可授...
- 154 篇 动力工程及工程热...
- 125 篇 材料科学与工程（可...
- 115 篇 交通运输工程
- 107 篇 土木工程
- 85 篇 建筑学
- 82 篇 安全科学与工程
1,732 篇 理学
- 923 篇 数学
- 456 篇 物理学
- 327 篇 生物学
- 257 篇 统计学（可授理学、...
- 197 篇 系统科学
- 172 篇 化学
838 篇 管理学
- 529 篇 管理科学与工程(可...
- 329 篇 图书情报与档案管...
- 164 篇 工商管理
143 篇 医学
- 120 篇 临床医学
- 97 篇 基础医学(可授医学...
106 篇 法学
- 83 篇 社会学
59 篇 经济学
53 篇 农学
26 篇 教育学
14 篇 艺术学
13 篇 军事学
8 篇 文学

主题

167 篇 laboratories
137 篇 feature extracti...
125 篇 computer archite...
107 篇 computer science
101 篇 computational mo...
90 篇 semantics
81 篇 training
76 篇 optimization
74 篇 accuracy
71 篇 data mining
70 篇 deep learning
67 篇 bandwidth
65 篇 hardware
64 篇 protocols
54 篇 clustering algor...
54 篇 delay
53 篇 neural networks
53 篇 predictive model...
51 篇 object detection
47 篇 image segmentati...

机构

183 篇 hubei province k...
134 篇 school of comput...
125 篇 department of co...
117 篇 key laboratory o...
115 篇 national enginee...
103 篇 college of compu...
99 篇 tianjin key labo...
87 篇 key laboratory o...
83 篇 college of compu...
75 篇 department of co...
72 篇 key laboratory o...
67 篇 school of comput...
61 篇 university of ch...
60 篇 hubei province k...
59 篇 key laboratory o...
57 篇 college of infor...
56 篇 shandong provinc...
55 篇 school of softwa...
50 篇 services computi...
47 篇 key laboratory o...

作者

107 篇 hai jin
45 篇 xiaowei li
40 篇 shen linlin
36 篇 dan feng
35 篇 zhang hua
32 篇 jin hai
28 篇 zhou mengchu
28 篇 huawei li
25 篇 ren jiadong
24 篇 wang chundong
22 篇 liu jun
21 篇 li peng
20 篇 changjun jiang
20 篇 yu hu
19 篇 wang lei
19 篇 zhang xiaolong
19 篇 cui zhihua
19 篇 hu shengshan
19 篇 wang wei
18 篇 wei hu

语言

4,500 篇 英文
387 篇 其他
233 篇 中文
1 篇 日文

检索条件"机构=Computer and System Technology Laboratory"

共 5106 条记录，以下是331-340 订阅

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

详细简洁

排序：

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme with Fast Encryption and Outsourced Decryption for IoT 24th

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme ...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Huang, Yao Yu, Zhongyuan Wang, Guijuan Chai, Baobao Zhang, Hongliang Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250353 China School of Information Science and Engineering Lanzhou University Lanzhou730000 China School of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

ISBN: (纸本)9789819615414

Many sophisticated cloud platforms are available to provide services such as storage and computation for Internet of Things (IoT) applications. However, with the concerns about the semi-trusted nature of cloud platforms, data security and privacy have been gaining broad attention. In this paper, we propose a blockchain-assisted verifiable data sharing scheme (BAV-DSS) for IoT. The BAV-DSS features fine-grained access control, fast encryption, and outsourced decryption with verifiability. Specifically, with the application of ciphertext-policy attribute-based encryption (CP-ABE), flexible access control is enabled. Blockchain is employed to store public keys, generate account addresses, and perform data verification. Furthermore, the selective replayable chosen ciphertext attacks (sRCCA) security of BAV-DSS is proved, and the simulation results indicate that BAV-DSS obtains high efficiency and practicality compared to other schemes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

MBTDiff: Multi-segmentation Brain Tumor Model with Diffusion Probabilistic Model 9

MBTDiff: Multi-segmentation Brain Tumor Model with Diffusion...

引用

9th International Conference on Image, Vision and Computing, ICIVC 2024

作者： Zeng, Shuqi Liu, Jun Xu, Ji Luo, Yuan School of Computer Science and Engineering Wuhan Institute of Technology Wuhan China Key Laboratory of Biomarkers and In Vitro Diagnosis Translation Zhejiang province Hangzhou China Hubei Engineering Research Center for Intelligent Digital Technology in New Power System Hubei Central China Technology Development of Electric Power Co. Ltd Wuhan China

ISBN: (纸本)9798350385991

The diffusion probability model has recently garnered remarkable achievements in image generation, emerging as a prominent research focus within computer vision. It has been observed through numerous studies that the diffusion probability model holds potential for application across various domains within computer vision. Drawing inspiration from these models, we present a novel approach to extend their utility to the realm of brain tumor medical image segmentation. Our method entails training the model utilizing a diffusion framework, followed by iterative refinement of segmentation outcomes by incorporating additional encoding layers and decoders. This method employs an end-to-end training approach without relying on pre-trained backbone networks. Given the probabilistic nature of the results generated by the diffusion model and to simulate the actual decision-making process of doctors, we will generate multiple segmentation results and apply denoising techniques to obtain a stable output. These results will then be integrated into the final segmentation map to achieve more precise segmentation. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Low Energy Consumption and Time Deterministic Energy-saving Workflow Task Scheduling Algorithm based on DVFS 9

Low Energy Consumption and Time Deterministic Energy-saving ...

引用

9th IEEE International Conference on Cyber Security and Cloud Computing and 8th IEEE International Conference on Edge Computing and Scalable Cloud, CSCloud-EdgeCom 2022

作者： Liu, Xun Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665480666

ISBN: (纸本)9781665480666

With the development of streaming media, soft real-time system in today's life could participate in the use of more extensive areas. The use frequency was also increasing. Consequently, modern processors were equipped with software control mechanisms such as DVFS (Dynamic Voltage Frequency Scaling) to allow operating systems to meet required performance while reducing power consumption. Therefore, we propose a task scheduling algorithm combined DVFS technology and time deterministic cyclic scheduling to achieve energy saving effect. First, the algorithm needed to minimize the preemption between tasks to reduce latency, so we created a buffer to save periodic tasks to avoid preemption. Second, to reduce the computational cost of the scheduling scheme, a scheduling template were designed to perform tasks. In this paper, the scheduling of periodic tasks, task scheduling would be designed when the task scheduling template would be fixed length. Besides, this algorithm supported that task could adopt appropriate voltage and frequency through DVFS technology in idle time under the condition of satisfying task dependence. Experimental analysis showed that the proposed algorithm could effectively reduce the system energy consumption while ensuring the completion of the task. © 2022 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Mining Alarm Association Rules in Optical Transmission Networks Using a Statistical Approach 24

Mining Alarm Association Rules in Optical Transmission Netwo...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Deng, Miao Li, Peng Liu, Yu Zhu, Rongjing Zhang, Yujie School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

Due to the interconnection between devices in the optical transmission network (OTN), when one device fails and generates alarm information, a large number of other invalid alarms are generated in OTN. How to mining association rules in alarm data is an important problem. In this paper, we investigate the association rules mining problem based on a statistical method. First, we remove the chattering alarm in preprocess to reduce data redundancy. Second, we propose a statistics-based association rule mining algorithm. We use a sliding time window to scan the alarm data, and we exploit the matrix to record the corresponding results. According to the matrix, we calculate the support and confidence of association rules. Compared with other traditional association rule mining algorithms, the proposed algorithm does not need to set the minimum support artificially, and the obtained association rules have strong causality. Through extensive experiments on syn-thetic and real OTN alarm datasets, we verify the effectiveness of our proposed algorithm and the correctness of the obtained association rules. © 2022 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Time Series Data Association Mining With High-Frequency Data Interference 24

Time Series Data Association Mining With High-Frequency Data...

引用

作者： Zhu, Rongjing Li, Peng Liu, Yu Deng, Miao School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

Time series data mining is an important problem in data mining. It discovers the intrinsic correlation rules by analyzing a large amount of time series data. However, high-frequency data may exist in the dataset. High-frequency data is the data that occurs frequently in time series data, which will affect the mining of association rules. Traditional time series association mining tends to classify high-frequency data as correlated data because they co-occur too many times. In this paper, we propose the list mining framework to mine the association data by list co-occurrence to achieve the mining of massive data. We divide it into three phases, list generation phase, matrix generation phase, and rule generation phase. First, we create data lists based on time windows. Second, we create the initial count matrix, update the count matrix based on the list, and propose a GCPM algorithm to generate a conditional probability matrix based on the count matrix. Third, we propose a List Mining (LM) algorithm to generate the initial rules based on the conditional probability matrix and optimize the initial rules to get the final association rules. In addition, we weigh the rules according to the list mining method and propose a Weighted List Mining (WLM) algorithm to filter rules by reducing the weight of frequent item interference. The experimental results show that LM and WLM can effectively improve the accuracy of mining results. © 2022 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Two-sided Online Stable Task Assignment with Incomplete Lists and Ties in Spatial Crowdsourcing 19

Two-sided Online Stable Task Assignment with Incomplete List...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Huang, Weiyi Li, Peng Li, Bo Liu, Jing Nie, Lei Bao, Haizhou Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350346558

For the application of task assignment in crowdsourcing, previous research has focused on offline version or one-sided online version. Some of them draw extra attention to stability in task assignment. Our work extends a one-sided task assignment and its stable generalization. In particular, we present a two-sided online stable task assignment (TS-OSTA) problem in which any vertex from two sides can maintain an incomplete neighbor list and ties. We first give the fundamental definitions of task assignment in spatial crowdsourcing and stable matching. Then, we analyze and present the matching condition and formulate the TS-OSTA problem. As a warm-up, we investigate and analyze two classical baseline algorithms Greedy and Random Threshold. Then we present a bipartite ranking algorithm that maintains the efficiency of Greedy and effectiveness of Random Threshold. Through extensive experiments, we examine the performance of our algorithm in size, memory, and time. The results show that our algorithm performs better than the baselines. © 2022 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Research on low energy task allocation and scheduling algorithm based on imprecise heterogeneous multi-core technology

Research on low energy task allocation and scheduling algori...

引用

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Gu, Haonan Wu, Jing Hu, Wei Ma, Tianao Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

In heterogeneous embedded systems, we try to find a new non real-time scheduling algorithm, which can not only meet the reliability requirements, but also achieve low energy consumption. 'Resource reservation time deterministic cyclic scheduling (RRTDCS)' algorithm is a kind of scheduling for offline cache pre-allocation. This scheduling algorithm combines time reservation and priority strategy. The algorithm can dynamically adjust according to different task sets. It can also adjust its own scheduling process to adapt to different scheduling environments. The periodic cyclic strategy enables low power consumption in task allocation. In the experimental part, we compared the algorithm proposed in this paper with the current mainstream real-time scheduling scheme. Experimental results show that RRTDCS algorithm has better performance. © 2022 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Duration-Aware Task Assignment for Heterogeneous Mobility Users in Crowdsensing 25

Duration-Aware Task Assignment for Heterogeneous Mobility Us...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Liu, Zhiyuan Li, Peng Huang, Weiyi Wang, Jiahu Nie, Lei Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-Time Industrial System China

ISBN: (纸本)9781665405270

This paper investigates the duration-aware task assignment problem for heterogeneous mobility users in MCS (DTAH problem). There are two types of users in MCS, vehicle users and pedestrian users. The vehicle user gets to the task fast, but the task duration is short. Pedestrian user meets the task duration limit, but it takes a long time to reach the task. Given a set of tasks and two types of users, each user, and each task has a duration limit. The DTAH problem is how to assign tasks to maximize the utility of the system. We prove that the DTAH problem is NP-hard by reducing the weighted maximum set coverage problem to the DTAH problem. Then, we solve the problem from a pedestrian perspective and a vehicle perspective. From the pedestrian user perspective, we propose a pedestrian user task assignment (PTA) algorithm based on the Kuhn-Munkres algorithm. From the vehicle user perspective, we propose a greedy vehicle user task assignment (VTA) algorithm. We prove that the VTA algorithm can obtain the approximate ratio of 1-1/e to the optimal value. Finally, we design the heterogeneous user task assignment (HTA) algorithm based on these PTA and VTA algorithms. Extensive experiments have proved that our proposed HTA algorithm achieves more efficient performance than other comparison algorithms. © 2022 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Steel Surface Defect Detection Based on Improved YOLOv8 20

Steel Surface Defect Detection Based on Improved YOLOv8

引用

20th International Conference on Natural Computation, Fuzzy systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Zhang, Jichen Zhang, Zhi College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Hubei Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

There are some defects on the surface of steel that are difficult to detect, so we propose an improved algorithm based on YOLOv8 for detecting defects that are difficult to be detected. This improvement includes the introduction of an SPD module to minimize the problem of information loss due to downsampling;the addition of a small object detection head combined with EMA attention to further enhance the detection capabilities for small targets;the use of BiFPN to replace the original PANet, applying different weights to different features to strengthen feature fusion. Experiments were conducted on the NEU-DET dataset, and the algorithm improved mAP to 80.2%, an improvement of 3.9% over the baseline model. © 2024 IEEE.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Task Priority Aware Incentive Mechanism with Reward Privacy-Preservation in Mobile Crowdsensing 25

Task Priority Aware Incentive Mechanism with Reward Privacy-...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Wang, Jiahu Li, Peng Huang, Weiyi Chen, Zeqiang Nie, Lei Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-Time Industrial System China

ISBN: (纸本)9781665405270

In mobile crowdsensing, there are generally two types of tasks, popular tasks, and unpopular tasks. For popular tasks, many people can perform that task, and the budget is overallocated. For unpopular tasks, fewer or no one is willing to complete them. How to motivate users to complete different popularity tasks during their work time is a challenging problem. In this paper, we design a task priority-aware incentive mechanism to solve this problem. First, we use hierarchical clustering to classify tasks into different priorities by considering their budgets, deadlines, and density distribution. The higher the task priority, the higher the extra rewards and credits the participating users get. To motivate more users to perform unpopular tasks, we give high priority to unpopular tasks. Then, we propose a greedy algorithm that allows more users to do high-priority tasks. However, too many budget adjustments can cause most users to do unpopular tasks as users are obsessed with their income. To prevent users from all selecting high-priority tasks, we further propose a differential privacy-based algorithm to protect task priority and reduce users' attention to their income. This algorithm protects users' income and allows users to focus more on task characteristics, such as task distribution and task deadline. Through many experiments in the reality Roma dataset, we evaluate two proposed algorithms compared with other solutions. © 2022 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：