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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

652 篇 会议
303 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

642 篇 工学
- 502 篇 计算机科学与技术...
- 396 篇 软件工程
- 102 篇 信息与通信工程
- 70 篇 网络空间安全
- 60 篇 生物工程
- 59 篇 电子科学与技术（可...
- 59 篇 控制科学与工程
- 45 篇 电气工程
- 28 篇 机械工程
- 24 篇 光学工程
- 22 篇 化学工程与技术
- 18 篇 安全科学与工程
- 17 篇 动力工程及工程热...
- 13 篇 核科学与技术
- 13 篇 生物医学工程（可授...
- 12 篇 仪器科学与技术
- 11 篇 材料科学与工程（可...
- 10 篇 建筑学
342 篇 理学
- 170 篇 数学
- 128 篇 物理学
- 69 篇 生物学
- 49 篇 统计学（可授理学、...
- 31 篇 系统科学
- 25 篇 化学
148 篇 管理学
- 88 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 17 篇 工商管理
26 篇 法学
- 21 篇 社会学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 经济学
- 10 篇 应用经济学
10 篇 医学
8 篇 农学
6 篇 教育学
2 篇 文学
1 篇 艺术学

主题

28 篇 network security
24 篇 feature extracti...
23 篇 deep learning
23 篇 security
19 篇 machine learning
19 篇 software
18 篇 malware
17 篇 semantics
17 篇 cryptography
15 篇 training
13 篇 network topology
13 篇 computational mo...
13 篇 data models
12 篇 optimization
12 篇 algorithm design...
11 篇 gravitational wa...
11 篇 data mining
11 篇 heuristic algori...
10 篇 conferences
10 篇 computer archite...

机构

634 篇 state key labora...
39 篇 state key labora...
24 篇 state key lab of...
18 篇 information engi...
17 篇 department of as...
16 篇 advanced technol...
16 篇 kamioka branch n...
16 篇 institute for pl...
16 篇 university of so...
16 篇 department of ph...
16 篇 department of ph...
16 篇 accelerator labo...
16 篇 faculty of infor...
15 篇 infn sezione di ...
15 篇 national tsing h...
15 篇 department of ph...
15 篇 department of ph...
15 篇 department of ph...
15 篇 scuola di ingegn...
15 篇 king’s college l...

作者

44 篇 luo xiangyang
30 篇 xiangyang luo
25 篇 shan zheng
19 篇 zheng shan
18 篇 fenlin liu
17 篇 pang jianmin
17 篇 jianmin pang
17 篇 liu fudong
16 篇 r. takahashi
16 篇 k. komori
16 篇 t. kajita
16 篇 s. eguchi
16 篇 t. sawada
16 篇 l.-w. luo
16 篇 c. kim
16 篇 t. akutsu
16 篇 h. tagoshi
16 篇 liu fenlin
16 篇 zheng zhang
15 篇 j. c. bayley

语言

927 篇 英文
18 篇 中文
10 篇 其他

检索条件"机构=State Key Laboratary of Mathematical Engineering and Advanced Computing"

共 955 条记录，以下是851-860 订阅

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

详细简洁

排序：

Exploiting Pure Superword Level Parallelism for Array Indirections

Exploiting Pure Superword Level Parallelism for Array Indire...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Huihui Sun Rongcai Zhao Wei Gao Yi Gong Gang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

SIMD (Single Instruction Multiple Data) extension units are ubiquitous in modern processors. Array indirections raise several challenges for SIMD vectorization including disjoint memory access, unknown alignment and dependence cycle. Existing SIMD automatic vectorization methods fail to handle these challenges very well. This paper presents a new method exploiting Pure SLP (Superword Level Parallelism) to address these problems. Dependence equation is rewritten to work out the dependence testing for index array. To address the problem of non-aligned and disjoint challenges, data alignment in recombinant registers and redundant statements are employed respectively. In addition, a precise cost model is proposed to guarantee positive benefits. Experiments on three typical array indirection applications extracted from SPEC2006 benchmarks verified the validity of this method.

关键词： Arrays Testing Indexes Parallel processing mathematical model Registers Program processors

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of City-Level Landmark Mining Based on Internet Forum

An Algorithm of City-Level Landmark Mining Based on Internet...

引用

International Conference on Network-Based Information Systems (NBIS)

作者： Guang Zhu Xiangyang Luo Fenlin Liu Jingning Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

Density and accuracy of network entity landmarks are an important foundation of IP geolocation. For the existing problems of the limited quantity and low reliability of landmarks mined by current landmark mining methods, an algorithm of city-level landmark mining based on Internet forum is proposed in this paper. Firstly, the basic principle of Web-Based landmark mining methods and their existing flaws are analyzed, and then according to existing a huge amount of individual IP addresses in the Internet forums, a technical framework of network entity landmark mining based on the Internet forum is given, Next, the Internet forum selection strategy, IP addresses extraction, IP addresses screening and other major processing steps are described respectively for two major parts of the framework, including landmark extraction algorithm and landmark evaluation algorithm. The classic GeoTrack, a network entity geolocation algorithm, is improved and used for evaluating the candidate landmarks. Finally, the feasibility of our framework and algorithm are studied from 2 aspects: forum selection strategy, and Forum-Based landmark mining algorithm. Experimental results based on 27 Internet forums of 3 types forums in 3 cities show that compared with the classic Web-Based landmark mining methods, the proposed algorithm can not only mine huge amounts of city-level landmarks, but also improve the city-level network entity geolocation accuracy obviously.

关键词： IP networks Geology Web servers Reliability Data mining HTML

来源：评论

学校读者我要写书评

暂无评论

An Embedded FPGA Operating System Optimized for Vision computing (Abstract Only) 15

An Embedded FPGA Operating System Optimized for Vision Compu...

引用

Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Zhilei Chai Jin Yu Zhibin Wang Jie Zhang Haojie Zhou Jiangnan University Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450333153

Although FPGA's power and performance advantages were recognized widely, designing applications on FPGA-based systems is traditionally a task undertaken by hardware experts. It is significant to allow application-level programmers with less system-level but more algorithm knowledge to realize their applications conveniently on FPGAs. In this paper, an embedded FPGA operating system is proposed to facilitate application-level programmers to use FPGAs. Firstly, it builds specific I/Os and optimizes bus interconnection among I/Os, DDR memory, user IPs etc within the FPGA for vision computing. Secondly, it manages resources of the FPGA such as I/Os, DDR memory, communication etc, frees users from low-level details. Thirdly, it schedules tasks (IPs) executed on the FPGA dynamically in runtime, which makes the FPGA multiplexed when necessary. After porting the FPGA operating system to different FPGA platforms and implementing vision algorithms based on that, it shows the FPGA operating system is able to simplify algorithm development on FPGA platforms and improve portability of user applications. Furthermore, implementation results of several popular vision algorithms show the FPGA operating system is efficient and effective for vision computing. Finally, experimental results shows that for multiple algorithms requiring more FPGA resources, runtime task scheduling of multiple IPs is more efficient than a fixed IP when the SoC of FPGA is considered.

关键词： vision computing operating systems portability of applications application programmers fpgas

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-based Application-Aware Multipath Routing for NoCs

Bandwidth-based Application-Aware Multipath Routing for NoCs

引用

2015 International Conference on Computer Information Systems and Industrial Applications(CISIA2015)

作者： X.T.Ding C.X.Yang X.W.Ren P J.Ren Institute of Artificial Intelligence and Robotics Xi'an Jiaotong University State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781510805750

Most of routing algorithms for On-chip communication are neither application-aware nor routing packets using multiple *** addition,they hardly consider link bandwidth variation resulting from widely applied global asynchronous local synchronous(GALS) *** this paper,we propose a bandwidth-based application-aware multipath routing(BAMR)algorithm to assign multiple routing paths by leveraging the knowledge of application and network bandwidth *** the increase of number of flows resulting from the split of flows,we present a new method named dynamic-amount fixed-number(DAFN) flow control mechanism to avoid *** compare our algorithm with XY,YX,and OITURN with synthetic traffic patterns and traffic trace of parallel implementation of *** demonstrate that BAMR achieves higher throughput with decrease in ***,the proposed algorithm achieves better workload balance by distributing traffic over multiple paths.

关键词： on-chip network GALS multiple routing

来源：评论

学校读者我要写书评

暂无评论

Fast Scalar Multiplication Algorithm Using Constrained Triple-Base Number System and Its Applications

Fast Scalar Multiplication Algorithm Using Constrained Tripl...

引用

International Conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Yunqi Dou Jiang Weng Chuangui Ma Fushan Wei Zhengzhou Information Science and Technology Institute State key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

With the rapid development of embedded devices, wireless sensor network and Internet of Things, elliptic curve cryptography as a public key cryptography plays an important role to solve the security challenges. How to improve the efficiency of scalar multiplication is a challenging work for future deployment of these new technologies. Because of its sparsity, triple-base number system is used to accelerate the scalar multiplication in elliptic curve cryptography. Instead of using triple base chain, we introduce the concept of constrained tripe-base number system, which sets maximums for exponents of bases 2, 3 and 5. On this basis, we propose two fast scalar multiplication algorithms for the situations with and without precomputations. Our experiments show that the two algorithms are more efficient than 4-NAF, double-base chain and triple-base chain approaches. The improvement of efficiency makes the two scalar multiplication algorithms more suit for wireless sensor network.

关键词： Elliptic curves Elliptic curve cryptography Wireless sensor networks Greedy algorithms Jacobian matrices

来源：评论

学校读者我要写书评

暂无评论

Ameba: A High-Performance and Energy-Efficient Online Video Retrieval System

Ameba: A High-Performance and Energy-Efficient Online Video ...

引用

IEEE International Conference on Multimedia Big Data (BigMM)

作者： Jin Yang Jianmin Pang Jintao Yu Wei Cao State Key Laboratory of Mathematical Engineering Advanced Computing Zhengzhou China State Key Laboratory of ASIC System Fudan University Shanghai China

ISBN: (纸本)9781479986897

This paper describes a high-performance and energy-efficient online video retrieval system called Ameba. Ameba contains a number of custom reconfigurable nodes which are grouped by a novel architecture. The system aims to address the performance and energy efficiency issues for large scale dynamic concurrent query requests. The open SURF approach and a Hamming distance based matching algorithm were implemented and improved on FPGA to increase the performance and energy efficiency. A predictive algorithm is proposed to forecast the trends of online query requests. This scalability which is obtained from the dynamic reconfiguration, makes the system have ability to improve its energy efficiency with the guarantee of performance. The simulation experiments are conducted with a considerable library which consists of 4650 videos with a combined length of more than 3000 hours. The comparative results demonstrate that Ameba has performance and energy efficiency advantages when facing large scale online video retrieval requests.

关键词： Field programmable gate arrays Energy efficiency Prediction algorithms Servers Computer architecture Streaming media Feature extraction

来源：评论

学校读者我要写书评

暂无评论

GCORE: A Gravitation-Based Approach for Chinese Open Relation

GCORE: A Gravitation-Based Approach for Chinese Open Relatio...

引用

International Conference on Computer Science and Mechanical Automation (CSMA)

作者： Yue Wang Gang Zhou Fei Tian Yu Nan Jiangtao Ma Information and Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information and Engineering University Zhengzhou China

Traditional Relation Extraction (RE) trains individual extractors for pre-defined relations. Open Relation Extraction (ORE) can eschew domain-specific training data, tackle an unbounded number of relations, and scale up to massive and heterogeneous corpus such as the web. However, It is difficult to process micro log texts: the genre is noisy, utterances are very short, and texts have little context. As such, conventional RE approaches fail when faced with micro log and other Web texts. In this paper, we present a gravitation-based Chinese ORE approach to extracting relations between entities by using the idea of the law of universal gravitation. GCORE produces heuristic rules to extract entity relations, and calculates a confidence score for each relational tuple, which is directly proportional to the product of the frequency of entity pairs and the frequency of relation words, and inversely proportional to the square of the distance between the relation word and the candidate entity pair. The confidence score can be used to show the reliability of relational tuples. The higher the score, the more reliable the candidate tuple is, and vice versa. The experimental evaluation over two data sets from ZORE demonstrates the correctness and effectiveness of our proposed approach, and empirical results on Weibo texts show the universality of GCORE.

关键词： Reliability Data mining Context Information services Electronic publishing Internet Force

来源：评论

学校读者我要写书评

暂无评论

Carrier-depletion Mach-Zehnder silicon optical modulator for high-speed and multi-level applications

Carrier-depletion Mach-Zehnder silicon optical modulator for...

引用

IEEE International Conference on Group IV Photonics

作者： Jianfeng Ding Lin Yang Lei Zhang Ping Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China State Key Laboratory on Integrated Optoelectronics Institute of Semiconductors Beijing China

We demonstrate a 64-Gbps carrier-depletion modulator which also can be used to generate the PAM-4 optical signal. This proves that the silicon optical modulator is suitable for different kinds of applications.

ISBN: (纸本)9781479982561

关键词： Optical device fabrication Nonlinear optics Optical modulation High-speed optical techniques Silicon

来源：评论

学校读者我要写书评

暂无评论

An ant colony algorithm and improvement for the state transition diagram search

An ant colony algorithm and improvement for the state transi...

引用

2015 International Industrial Informatics and Computer engineering Conference(IIICEC 2015)

作者： Xiao Da Shengli Liu Yuefei Zhu Xiadong Wang Li Rui Computer network department Zheng Zhou Information Science University State Key Laboratory of Mathematical Engineering and Advanced Computing

Aiming at the state transition quick extraction problem for sequential logic chip,has desined a state transition graph extraction algorithm based on ant colony algorithm model,besides that,the ant colony algorithm model has been introduced in details,and according to the characteristics of the graph state transfer,the ant colony algorithm has been improved,has designed the state transition graph realization method in details oriented to the ant colony *** tests show that,the ant colony algorithm is designed in this paper can realize fast state transition graph extraction.

关键词： The state transition diagram Ant colony algorithm Sequential logic chip Shortest path Fast state test

来源：评论

学校读者我要写书评

暂无评论

A MPI-Friendly Efficient Static Binary Translator Based on QEMU

A MPI-Friendly Efficient Static Binary Translator Based on Q...

引用

International Conference on Computer Science and Mechanical Automation (CSMA)

作者： Shuaibing Lu Jianmin Pang Yaomin Pan Jie Tan Tao Dai State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Zhengzhou Science and Technology Institute Zhengzhou China

ISBN: (纸本)9781467391672

While high performance computing (HPC) is flourishing these years, the lack of HPC applications is increasingly serious. Conventional binary translation focused on desktop applications and embedded software, which could not be scaled up to HPC. This paper proposed a novel static binary translator MPI-QEMU aiming at MPI programs, the most commonly used on HPC platforms. Firstly, the efficient dynamic binary translator QEMU was altered to a static binary translator to translate the source binary to target platforms. Secondly, by analysing the symbol table and global offset table, the library function name and address were extracted and jacketed. Finally, the generated codes were linked with corresponding native library functions including MPI to generate the target executive binary. The experiments on NPB and IMB benchmarks show that MPI-QEMU translates the benchmarks successfully and gains dramatically speedup.

关键词： Libraries Benchmark testing Software Electronic mail Registers Generators Emulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共96页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：