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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

827 篇 会议
297 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

716 篇 工学
- 559 篇 计算机科学与技术...
- 415 篇 软件工程
- 136 篇 信息与通信工程
- 82 篇 控制科学与工程
- 75 篇 电子科学与技术（可...
- 64 篇 生物工程
- 51 篇 机械工程
- 46 篇 电气工程
- 26 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 24 篇 化学工程与技术
- 15 篇 材料科学与工程（可...
- 15 篇 网络空间安全
- 14 篇 土木工程
- 12 篇 力学（可授工学、理...
- 12 篇 交通运输工程
- 12 篇 农业工程
- 12 篇 环境科学与工程（可...
288 篇 理学
- 179 篇 数学
- 67 篇 生物学
- 51 篇 物理学
- 39 篇 统计学（可授理学、...
- 36 篇 系统科学
- 25 篇 化学
184 篇 管理学
- 126 篇 管理科学与工程(可...
- 61 篇 图书情报与档案管...
- 35 篇 工商管理
19 篇 法学
- 16 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
13 篇 农学
11 篇 教育学
- 11 篇 教育学
8 篇 医学
4 篇 文学
3 篇 军事学
2 篇 艺术学

主题

44 篇 computational mo...
31 篇 concurrent compu...
31 篇 training
30 篇 laboratories
30 篇 algorithm design...
28 篇 computer archite...
28 篇 benchmark testin...
28 篇 feature extracti...
28 篇 kernel
27 篇 semantics
27 篇 distributed proc...
25 篇 graphics process...
25 篇 servers
25 篇 hardware
23 篇 parallel process...
23 篇 fault tolerance
23 篇 cloud computing
21 篇 task analysis
21 篇 throughput
21 篇 distributed comp...

机构

169 篇 national laborat...
134 篇 science and tech...
104 篇 college of compu...
81 篇 national laborat...
38 篇 national laborat...
36 篇 science and tech...
35 篇 school of comput...
34 篇 national laborat...
29 篇 national key lab...
22 篇 science and tech...
22 篇 national key lab...
18 篇 national laborat...
16 篇 science and tech...
16 篇 national laborat...
15 篇 school of comput...
14 篇 national laborat...
14 篇 national key lab...
13 篇 national key lab...
13 篇 laboratory of di...
12 篇 national key lab...

作者

44 篇 yong dou
43 篇 wang huaimin
40 篇 dou yong
36 篇 dongsheng li
36 篇 liu jie
35 篇 huaimin wang
31 篇 jie liu
30 篇 li dongsheng
29 篇 yuxing peng
29 篇 yijie wang
29 篇 peng yuxing
27 篇 xiaodong wang
27 篇 wang yijie
25 篇 yin gang
23 篇 wang ji
22 篇 zhigang luo
21 篇 xingming zhou
20 篇 gang yin
20 篇 li kuan-ching
19 篇 ding bo

语言

1,057 篇 英文
59 篇 中文
10 篇 其他

检索条件"机构=Science and technology on Parallel and distributed processing laboratory"

共 1126 条记录，以下是401-410 订阅

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

详细简洁

排序：

Effective Anomaly Detection Based on Reinforcement Learning in Network Traffic Data

Effective Anomaly Detection Based on Reinforcement Learning ...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Zhongyang Wang Yijie Wang Hongzuo Xu Yongjun Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology

Mixed-type data with both categorical and numerical features are ubiquitous in network security, but the existing methods are minimal to deal with them. Existing methods usually process mixed-type data through feature conversion, whereas their performance is downgraded by information loss and noise caused by the transformation. Meanwhile, existing methods usually superimpose domain knowledge and machine learning in which fixed thresholds are used. It cannot dynamically adjust the anomaly threshold to the actual scenario, resulting in inaccurate anomalies obtained, which results in poor performance. To address these issues, this paper proposes a novel Anomaly Detection method based on Reinforcement Learning, termed ADRL, which uses reinforcement learning to dynamically search for thresholds and accurately obtain anomaly candidate sets, fusing domain knowledge and machine learning fully and promoting each other. Specifically, ADRL uses prior domain knowledge to label known anomalies and uses entropy and deep autoencoder in the categorical and numerical feature spaces, respectively, to obtain anomaly scores combining with known anomaly information, which are integrated to get the overall anomaly scores via a dynamic integration strategy. To obtain accurate anomaly candidate sets, ADRL uses reinforcement learning to search for the best threshold. Detailedly, it initializes the anomaly threshold to get the initial anomaly candidate set and carries on the frequent rule mining to the anomaly candidate set to form the new knowledge. Then, ADRL uses the obtained knowledge to adjust the anomaly score and get the score modification rate. According to the modification rate, different threshold modification strategies are executed, and the best threshold, that is, the threshold under the maximum modification rate, is finally obtained, and the modified anomaly scores are obtained. The scores are used to re-carry out machine learning to improve the algorithm's accuracy for anomalo

关键词： Knowledge engineering Machine learning algorithms Conferences distributed databases Reinforcement learning Telecommunication traffic Network security

来源：评论

学校读者我要写书评

暂无评论

Fisher Discriminant Analysis Random Forest for Online Class Incremental Learning

Fisher Discriminant Analysis Random Forest for Online Class ...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Wang Xiong Yijie Wang Li Cheng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781728111421;9781728111414

Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, due to the limited storage of the online scenario, algorithm is usually obstructed to frequently scan or simply store all historical data, it is another challenge to reduce the historical data storage for algorithm. Few existing work have addressed above challenges simultaneously. In this paper, we propose Fisher Discriminant Analysis Random Forest (FDARF), which consists of two parts, GHS (Generate Hierarchical Split) and RRS (Random Reform Subtree), that cooperatively operate. GHS combines FDA (Fisher Discriminant Analysis) with tree hierarchy to learn a hierarchical split of data space that provides strong ability for classification. The statistics in leaves (i.e. historical data) can be described by covariance matrix and further optimized by matrix sketching algorithm to reduce storage; for every tree initialized by GHS, RRS randomly reforms certain state subtree, which creates diversity that can be ensemble for ensuring effectiveness of class incremental learning. Extensive experiments on diverse datasets validate that FDARF can well adapt to the online class incremental learning.

关键词： Vegetation Training Covariance matrices Memory Forestry Learning systems

来源：评论

学校读者我要写书评

暂无评论

引用

Asia-Pacific Conference on Software Engineering

作者： Dongyang Hu Ming Chen Tao Wang Junsheng Chang Gang Yin Yue Yu Yang Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781728119717;9781728119700

In the software development, it is not uncommon to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task which can assist developers in bug triaging and fixing. As the state of the art, Yang et al.'s work presented an approach that combines TF-IDF method with word embedding model and achieved a good result. To further improve the performance of their approach, in this paper, we propose a novel approach using Document Embedding model. In our preliminary evaluation, we conduct the experiment on 13,090 bug reports from the Eclipse platform and the results show that our approach outperforms Yang et al.'s, with 7.89-8.96% of improvement.

关键词： Computer bugs Software engineering Task analysis Measurement Software Information retrieval Natural language processing

来源：评论

学校读者我要写书评

暂无评论

A low-cost fully pipelined architecture for fingerprint matching

A low-cost fully pipelined architecture for fingerprint matc...

引用

International Conference on Signal processing Proceedings (ICSP)

作者： Jinwei Xu Jingfei Jiang Yong Dou Xiaolong Shen Science and Technology on Parallel and distributed Processing Laboratory National University of Defense Technology Changsha China

Fingerprint matching is a key procedure in fingerprint identification applications. The fingerprint-matching algorithm based on minutiae is one of the most typical algorithms that can achieve a reasonably correct recognition rate. Performance and cost are two critical factors when implementing minutia-based matching algorithms in most embedded applications. A low-cost, fully pipelined architecture for minutia-based fingerprint matching is proposed in this paper. A regular matching unit with a pipeline of 13 stages is designed as the core of the architecture, interfacing with a two-port RAM and a DDR3 controller. We implemented the whole architecture on a Xilinx FPGA board with the Virtex VII XC7VX485T chip. The matching unit can run with a frequency of 330 MHz on the chip, which leads the system to achieve a throughput of about 430000 fingerprints per second when processing typical datasets. The unit only occupies 568 slices, which is less than 1% of the available chip resources. The board only consumes 16 W of power when run. The architecture can gain about twice the throughput of the 2.93 GHz Intel Xeon5670 CPU at a low logic cost and power.

关键词： Fingerprint recognition Throughput Random access memory Pipelines Computer architecture Field programmable gate arrays Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Accelerating Monte Carlo Simulation of Neutron Transport on the Intel MIC Architecture

Accelerating Monte Carlo Simulation of Neutron Transport on ...

引用

International Conference on Information science and Control Engineering (ICISCE)

作者： Xiantao Cui Jie Liu Lihua Chi Qinglin Wang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781467368513

Simulation of particle transport is critical for a great many of scientific and engineering domains. The Monte Carlo (MC) method is one of the most important numerical methods for the simulation of particle transport, and can simulate many complex types of particle transport. But the computation requirement of the MC simulation is very large. In 2010, Intel announced the Intel Many Integrated Core (MIC) architecture, which consists of many simple general-purpose cores and supports the well-known shared-memory execution model that is the base of most nodes in HPC machines. On account of the independence of simulation of each particle in the MC method, it is well-suited to accelerate the MC simulation on MIC. In this paper, an algorithm named MCNP-MIC based MIC is presented for MC simulation of neutron transport in the context of deep penetration problem, which includes the development of parallel random generator, the assignment of particle number based thread number and the design of high efficiency data structures for parallelism. Eventually, we get the results as follows: with the same problem scale and computational accuracy, the MCNPMIC algorithm has achieved roughly 5.6-fold speedup running on a 57-core MIC chip in comparison with the serial MCNP algorithm on an Intel Xeon E5-2670 CPU.

关键词： Microwave integrated circuits Neutrons Algorithm design and analysis Monte Carlo methods Data structures Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

Entropy and Autoencoder-Based Outlier Detection in Mixed-Type Network Traffic Data

Entropy and Autoencoder-Based Outlier Detection in Mixed-Typ...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Zhongyang Wang Yijie Wang Zhenyu Huang Yongjun Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology

Mixed-type data containing categorical and numerical features are pervasive in real life, but very limited outlier detection methods are available for these data. Some existing methods handle mixed-type data by feature converting, whereas their performance is downgraded by information loss and noise caused by the transformation. Meanwhile, the existing general algorithms cannot combine the characteristics of outliers in specific fields, leading to an unsatisfying performance in actual scenarios, such as the field of network security. This paper proposes a novel Entropy and Autoencoder-based Outlier Detection in mixed-type network traffic data, termed EAOD, which combines characteristics of outliers in specific fields and machine learning models to detect outliers. EAOD utilizes the expert rules made by domain knowledge summarized based on characteristics of existing outliers to label known outlier data. It performs holoentropy and deep autoencoder for the category and numerical feature spaces, respectively, in unlabeled data to obtain outlier scores integrated to get the final outlier scores via a dynamic integration strategy. Especially in the numerical feature space, to fully mine known outlier behavior patterns, deep autoencoders of outlier and normal types are constructed separately to capture unknown outliers jointly. Experiments show that EAOD significantly outperforms eight state-of-the-art outlier detectors on seven real network traffic datasets.

关键词： Telecommunication traffic Machine learning Detectors Network security Feature extraction Entropy Data models

来源：评论

学校读者我要写书评

暂无评论

DPSS: Dynamic Parameter Selection for Outlier Detection on Data Streams

DPSS: Dynamic Parameter Selection for Outlier Detection on D...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Ruyi Zhang Yijie Wang Haifang Zhou Bin Li Hongzuo Xu Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology

Outlier detection on data streams identifies unusual states to sense and alarm potential risks and faults of the target systems in both the cyber and physical world. As different parameter settings of machine learning algorithms can result in dramatically different performance, automatic parameter selection is also of great importance in deploying outlier detection algorithms in data streams. However, current canonical parameter selection methods suffer from two key challenges: (i) Data streams generally evolve over time, but these existing methods use a fixed training set, which fails to handle this evolving environment and often results in suboptimal parameter recommendations; (ii) The stream is infinite, and thus any parameter selection method taking the entire stream as input is infeasible. In light of these limitations, this paper introduces a Dynamic Parameter Selection method for outlier detection on data Streams (DPSS for short). DPSS uses Gaussian process regression to model the relationship between parameters and detecting performance and uses Bayesian optimization to explore the optimal parameter setting. For each new subsequence, DPSS updates the recommended parameter setting to suit the evolving characteristics. Besides, DPSS only uses historical calculations to guide the parameter setting sampling and adjust the Gaussian process regression results. DPSS can be employed as an auxiliary plug-in tool to improve the detection performance of outlier detection methods. Extensive experiments show that our method can significantly improve the F-score of outlier detectors in data streams compared to its counterparts and obtains more superior parameter selection performance than other state-of the-art parameter selection approaches. DPSS also achieves better time and memory efficiency compared to competitors.

关键词： Training Fault diagnosis Machine learning algorithms Memory management Gaussian processes Detectors Bayes methods

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneous KBA parallel Algorithm for the Cartesian Discrete Ordinates for Multizone Heterogeneous System

A Heterogeneous KBA Parallel Algorithm for the Cartesian Dis...

引用

International Conference on Computers, Communications, and Systems (ICCCS)

作者： Runhua Li Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

Innovations in powerful high-performance computing (HPC) architecture are enabling high-fidelity whole-core neutron transport simulations at reasonable time. Especially, the currently fashionable heterogeneous architectures make the cost of such simulations at very low level. Neutron distribution of a reactor core is governed by the Boltzmann neutron transport equation (BTE), first viable solutions of which need tremendous computer resources. Among of the high-fidelity numerical methods, the discrete ordinates method (SN) is becoming popular in the reaction design community by taking a good balance between computational cost and accuracy. Recently, MT-3000, which is a multizone heterogeneous architecture with a peak double precision performance of 11.6 TFLOPS, is proposed. In this work, the BTE is solved by the SN with heterogenous Koch-Baker-Alcouffe (KBA) parallel algorithms based on the MT-3000 architecture. A communication mechanism has been established to efficiently transmit data among the acceleration cores and the CPU cores. The kernel computation procedure is largely accelerated by the vectorization and instruction pipelining techniques. Numerical experiments show that our formulation could achieve 1.37 TFLOPs with single MT-3000, that is 11.8% of its peak performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hardware design of ML algorithm in MIMO-OFDM system

Hardware design of ML algorithm in MIMO-OFDM system

引用

International Conference on Systems and Informatics (ICSAI)

作者： Suncheng Xiang Minxuan Zhang Zuocheng Xing Cang Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781509055227

With the development of maritime information technology and computer technology, wireless communication technology in underwater networks and systems has made great progress and achieved wide range of application, which greatly promoted the development of ocean communication. Due to the presence of severe frequency selective fading, fast fading and slow fading, including all kinds of Noise interference and ISI problem under multipath propagation, especially ISI. In the meantime, in order to improve efficiency in underwater communications, a kind of signal detection algorithm is proposed in the case of interference in this article to deal with this problems-Maximum likelihood detection, this algorithm has a good complexity and relatively a high degree of precision in MIMO-OFDM system. So we do a circuit design based on the ML algorithm. The test result shows that this kind of circuit meets the requirements successfully.

关键词： Algorithm design and analysis OFDM Hardware Receiving antennas Integrated circuit modeling Maximum likelihood detection MIMO

来源：评论

学校读者我要写书评

暂无评论

Accelerating embarrassingly parallel algorithm on Intel MIC

Accelerating embarrassingly parallel algorithm on Intel MIC

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Qinglin Wang Jie Liu Xiantuo Tang Feng Wang Guitao Fu Zuocheng Xing Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781479920327

The Embarrassingly parallel (EP) algorithm which is typical of many Monte Carlo applications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Intel released Many Integrated Core (MIC) architecture as a many-core co-processor. MIC often offers more than 50 cores each of which can run four hardware threads as well as 512-bit vector instructions. In this paper, we describe how the EP algorithm is accelerated effectively on the platforms containing MIC using the offload execution model. The result shows that the efficient implementation of EP algorithm on MIC can take full advantage of MIC's computational resources and achieves a speedup of 3.06 compared with that on Intel Xeon E5-2670 CPU. Based on the EP algorithm on MIC and an effective task distribution model, the implementation of EP algorithm on a CPU-MIC heterogeneous platform achieves the performance of up to 2134.86 Mop/s and 4.04 times speedup compared with that on Intel Xeon E5-2670 CPU.

关键词： Microwave integrated circuits Computer architecture Vectors Algorithm design and analysis Graphics processing units Clustering algorithms Load modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共113页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：