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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

629 篇 期刊文献
549 篇 会议
3 册 图书

馆藏范围

1,181 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

780 篇 工学
- 595 篇 计算机科学与技术...
- 522 篇 软件工程
- 189 篇 信息与通信工程
- 129 篇 生物工程
- 94 篇 电气工程
- 92 篇 生物医学工程（可授...
- 91 篇 控制科学与工程
- 72 篇 光学工程
- 64 篇 电子科学与技术（可...
- 46 篇 化学工程与技术
- 35 篇 机械工程
- 29 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 23 篇 建筑学
- 22 篇 材料科学与工程（可...
- 22 篇 安全科学与工程
447 篇 理学
- 231 篇 数学
- 149 篇 生物学
- 99 篇 统计学（可授理学、...
- 73 篇 物理学
- 57 篇 化学
- 43 篇 系统科学
237 篇 管理学
- 142 篇 管理科学与工程(可...
- 98 篇 图书情报与档案管...
- 55 篇 工商管理
87 篇 医学
- 71 篇 临床医学
- 64 篇 基础医学(可授医学...
- 40 篇 药学(可授医学、理...
- 31 篇 公共卫生与预防医...
33 篇 法学
- 24 篇 社会学
21 篇 农学
14 篇 经济学
6 篇 教育学
5 篇 军事学
2 篇 文学
1 篇 艺术学

主题

42 篇 feature extracti...
38 篇 deep learning
38 篇 training
36 篇 semantics
27 篇 computational mo...
26 篇 accuracy
25 篇 data models
23 篇 machine learning
23 篇 cloud computing
22 篇 big data
21 篇 predictive model...
17 篇 convolution
17 篇 security
17 篇 federated learni...
16 篇 visualization
15 篇 task analysis
15 篇 contrastive lear...
15 篇 correlation
15 篇 artificial intel...
15 篇 adaptation model...

机构

114 篇 college of compu...
93 篇 national enginee...
46 篇 school of big da...
36 篇 school of big da...
33 篇 college of compu...
31 篇 college of big d...
29 篇 college of compu...
28 篇 key laboratory o...
27 篇 shenzhen researc...
23 篇 school of comput...
22 篇 big data institu...
22 篇 college of compu...
19 篇 shenzhen institu...
17 篇 shenzhen univers...
16 篇 peng cheng labor...
16 篇 college of compu...
15 篇 guangdong provin...
14 篇 school of comput...
14 篇 state key labora...
14 篇 college of compu...

作者

34 篇 shen linlin
16 篇 li jianqiang
15 篇 huang joshua zhe...
14 篇 shi qingjiang
13 篇 linlin shen
12 篇 xiuhua li
12 篇 victor c. m. leu...
12 篇 jianqiang li
11 篇 li xiuhua
11 篇 jie chen
10 篇 gao can
10 篇 pan jeng-shyang
10 篇 leung victor c.m...
10 篇 xiaofei wang
10 篇 abduljabbar zaid...
9 篇 zhong ming
9 篇 tian chunwei
9 篇 jian-tao zhou
9 篇 lyu shen-huan
8 篇 qilin fan

语言

1,082 篇 英文
90 篇 其他
12 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=Big Data Institute College of Computer Science and Software Engineering"

共 1181 条记录，以下是131-140 订阅

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

详细简洁

排序：

Diversified Sequential Recommendation via Evolutionary Multi-Objective Transfer Optimization

Diversified Sequential Recommendation via Evolutionary Multi...

引用

Artificial Intelligence (CAI), IEEE Conference on

作者： Wei Zhou Xiaolong Luo Hongyue Bao Zexuan Zhu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China

ISBN: (数字)9798350354096

ISBN: (纸本)9798350354102

Sequential Recommendation (SR) intends to model user interests based on historical behavior sequences and suggest the next item. Most existing sequential models primarily focus on learning users’ preferences on the relevance objective of the target item. However, the investigation of personalized preferences on the diversity objective of SR results is usually ignored. Evolutionary algorithms have amply demonstrated effectiveness in solving multi-objective problems but encounter efficiency bottlenecks when applied to multi-objective recommendation tasks due to the limited scalability at the user level. To address the problem, this study proposes to facilitate diversified SR via a multi-objective transfer optimization algorithm, in which each optimization task corresponds to the recommendation for a target user. With the optimization knowledge of user preference transferred within and across tasks, the diversified SR of a set of users can synchronously proceed. The novelty of our proposed algorithm is fully utilizing the outstanding global search capability of evolutionary multi-objective optimization without hindering the efficiency of sequential models.

关键词： Scalability Evolutionary computation Task analysis Artificial intelligence Optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

International Conference on data engineering

作者： Xiaoou Ding Yida Liu Hongzhi Wang Chen Wang Yichen Song Donghua Yang Jianmin Wang School of Computer Science and Technology Harbin Institute of Technology National Engineering Research Center for Big Data Software EIRI Tsinghua University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2 m-l ) to O(1.5 m-1 ). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks.

关键词： data integrity Soft sensors Transforms data engineering Cleaning data governance data mining

来源：评论

学校读者我要写书评

暂无评论

TSDDISCOVER: Discovering data Dependency for Time Series data

TSDDISCOVER: Discovering Data Dependency for Time Series Dat...

引用

International Conference on data engineering

作者： Xiaoou Ding Yingze Li Hongzhi Wang Chen Wang Yida Liu Jianmin Wang School of Computer Science and Technology Harbin Institute of Technology National Engineering Research Center for Big Data Software EIRI Tsinghua University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Intelligent devices often produce time series data that suffer from significant data quality issues. While the utilization of data dependency in error detection and data repair has been somewhat beneficial, it remains inadequate in accurately representing the data quality of time series datasets. In recognition of the obvious characteristics inherent in time series data, we introduce a novel data dependency, termed TSDD. It effectively captures the contextual relationships embedded within multivariate time series, thereby enhancing the semantic richness of data quality representations. We analyze the complexity of both implication and consistency problems for TSDD reasoning, and develop TSDD discovery algorithm TSDDISCOVER, which consists of functional structure discovery, allowable error bound determination, and validation of TSDD patterns. Experimental results on real-life datasets verify TSDDISCOVER efficiently discovers high-quality TSDD patterns. In comparing the performance of TSDD-based error detection with several leading data quality constraints, our findings reveal that the former achieves an average improvement of 12% in accuracy and 30% in the F1 score over other dependency-based detection methods.

关键词： data integrity Time series analysis Semantics Maintenance engineering data engineering Cognition Cleaning

来源：评论

学校读者我要写书评

暂无评论

Model LEGO: Creating Models Like Disassembling and Assembling Building Blocks 38

Model LEGO: Creating Models Like Disassembling and Assemblin...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Hu, Jiacong Gao, Jing Ye, Jingwen Gao, Yang Wang, Xingen Feng, Zunlei Song, Mingli College of Computer Science and Technology Zhejiang University China Robotics Institute School of Computer Science Carnegie Mellon University United States Electrical and Computer Engineering National University of Singapore Singapore School of Software Technology Zhejiang University China State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China Bangsheng Technology Co. Ltd. China

With the rapid development of deep learning, the increasing complexity and scale of parameters make training a new model increasingly resource-intensive. In this paper, we start from the classic convolutional neural network (CNN) and explore a paradigm that does not require training to obtain new models. Similar to the birth of CNN inspired by receptive fields in the biological visual system, we draw inspiration from the information subsystem pathways in the biological visual system and propose Model Disassembling and Assembling (MDA). During model disassembling, we introduce the concept of relative contribution and propose a component locating technique to extract task-aware components from trained CNN classifiers. For model assembling, we present the alignment padding strategy and parameter scaling strategy to construct a new model tailored for a specific task, utilizing the disassembled task-aware components. The entire process is akin to playing with LEGO bricks, enabling arbitrary assembly of new models, and providing a novel perspective for model creation and reuse. Extensive experiments showcase that task-aware components disassembled from CNN classifiers or new models assembled using these components closely match or even surpass the performance of the baseline, demonstrating its promising results for model reuse. Furthermore, MDA exhibits diverse potential applications, with comprehensive experiments exploring model decision route analysis, model compression, knowledge distillation, and more. For more information, please visit https://***/. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Random Forest and Sobol Method Based data Center PUE Prediction 12

Random Forest and Sobol Method Based Data Center PUE Predict...

引用

12th IEEE International Conference on Information and Communication Networks, ICICN 2024

作者： Yan, Longchuan Luan, Zhaofang He, Ling Jiang, Congfeng Liu, Junming Xu, Chuanqi Zhang, Liangbin State Grid Corporation of China Information & Telecommunication Branch Beijing China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Information Technology Center Hangzhou Dianzi University Hangzhou China College of Big Data and Software Engineering Zhejiang Wanli University Ningbo China

ISBN: (纸本)9798350355802

data centers are critical infrastructures that support a multitude of business loads such as big data, artificial intelligence, and cloud computing. While providing the necessary computing power, the problem of high energy consumption in data centers has become a major obstacle limiting their scale-up, reliability and quality of service. Improving the power usage effectiveness (PUE) of data centers is an important way to improve the energy efficiency of data centers. With the development of theories and methods of machine learning, modeling, analysis and prediction of data center energy consumption using machine learning techniques has become a feasible option. In this study, several accurate PUE prediction models are constructed using neural networks and machine learning techniques for the PUE of a small air-cooled data center in actual operation, among which the mean absolute error of the optimal model reaches 0.29%. In addition, this paper also uses Random Forest and Sobol methods to model and conduct sensitivity analyses of key factors affecting data center PUE, revealing the relationship between data center operating parameters and PUE, and finding that the cooling system exhibits different energy consumption patterns under different IT equipment power conditions, which has a decisive impact on PUE. Based on these sensitivity analyses, we argue that for small air-cooled data centers, improving internal insulation and humidity is an important strategy for optimizing PUE. © 2024 IEEE.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Xabcd: A Better Model for Named Entity Recognition in Cyber Threat Intelligence 9

Xabcd: A Better Model for Named Entity Recognition in Cyber ...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Wang, Ruiqi Zheng, Zhiqiang Ao, Shengqin Fu, Yuxia Wang, Xuren Jiang, Zhengwei Xie, Gang School of Big Data and Computer Science Guizhou Normal University Guiyang China Information Engineering College Capital Normal University Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798350376548

Due to the ambiguity between naming entity nouns and daily usage nouns in cyber threat intelligence, such as hacker organizations, attack tools, and attack techniques, the understanding of their content heavily relies on cyber security knowledge. How to quickly and accurately extract named entities related to network security from multi-source texts has become a hot and difficult research topic in the current threat intelligence field. In this paper, a named entity recognition framework from cyber threat intelligence unstructured text is designed. For the business requirements in the field of cyber threat intelligence, this framework completely covers data acquisition, text classification, entity and relationship definition, entity and relationship analysis and modeling and ability application. The framework is available for experimental exploration of entity recognition technology for threat intelligence. In addition, this paper proposes an entity recognition model for cyber threat intelligence, Xabcd, based on data and feature knowledge. Based on open network security text corpus, Xabcd model obtained the key indicators such as precision, recall, and F1-score as 97.35%, 97.15% and 97.23% respectively, which are all higher than the baseline model levels, so the experimental results demonstrate the feasibility and effectiveness of the model. © 2024 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning 25

Generalizing Personalized Federated Graph Augmentation via M...

引用

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and data Mining V.1

作者： Liang Zhang Tao Long Yang Liu Lei Zhang Laizhong Cui Qingjiang Shi Shenzhen Research Institute of Big Data Shenzhen Guangdong China College of Computer Science and Software Engineering Shenzhen University Shenzhen Guangdong China Data Science Research Center Dukekunshan University Kunshan Jiangsu China School of Software Engineering Tongji University Yangpu Shanghai China

ISBN: (纸本)9798400712456

Federated learning (FL) enables the training of a global machine learning model among multiple local clients in a collaborative fashion without directly sharing the details of their data. Due to this advantage, it has been utilized in a wide range of applications where privacy is a critical concern and has attracted great attention for graph representation learning (GRL). Despite the offered advances, there still exist two major challenges in the FL for GRL across distributed graph data, including heterogeneity and complementarity. In order to tackle these challenges, a novel personalized federated graph augmentation (PFGA) framework is proposed in this work. Unlike existing techniques, it utilizes generative models as bridges to enable information sharing among clients, thereby facilitating the collaborative training of GRL models. Instead of directly using the generative model trained on each client individually, we aggregate them into the globally generative model to gain a global view of the entire graph, which effectively alleviates the heterogeneity and complementarity issues simultaneously. We formulate the training of the generative and GRL models as a min-max adversarial learning problem and theoretically prove the convergence. Furthermore, the effectiveness of the method is demonstrated using experimental results on six real-world datasets.

关键词： federated learning

来源：评论

学校读者我要写书评

暂无评论

Interference-Based Reliability and Capacity Analysis for IEEE 802.11 Broadcast Ad-Hoc Networks on the Highway 11

Interference-Based Reliability and Capacity Analysis for IEE...

引用

11th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2025

作者： Li, Zhijuan Wu, Xintong Li, Xiaokun Ma, Xiaomin Department of Computer and Big Data Heilongjiang University Harbin150080 China Postdoctoral Program of Heilongjiang Hengxun Technology Co. Ltd. Harbin150090 China School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China College of Science and Engineering Oral Roberts University TulsaOK74171 United States

ISBN: (纸本)9789897587450

Interference is a critical factor that degrades wireless network performance. In IEEE 802.11 wireless broadcast networks, hidden terminals and concurrent transmissions are the primary sources of interference due to the carrier sense multiple access (CSMA) mechanism. Therefore, analyzing the signal-to-interference-plus-noise ratio (SINR) distribution is essential for evaluating network performance, whose derivation relates to the transmission probabilities of hidden terminals and concurrent transmissions. In this study, we utilize the existing semi-markov process (SMP) model to calculate these transmission probabilities. Subsequently, we employ the Laplace transform to analyze the SINR distribution in IEEE 802.11 broadcast ad-hoc networks on highways. Based on the derived SINR distribution, we further evaluate the reliability and capacity. This approach can be readily extended to two-dimensional (2D) or three-dimensional (3D) scenarios by employing d-dimensional (1 ≤ d ≤ 3, dD) point process. Experimental results demonstrate that the proposed model achieves high accuracy under small to medium interference ranges. Additionally, the analysis remains highly accurate for receivers within 70 meters, even in scenarios with large interference ranges. Copyright © 2025 by SCITEPRESS - science and Technology Publications, Lda.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware UAVs Path Coverage for Critical Infrastructure Inspections 12

An Energy-Aware UAVs Path Coverage for Critical Infrastructu...

引用

12th International Conference on Advanced Cloud and big data, CBD 2024

作者： Wang, Yifan Zeng, Wei Li, Guanyu Xiong, Chenglong Wang, Zicheng Mao, Yingchi College of Computer Science and Software Engineering Hohai University Nanjing China Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing China Huaneng Lancang River Hydropower Co. CHINA HUANENG Group Kunming China Power China Kunming Engineering Co. Yunnan China

ISBN: (纸本)9798331511074

Critical infrastructures increasingly rely on unmanned aerial vehicles (UAVs) for inspection tasks. The significance of different components within these infrastructures is subject to variability and can be influenced by external factors. The principal aim of routine UAV inspections is to ensure differentiated coverage of pivotal sections with minimal energy consumption. However, extant research on UAV path coverage fails to fully account for the variability and dynamic shifts in regional significance and their impact on coverage efficacy. This paper presents an energy-aware collaborative coverage policy for UAVs, designated as ***-MATD3 employs a dynamic weight region partitioning method tailored to real-world environments and addresses the action selection challenge for UAVs using a discrete Partially Observable Markov Decision Process (Dec-POMDP). By amalgamating MATD3 with stacked LSTM, this approach mitigates redundant path overlaps and unnecessary action replication across multiple agents, thus optimizing coverage and diminishing energy usage. Simulation outcomes demonstrate that EA-MATD3 reduces energy consumption by an average of 9.65% relative to the Greedy, MADDPG, and MATD3 algorithms while sustaining a superior coverage rate. © 2024 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共119页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：