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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

806 篇 会议
791 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

985 篇 工学
- 708 篇 计算机科学与技术...
- 572 篇 软件工程
- 196 篇 信息与通信工程
- 135 篇 生物工程
- 115 篇 电气工程
- 114 篇 控制科学与工程
- 89 篇 电子科学与技术（可...
- 85 篇 光学工程
- 79 篇 生物医学工程（可授...
- 62 篇 机械工程
- 42 篇 化学工程与技术
- 41 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 38 篇 交通运输工程
- 33 篇 建筑学
- 33 篇 土木工程
605 篇 理学
- 310 篇 数学
- 170 篇 物理学
- 151 篇 生物学
- 98 篇 统计学（可授理学、...
- 49 篇 化学
- 49 篇 系统科学
- 41 篇 地球物理学
246 篇 管理学
- 145 篇 管理科学与工程(可...
- 115 篇 图书情报与档案管...
- 49 篇 工商管理
63 篇 医学
- 53 篇 临床医学
- 45 篇 基础医学(可授医学...
- 32 篇 药学(可授医学、理...
49 篇 法学
- 39 篇 社会学
21 篇 经济学
15 篇 农学
7 篇 教育学
3 篇 艺术学
2 篇 文学
2 篇 军事学

主题

63 篇 feature extracti...
58 篇 semantics
47 篇 training
45 篇 computational mo...
37 篇 deep learning
37 篇 machine learning
35 篇 graph neural net...
35 篇 accuracy
34 篇 predictive model...
34 篇 data models
25 篇 convolution
24 篇 task analysis
23 篇 image segmentati...
22 篇 federated learni...
19 篇 deep neural netw...
19 篇 neural networks
18 篇 memory managemen...
18 篇 cloud computing
17 篇 data mining
16 篇 topology

机构

214 篇 beijing advanced...
102 篇 national enginee...
66 篇 school of comput...
63 篇 beijing advanced...
58 篇 shandong provinc...
53 篇 school of cyber ...
50 篇 key laboratory o...
46 篇 shandong enginee...
40 篇 national enginee...
39 篇 school of comput...
33 篇 hubei engineerin...
32 篇 services computi...
29 篇 cluster and grid...
28 篇 hubei key labora...
27 篇 huazhong univers...
23 篇 university of ch...
23 篇 school of econom...
22 篇 school of softwa...
21 篇 engineering rese...
21 篇 guangxi cooperat...

作者

127 篇 hai jin
122 篇 jin hai
43 篇 xiaofei liao
42 篇 li jianxin
41 篇 peng hao
25 篇 hu shengshan
22 篇 long zheng
22 篇 corianò claudio
22 篇 liao xiaofei
21 篇 haikun liu
21 篇 yu philip s.
20 篇 xiwang dong
20 篇 zhang ren
20 篇 zhao weisheng
19 篇 qingdong li
18 篇 yu zhang
17 篇 zou deqing
17 篇 zhang leo yu
16 篇 lionetti stefano
15 篇 li qian

语言

1,462 篇 英文
120 篇 其他
35 篇 中文

检索条件"机构=Big Data Computing Center"

共 1597 条记录，以下是151-160 订阅

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

详细简洁

排序：

RGraph: Asynchronous graph processing based on asymmetry of remote direct memory access

RGraph: Asynchronous graph processing based on asymmetry of ...

引用

作者： Chen, Hanhua Yuan, Jie Jin, Hai Wang, Yonghui Wu, Sijie Jiang, Zhihao National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

The scale of real-world graphs is constantly growing. To deal with large-scale graphs, distributed graph processing has attracted much research efforts. Existing distributed graph processing systems are commonly built on traditional TCP/IP communication stack, which leads to network bottleneck because of low bandwidth and heavy kernel stack operations. Meanwhile, in real power-law graphs, the average number of mirror vertices after graph partitioning is very large, resulting in significant communication overhead among nodes. The emerging high-performance Remote Direct Memory Access (RDMA) network has the features of low latency, high bandwidth, and low CPU overhead, which brings new opportunities for distributed graph processing systems. Existing RDMA-assisted graph processing systems focus on synchronous execution, which imposes barriers between consecutive iterations. Synchronous execution transfers bulk data among nodes and thus only needs a small number of network transfers. However, synchronous execution is usually less efficient than asynchronous execution because of bulk synchronization. Asynchronous execution accelerates graph processing by eliminating barriers, which in turn requires to transfer a large amount of small size data. In this paper, we propose RGraph, an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master and mirror vertices. RGraph exploits the asymmetry of RDMA to accelerate the one-to-many communication between master and mirror vertices. We implement RGraph on top of PowerGraph and conduct comprehensive experiments with large-scale real graphs to evaluate its performance. Results show that compared to existing designs, RGraph reduces the execution time by up to 81%. © 2021 John Wiley & Sons Ltd.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Intersecting-boundary-sensitive fingerprinting for tampering detection of DNN models 24

Intersecting-boundary-sensitive fingerprinting for tampering...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Xiaofan Bai Chaoxiang He Xiaojing Ma Bin Benjamin Zhu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security Microsoft School of Computer Science and Technology Huazhong University of Science and Technology and National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab.

Cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 labels. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 labels. The IBSF code is available at: https://***/CGCL-codes/IBSF.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MedX-Net: Hierarchical Transformer with Large Kernel Convolutions for 3D Medical Image Segmentation

MedX-Net: Hierarchical Transformer with Large Kernel Convolu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Lin Zou, Qingzhi Key Laboratory of Computing Power Network and Information Se-curity Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Due to the exceptional performance of Transform-ers in 2D medical image segmentation, recent work has also introduced them into 3D medical segmentation tasks. For instance, Swin UNETR and other hierarchical Transformers have reintroduced prior knowledge from several convolutional networks, further enhancing the volume segmentation capabilities of models. The efficacy of these hybrid methodologies is primarily attributed to the substantial quantity of parameters and the nonlocal self-attention mechanism with a large receptive field. We argue that the behavior of these methods' large receptive fields can be simulated by employing fewer parameters through the utilization of depth-wise convolutions with large kernel. Within this manuscript, we introduce a lightweight volume segmentation model called MedX-Net, which uses convolutional network modules to simulate hierarchical Transformers for robust volume segmentation. Firstly, inspired by the hierarchical Transformer module of Swin UNETR, we investigate large-kernel depth-wise convolutions with different sizes to achieve a reduced model parameter count while maintaining a large global receptive field. Secondly, we replace the multilayer perceptron (MLP) in the hierarchical Transformer module with Inverted Bottleneck with Depthwise Convolution Enhancement(DWCE) to improve model performance with fewer activation and normalization layers, further reducing the parameter count. We validate the effectiveness and efficiency of our model for volume segmentation on three public datasets: Synapse, BTCV and ACDC. On the Synapse dataset, compared to Swin UNETR, our model achieves an improvement from 83.48% to 87.21% in Dice score. Compared to the result of 86.57% achieved by nnFormer, our model achieves superior performance while reducing the model parameter count by 64%. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Semantic Reasoning Technology on Temporal Knowledge Graph 19th

Semantic Reasoning Technology on Temporal Knowledge Graph

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Li, Jianuo Zhao, Feng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9783031203084

Semantic reasoning techniques based on knowledge graphs have been widely studied since they were proposed. Previous studies are mostly based on closed-world assumptions, which cannot reason about unknown facts. To this end, we propose the Two-Stage Temporal Reasoning Model (TSTR) for reasoning about future facts. In the first stage, probability of future facts occurring is reasoned using repeated information in history. In the second stage, the semantics of the neighborhood nodes are aggregated using the structural encoder and the temporal information is captured using the temporal encoder. The predicted probabilities are obtained by the decoder. Finally, the candidate entity probabilities of the two-stage reasoning are weighted to achieve the prediction of the two-stage fusion. We tested the performance of the TSTR on public datasets and the results demonstrated the effectiveness of the TSTR. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Commonsense Knowledge Construction with Concept and Pretrained Model 19th

Commonsense Knowledge Construction with Concept and Pretrain...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Cai, Hanjun Zhao, Feng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9783031203084

Commonsense knowledge (CSK) is the information that people use in daily life but do not often mention. It summarizes the practical knowledge about how the world works. Existing machines have knowledge but lack commonsense because they do not understand and master commonsense knowledge in the same way that humans do. In the latest works, crowdsourcing-based method is costly and has low coverage, knowledge base completion method can highly fit samples, and methods extracted from unstructured data have the defects of low quality. CG &BF is commonsense knowledge construction with a concept-based generator and a BERT-based filter. We utilize semantic search for node matching and entropy encoder for filtering triples with high abstraction. Two algorithms based on concept aggregation and path credibility are proposed to obtain high-quality CSK triples. We subsequently finetuning a BERT to filter incorrect triples. We obtain 500,000 CSK triples based on ConceptNet, which is superior to other construction methods in novelty and quality. In the reading comprehension task, the three-way attention network is selected as the basic model and the knowledge we generate enables the base model to perform better, which proves that the output of CG &BF has higher quality and ease of use. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Bidirectional Cross-Attention Model for Predicting Prognosis in Multiple Peritoneum Lesions with Clinical Information 22

Multi-Stage Bidirectional Cross-Attention Model for Predicti...

引用

22nd IEEE International Symposium on Biomedical Imaging, ISBI 2025

作者： Li, Haoshen Cai, Jieyuan Wei, Yiyuan Chen, Zifan Chen, Heyun Zhao, Jie Shi, Yanjie Dong, Bin Tang, Lei Zhang, Xiaotian Zhang, Li Center for Data Science Peking University China Peking University Cancer Hospital & Institute China Peking University National Engineering Laboratory for Big Data Analysis and Applications China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China Peking University Changsha Institute for Computing and Digital Economy China

ISBN: (纸本)9798331520526

Peritoneal metastasis occurs when cancer cells spread from the primary tumor to the peritoneum, leading to morphological alterations that significantly impact patient survival. The specific changes across multiple peritoneal sites can effectively indicate a patient's risk level and prognosis. However, the considerable variation in peritoneal shape, size, and location poses significant challenges for feature extraction and prognostic analysis. Traditional multi-instance learning approaches typically fuse instance features extracted by the backbone network at the final stage, but their lack of intermediate interaction limits the ability to capture both common and distinct features. To address this limitation, we propose a Multi-Stage BiDirectional Cross-Attention framework (MSBDCA). Our approach enhances feature extraction and prognostic analysis by facilitating interaction among different peritoneal instances and incorporating clinical information. Experimental comparisons with five baseline models demonstrate our method's superiority, achieving improvements of 8.7% in Area Under Curve (AUC) and 5.9% in Concordance Index (C_index). These results suggest a promising direction for survival and prognostic analysis using peritoneal lesions. Our code is available at https://***/HaoshenLi/MSBDCA. © 2025 IEEE.

关键词： deep learning multi-instance learning peritoneal metastasis analysis Survival analysis

来源：评论

学校读者我要写书评

暂无评论

Meta-CQG: A Meta-Learning Framework for Complex Question Generation over Knowledge Bases 29

Meta-CQG: A Meta-Learning Framework for Complex Question Gen...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Zhang, Kun Qiu, Yunqi Wang, Yuanzhuo Bai, Long Li, Wei Jiang, Xuhui Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China Big Data Academy Zhongke Baidu Inc

Complex question generation over knowledge bases (KB) aims to generate natural language questions involving multiple KB relations or functional constraints. Existing methods train one encoder-decoder-based model to fit all questions. However, such a one-size-fits-all strategy may not perform well since complex questions exhibit an uneven distribution in many dimensions, such as question types, involved KB relations, and query structures, resulting in insufficient learning for long-tailed samples under different dimensions. To address this problem, we propose a meta-learning framework for complex question generation. The meta-trained generator can acquire universal and transferable meta-knowledge and quickly adapt to long-tailed samples through a few most related training samples. To retrieve similar samples for each input query, we design a self-supervised graph retriever to learn distributed representations for samples, and contrastive learning is leveraged to improve the learned representations. We conduct experiments on both WebQuestionsSP and Com-plexWebQuestion, and results on long-tailed samples of different dimensions have been significantly improved, which demonstrates the effectiveness of the proposed framework. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Maverick: Personalized Edge-Assisted Federated Learning with Contrastive Training 25

Maverick: Personalized Edge-Assisted Federated Learning with...

引用

34th ACM Web Conference, WWW 2025

作者： Wang, Kaibin He, Qiang Dong, Zeqian Chen, Rui He, Chuan Chua, Caslon Chen, Feifei Yang, Yun Swinburne University of Technology Melbourne Australia Huazhong University of Science and Technology Wuhan China Deakin University Melbourne Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9798400712746

In an edge-assisted federated learning (FL) system, edge servers aggregate the local models from the clients within their coverage areas to produce intermediate models for the production of the global model. This significantly reduces the communication overhead incurred during the FL process. To accelerate model convergence, FedEdge, the state-of-the-art edge-assisted FL system, trains clients’ models in local federations when they wait for the global model in each training round. However, our investigation reveals that it drives the global model towards clients with excessive local training, causing model drifts that undermine model performance for other clients. To tackle this problem, this paper presents Maverick, a new edge-assisted FL system that mitigates model drifts by training personalized local models for clients through contrastive local training. It introduces a model-contrastive loss to facilitate personalized local federated training by driving clients’ local models away from the global model and close to their corresponding intermediate models. In addition, Maverick includes anomalous models in contrastive local training as negative samples to accelerate the convergence of clients’ local models. Extensive experiments are conducted on three widely-used models trained on three datasets to comprehensively evaluate the performance of Maverick. Compared to state-of-the-art edge-assisted FL systems, Maverick accelerates model convergence by up to 16.2x and improves model accuracy by up to 12.7%. © 2025 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Jin Zhao Yu Zhang Jian Cheng Yiyang Wu Chuyue Ye Hui Yu Zhiying Huang Hai Jin Xiaofei Liao Lin Gu Haikun Liu National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab Hangzhou China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798350323481

Temporal graph processing is used to handle the snapshots of the temporal graph, which concerns changes in graph over time. Although several software/hardware solutions have been designed for efficient temporal graph processing, they still suffer from serious irregular data access due to the uncoordinated graph traversal. To overcome these limitations, this paper proposes SaGraph, a domain-specific hardware accelerator to support the efficient processing of temporal graph. Specifically, temporal graph processing shows strong data access similarity, i.e., most graph accesses of the processing of different snapshots are the same and usually refer to a small fraction of vertices. SaGraph can dynamically coordinate the graph traversals and adaptively cache the vertex states to fully exploit the data access similarity for smaller data access overhead. We implemented and evaluated SaGraph on a Xilinx Alveo U280 FPGA card. Compared with the cutting-edge software and hardware solutions, SaGraph achieves 8.5×-157.3×, 4.2×-16.1× speedups and 34.7×-423.6×, 5.3×-14.7× energy savings, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共160页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：