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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

381 篇 会议
160 篇 期刊文献
2 册 图书

馆藏范围

543 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

328 篇 工学
- 251 篇 计算机科学与技术...
- 201 篇 软件工程
- 68 篇 信息与通信工程
- 53 篇 控制科学与工程
- 37 篇 生物工程
- 29 篇 电子科学与技术（可...
- 25 篇 机械工程
- 23 篇 电气工程
- 12 篇 化学工程与技术
- 10 篇 力学（可授工学、理...
- 9 篇 仪器科学与技术
- 9 篇 动力工程及工程热...
- 8 篇 农业工程
- 7 篇 土木工程
- 7 篇 交通运输工程
- 7 篇 网络空间安全
- 6 篇 光学工程
- 6 篇 核科学与技术
- 6 篇 生物医学工程（可授...
146 篇 理学
- 83 篇 数学
- 37 篇 生物学
- 35 篇 物理学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 化学
84 篇 管理学
- 53 篇 管理科学与工程(可...
- 32 篇 图书情报与档案管...
- 10 篇 工商管理
9 篇 法学
- 8 篇 社会学
8 篇 农学
- 8 篇 作物学
6 篇 医学
5 篇 经济学
3 篇 教育学
2 篇 文学
2 篇 军事学
2 篇 艺术学

主题

24 篇 training
19 篇 computational mo...
18 篇 deep learning
17 篇 feature extracti...
15 篇 computer archite...
15 篇 neural networks
14 篇 benchmark testin...
14 篇 semantics
14 篇 algorithm design...
14 篇 cloud computing
13 篇 task analysis
13 篇 servers
12 篇 distributed data...
11 篇 distributed proc...
11 篇 machine learning
11 篇 clustering algor...
11 篇 kernel
11 篇 accuracy
10 篇 scalability
10 篇 laboratories

机构

134 篇 science and tech...
62 篇 college of compu...
36 篇 science and tech...
23 篇 national laborat...
22 篇 science and tech...
16 篇 science and tech...
14 篇 national laborat...
14 篇 national key lab...
13 篇 school of comput...
13 篇 laboratory of di...
12 篇 national key lab...
11 篇 college of compu...
9 篇 national laborat...
8 篇 school of comput...
8 篇 college of compu...
8 篇 college of scien...
8 篇 national key lab...
8 篇 national key lab...
7 篇 national univers...
7 篇 xiangjiang lab

作者

36 篇 liu jie
32 篇 jie liu
24 篇 yijie wang
20 篇 dou yong
20 篇 peng yuxing
19 篇 wang yijie
17 篇 zhigang luo
16 篇 wang huaimin
15 篇 yuxing peng
15 篇 dongsheng li
15 篇 qinglin wang
15 篇 huaimin wang
15 篇 qiao peng
14 篇 li dongsheng
14 篇 naiyang guan
13 篇 yong dou
13 篇 zuocheng xing
12 篇 wang qinglin
12 篇 kai lu
11 篇 chen xinhai

语言

512 篇 英文
26 篇 中文
5 篇 其他

检索条件"机构=Science and Technology on Parallel and Distributed Laboratory"

共 543 条记录，以下是321-330 订阅

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

详细简洁

排序：

Research on Integrated Detection of SQL Injection Behavior Based on Text Features and Traffic Features

Research on Integrated Detection of SQL Injection Behavior B...

引用

作者： Ming Li Bo Liu Guangsheng Xing Xiaodong Wang Zhihui Wang College of Intelligence Science and Technology National University of Defence Technology National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology

With the rapid development of Internet technology, various network attack methods come out one after the other. SQL injection has become one of the most severe threats to Web applications and seriously threatens various Web application services and users' data security. There are both traditional detection methods and emerging methods based on deep learning technology with higher detection accuracy for the detection of SQL injection. However, they are all for detecting a single statement and cannot determine the stage of the attack. To further improve the effect of SQL injection detection, this paper proposes an integrated detection framework for SQL injection behavior based on both text features and traffic features. We propose a SQL-LSTM model based on deep learning technology as the detection model at the text features level. Meanwhile,the features of the data traffic are merged. By this integrated method, the detection effect of SQL injection is further improved.

关键词： SQL injection Integrated method SQL-LSTM Traffic features

来源：评论

学校读者我要写书评

暂无评论

OLM2: Automatic Optimal Strategy Generating for Large-Scale Model Training with Limited-Memory

OLM2: Automatic Optimal Strategy Generating for Large-Scale ...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Zhilin Yang Yu Tang Linbo Qiao Xi Yang Zhen Huang National Key Laboratory of Parallel and Distributed Computing College of Computer Science National University of Defense Technology Changsha 410073 China

The scale of model parameters and the amount of training data is exponentially increasing. It requires more GPU memory with the exponential increasement of model parameters. Recomputation and swapping are two main memory optimization methods that have been extensively studied, and there are also optimization strategies that combine the two methods. However, most of them are based on heuristic search strategies, which do not explore the complete solution space and can’t guarantee the optimality of the solution results. An optimal search strategy with tensor-level recomputation and swapping is expected in large-scale model training. In this paper, we propose an optimal strategy searching algorithm combining tensor-based recomputation and swapping. Specifically, the memory swapping strategy is reformulated as an optimization problem, which converts the memory constraints into mixed integer programming, to find the optimal memory optimization strategy. By leveraging the advantages of both recomputation and swapping, this approach minimizes computation consumption without exceeding the available memory limitation. Experimental results show that our method exhibits about 60% reduction in memory requirements during the training process. Furthermore, our method can reduce the overall training time beyond the existing algorithms. Compared to Checkmate, our approach achieves about 0.3–0.9% reduction in computation cost per iteration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing One by One Direct Convolution on ARMv8 Multi-core CPUs

Optimizing One by One Direct Convolution on ARMv8 Multi-core...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Qinglin Wang Dongsheng Li Songzhu Mei Siqi Shen Xiandong Huang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China School of Computer Science National University of Defense Technology Changsha China

ISBN: (数字)9781728169811

ISBN: (纸本)9781728169828

Convolutional layers are ubiquitous in a variety of deep neural networks. Due to the lower computation complexity and the smaller number of parameters, convolutions with small filter sizes are often used, such as one by one convolution. Nevertheless, these small convolution operations are still time-consuming. A common approach to implementing convolutions is to transform them into matrix multiplications, known as GEMM-based convolutions. The approach maybe incurs additional memory overhead and calls matrix multiplication routines, which are not optimized for matrices generated by convolutions. In this paper, we present a new parallel one by one direct convolution implementation on ARMv8 multi-core CPUs, which doesn't incur any additional memory space requirement. Our implementation is verified on two ARMv8 CPUs, Phytium FT-1500A and FT-2000plus. In terms of performance and scalability, our implementation is better than GEMM-based implementations in all the tests on Phytium FT-1500A. On Phytium FT-2000plus, our approach gives much better performance and scalability than GEMM-based approaches in most cases.

关键词： Convolution Registers Layout Neural networks parallel processing Computer architecture Tensile stress

来源：评论

学校读者我要写书评

暂无评论

Implementation of an Accurate and Efficient Compensated DGEMM for 64-bit ARMv8 Multi-Core Processors

Implementation of an Accurate and Efficient Compensated DGEM...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Hao Jiang Feng Wang Kuan Li Canqun Yang Kejia Zhao Chun Huang College of Computer Science National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781467386692

This paper presents an implementation of an accurate and efficient compensated Double-precision General Matrix Multiplication (DGEMM) based on OpenBLAS for 64-bit ARMv8 multi-core processors. Due to cancellation phenomena in floating point arithmetic, the results of DGEMM may not be as accurate as expected. In order to increase the accuracy of DGEMM, we compensate the error introduced by its dot product kernel (GEBP) by applying an error-free transformation to rewrite the kernel in assembly language. We optimize the computations in the inner kernel through exploiting loop unrolling, instruction scheduling and software-implemented register rotation to exploit instruction level parallelism (ILP). We also conduct a priori error analysis of the derived CompDGEMM. Our compensated DGEMM is as accurate as the existing quadruple precision GEMM using MBLAS, but is up to 6.4x faster. Our parallel implementation achieves good performance and scalability under varying thread counts across a range of matrix sizes evaluated.

关键词： Multicore processing Kernel Registers Libraries Error analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 Workshops 1

引用

丛书名： Lecture Notes in Computer science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302070

ISBN: (纸本)9783540235781

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation Computer Communication Networks Operating Systems Information Systems Applications (incl. Internet) Information Storage and Retrieval User Interfaces and Human Computer Interaction

来源：评论

学校读者我要写书评

暂无评论

IWFR: Exploiting full-duplex in wireless relay networks

IWFR: Exploiting full-duplex in wireless relay networks

引用

International Conference on Information science and technology (ICIST)

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

Traditional wireless relay networks have large end-to-end time delay and low throughput because of the limit that it can't receive and forward at the same time. In this paper, we proposed IWFR: Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the throughput. At the same time, we designed a new implicit acknowledgement mechanism, which can eliminate the ACK overheads and evidently improve the throughput of the relay. To implement IWFR, we also modified the full-duplex node architecture to make it support for immediate relay. Simulation shows that IWFR shortens the end-to-end time delay by 60% on average and improves the throughput to 240% of the original relay.

关键词： Wireless communication Throughput Delay effects Wireless sensor networks Interference Relay networks (telecommunications)

来源：评论

学校读者我要写书评

暂无评论

Deep Discriminative Clustering Network

Deep Discriminative Clustering Network

引用

International Joint Conference on Neural Networks

作者： Xuying Shao Keshi Ge Huayou Su Lei Luo Baoyun Peng Dongsheng Li Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China

Deep clustering aims to cluster unlabeled data by embedding them into a subspace based on deep model. The key challenge of deep clustering is to learn discriminative representations for input data with high dimensions. In this paper, we present a deep discriminative clustering network for clustering the real-world images. We use a convolutional auto-encoder stacked with a softmax layer to predict clustering assignments. To learn a discriminative representations, the proposed approach adds discriminative loss as embedded regularization with relative entropy minimization. With the discriminative loss, the network can not only produce clustering assignments, but also learn discriminative features by reducing intra-cluster distance and increasing inter-cluster distance. We evaluate the proposed method on three datasets: MNIST-full, YTF and FRGC-v2.0. We outperform state-of-the-art results on MNIST-full and FRGC-v2.0 and achieve competitive result on YTF. The source code has been made publicly available at .

关键词： Machine learning Clustering algorithms Image reconstruction Linear programming Clustering methods Neural networks Task analysis

来源：评论

学校读者我要写书评

暂无评论

A Class of Fast and Accurate Multi-layer Block Summation and Dot Product Algorithms 18th

A Class of Fast and Accurate Multi-layer Block Summation a...

引用

18th IFIP WG 10.3 International Conference on Network and parallel Computing, NPC 2021

作者： He, Kang Barrio, Roberto Chen, Lin Jiang, Hao Liu, Jie Gu, Tongxiang Qi, Jin Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Department of Applied Mathematics University of Zaragoza ZaragozaE50009 Spain College of Computer National University of Defense Technology Changsha410073 China Institute of Applied Physics and Computational Mathematics Beijing100000 China

ISBN: (纸本)9783030935702

Basic recursive summation and common dot product algorithm have a backward error bound that grows linearly with the vector dimension. Blanchard [1] proposed a class of fast and accurate summation and dot product algorithms respectively called FABsum and FABdot, which trades off the calculation accuracy and speed by the block size. Castaldo [2] proposed a multi-layer block summation and dot product algorithm called SuperBlocksum and SuperBlockdot that can increase the accuracy while adding almost no additional calculations. We combine the idea of [1] with the multi-layer block structure to propose SuperFABsum (for "super fast and accurate block summation") and SuperFABdot (for "super fast and accurate block dot product"). Our algorithms have two variants, one is SuperFAB(within), the other is SuperFAB(outside). Our algorithms further improve accuracy and speed compared with FAB and SuperBlock. We conducted accuracy and speed tests on the high-performance FT2000+ processor. Experimental results show that SuperFABdot(within) algorithm is more accurate than FABdot and SuperBlockdot. Compared with FABdot, SuperFABdot(outside) algorithm can achieve up to 1.2 × performance speedup while ensuring similar accuracy. © 2022, IFIP International Federation for Information Processing.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transaction Method for Sharing Economy

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transactio...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan Changsha P.R. China

Emerging blockchain systems have been widely adopted in sharing economy, such as e-commerce, to allow mutually distrustful parties to transact fairly without trusted parties. Most blockchain systems, however, lack transactional privacy protection. All transactions, including trading relationship between pseudonyms and content transacted, are exposed on the blockchain. Although many existing privacy protection methods on the blockchain have been proposed, it is difficult to find a trade-off between keeping speed and protecting privacy of transactions. To address this limitation, we propose a novel privacy-preserving method RZKPB that does not store financial transactions in clear on the blockchain, thus retaining transactional privacy from the public's view. Meanwhile, these transactions are as proofs to solve disputes between trading partners. RZKPB ensures fairness and privacy of transactions between participants without adding a new trusted party and breaking the verifying protocol on the blockchain. We take the e-commerce as an example in sharing economy to introduce RZKPB in our paper. Our experimental results show that compared with existing privacy-preserving methods based on the blockchain, RZKPB is more efficient under different settings.

关键词： Privacy Protocols Encryption Distortion

来源：评论

学校读者我要写书评

暂无评论

Succinct Representations in Collaborative Filtering: A Case Study using Wavelet Tree on 1,000 Cores

Succinct Representations in Collaborative Filtering: A Case ...

引用

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Xiangjun Peng Qingfeng Wang Xu Sun Chunye Gong Yaohua Wang User-Centric Computing Group University of Nottingham Ningbo China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results.

关键词： Vegetation Collaboration Filtering Data structures Runtime Indexes Time complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共55页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：