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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

15 篇 会议
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

18 篇 工学
- 13 篇 计算机科学与技术...
- 6 篇 电气工程
- 4 篇 控制科学与工程
- 3 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 仪器科学与技术
5 篇 理学
- 3 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
1 篇 医学
- 1 篇 临床医学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

19 篇 shuffle algorith...
3 篇 jpeg
3 篇 lossless
2 篇 vector-descripto...
2 篇 random placement
2 篇 descriptor
2 篇 stochastic autom...
2 篇 military chess
2 篇 s-box
2 篇 blowfish algorit...
2 篇 computer game
2 篇 large and sparse...
2 篇 generalized tens...
2 篇 singular systems
2 篇 drazin inverse
2 篇 numerical method...
1 篇 csidh
1 篇 system
1 篇 permutation
1 篇 approach

机构

2 篇 guangxi normal u...
2 篇 ensimag lab id i...
2 篇 west visayas sta...
2 篇 n carolina state...
2 篇 technol inst phi...
1 篇 wuhan univ sch c...
1 篇 natl univ def te...
1 篇 shenyang aerospa...
1 篇 college of elect...
1 篇 bilkent univ dep...
1 篇 hunan univ coll ...
1 篇 univ reading sch...
1 篇 inst tecnol aero...
1 篇 univ politecn va...
1 篇 kocaeli univ bil...
1 篇 inspur acad sci ...
1 篇 bialystok tech u...
1 篇 bialystok tech u...
1 篇 natl univ def te...
1 篇 ohio state univ ...

作者

2 篇 gerardo bobby d.
2 篇 medina ruji p.
2 篇 sanchez e.
2 篇 stewart william ...
2 篇 thome n.
2 篇 coll c.
2 篇 wang w. y.
2 篇 corpuz reynaldo ...
2 篇 ginestar d.
2 篇 plateau brigitte
2 篇 benoit anne
1 篇 jiehong wu
1 篇 wang linyue
1 篇 w.y wang
1 篇 sondas adnan
1 篇 tong kai
1 篇 yang jiawei
1 篇 guo yang
1 篇 zhang junyi
1 篇 konyar mehmet ze...

语言

18 篇 英文
1 篇 土耳其文

检索条件"主题词=Shuffle algorithm"

共 19 条记录，以下是11-20 订阅

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

详细简洁

排序：

SCD-PUF: shuffled Chaotic-dual-PUF With High Machine Learning Attack Resilience 8

SCD-PUF: Shuffled Chaotic-dual-PUF With High Machine Learnin...

引用

8th IEEE International Test Conference in Asia (ITC-Asia)

作者： Peng, Yijing Deng, Ding Wang, Zhenyu Guo, Yang Natl Univ Def Technol Key Lab Adv Microprocessor Chips & Syst Changsha Peoples R China Natl Univ Def Technol Coll Elect Sci & Technol Changsha Peoples R China Hunan Univ Coll Semicond Changsha Peoples R China

ISBN: (纸本)9798331540340;9798331540333

Physical unclonable functions (PUFs) provide a promising solution for enhancing security and device authentication. Strong PUFs can generate quantities of challenge-response pairs(CRPs) but are vulnerable to machine learning (ML) attacks. Weak PUFs must restrict direct access to the original response because they have limited CRPs. In this article, we present a shuffled Chaotic-dual-PUF structure(SCD-PUF) to defeat against ML attacks. Its working procedure is divided into two main stages: In the first phase, the weak PUF is used to generate secret bits as parameters for the chaotic configuration and along with the secret bits generated by the chaotic process, serve as the obfuscation configuration for the second phase. The second stage involves the Knuth-Durstenfeld shuffle algorithm, concatenation and XOR operations to obfuscate the challenges and responses at the same time. To prove the effectiveness of our proposal, we implement an example of SCD-PUF using Static Random-Access Memory(SRAM) PUF and Arbiter PUF(APUF) on Xilinx ZedBoard FPGAs. Using Logistic Regression (LR), Support Vector Machine (SVM), and Artificial Neural Networks (ANN) as attacking methods, the learning accuracy is maintained at around 51% even when the training data increase to one million, which proves our proposal has enough resistance to ML attacks. Also, the area overhead of our proposal is appropriate and acceptable.

关键词： PUF chaos machine learning shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Using a Modified Approach of Blowfish algorithm for Data Security in Cloud Computing 2018

Using a Modified Approach of Blowfish Algorithm for Data Sec...

引用

6th International Conference on Information Technology - IoT and Smart City (ICIT)

作者： Corpuz, Reynaldo R. Gerardo, Bobby D. Medina, Ruji P. Technol Inst Philippines 938 Aurora Blvd Quezon City 1109 Philippines West Visayas State Univ Iloilo Philippines

ISBN: (纸本)9781450366298

Cloud computing brought remarkable potential changes and excellent opportunities to the information technology industry. It is particularly useful in most of the networked transactions. Cloud computing common issue problems associated with data security. Information is secure if it fulfills the three conditions namely Confidentiality, Integrity and Availability. In cloud computing confidentiality is obtained by cryptography. Symmetric algorithms notably Blowfish algorithm displayed undeniable success in cryptography. In this paper, a Modified Approach of Blowfish algorithm using shuffle algorithm was applied and test the encryption, decryption speed, and throughput. The result shows that the higher the performance, the higher the efficiency of encrypting files.

关键词： Cloud Computing Blowfish algorithm S-box permutation shuffle algorithm Encryption Decryption

来源：评论

学校读者我要写书评

暂无评论

HOMR: A Hybrid Approach to Exploit Maximum Overlapping in MapReduce over High Performance Interconnects 14

HOMR: A Hybrid Approach to Exploit Maximum Overlapping in Ma...

引用

28th ACM International Conference on Supercomputing (ICS)

作者： Wasi-ur-Rahman, Md. Lu, Xiaoyi Islam, Nusrat S. Panda, Dhabaleswar K. (DK) Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781450326421

Hadoop MapReduce is the most popular open-source parallel programming model extensively used in Big Data analytics. Although fault tolerance and platform independence make Hadoop MapReduce the most popular choice for many users, it still has huge performance improvement potentials. Recently, RDMA-based design of Hadoop MapReduce has alleviated major performance bottlenecks with the implementation of many novel design features such as in-memory merge, prefetching and caching of map outputs, and overlapping of merge and reduce phases. Although these features reduce the overall execution time for MapReduce jobs compared to the default framework, further improvement is possible if shuffle and merge phases can also be overlapped with the map phase during job execution. In this paper, we propose HOMR (a Hybrid approach to exploit maximum Overlapping in MapReduce), that incorporates not only the features implemented in RDMA-based design, but also exploits maximum possible overlapping among all different phases compared to current best approaches. Our solution introduces two key concepts: Greedy shuffle algorithm and On demand shuffle Adjustment, both of which are essential to achieve significant performance benefits over the default MapReduce framework. Architecture of HOMR is generalized enough to provide performance efficiency both over different Sockets interface as well as previous RDMA-based designs over InfiniBand. Performance evaluations show that HOMR with RDMA over InfiniBand can achieve performance benefits of 54% and 56% compared to default Hadoop over IPoIB (IP over InfiniBand) and 10 GigE, respectively. Compared to the previous best RDMA-based designs, this benefit is 29%. HOMR over Sockets also achieves a maximum of 38-40% benefit compared to default Hadoop over Sockets interface. We also evaluate our design with real-world workloads like SWIM and PUMA, and observe benefits of up to 16% and 18%, respectively, over the previous best-case RDMA-based design. To

关键词： MapReduce shuffle algorithm High Performance Interconnects Overlapping Execution

来源：评论

学校读者我要写书评

暂无评论

Numerical Methods for Singular Linear Differential Systems

Numerical Methods for Singular Linear Differential Systems

引用

7th International Conference on Engineering Computational Technology

作者： Thome, N. Ginestar, D. Sanchez, E. Coll, C. Univ Politecn Valencia Inst Multidisciplinary Math E-46022 Valencia Spain

ISBN: (纸本)9781905088416

In this paper, numerical methods for the solution of linear singular differential systems are analyzed. A numerical solution technique which solves consistent initial value problems is introduced by using theory of the Drazin inverses. The performance of the resulting numerical methods is tested with a singular system associated with a circuit involving an ideal transformer.

关键词： singular systems numerical methods shuffle algorithm Drazin inverse

来源：评论

学校读者我要写书评

暂无评论

Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems

Memory-efficient Kronecker algorithms with applications to t...

引用

International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems

作者： Benoit, Anne Plateau, Brigitte Stewart, William J. ENSIMAG Lab ID IMAG Antenne Montbonnot F-38330 Montbonnot St Martin France N Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA

ISBN: (纸本)0769519261

We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of stochastic automata. The tensor structure inherently involves a product state space but, inside this product state space, the actual reachable state space can be much smaller. For such cases, we propose an improvement of the standard numerical algorithm, the so-called "shuffle algorithm", which necessitates only vectors of the size of the actual state space. With this contribution, numerical algorithms based on tensor products can now handle larger models. (C) 2006 Elsevier B.V. All rights reserved.

关键词： large and sparse Markov chains stochastic automata networks generalized tensor algebra vector-descriptor multiplication shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Descriptor positive discrete-time and continuous-time nonlinear systems

Descriptor positive discrete-time and continuous-time nonlin...

引用

Conference on Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments

作者： Kaczorek, Tadeusz Bialystok Tech Univ Fac Elect Engn PL-15351 Bialystok Poland

The positivity of discrete-time and continuous-time nonlinear systems is addressed. Necessary and sufficient conditions for the positivity of the descriptor nonlinear systems are established. A procedure for checking ... 详细信息

ISBN: (纸本)9781628413694

关键词： approach descriptor nonlinear system shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Random placement algorithm of Military game based on Fisher-Yates 33

Random placement algorithm of Military game based on Fisher-...

引用

33rd Chinese Control and Decision Conference (CCDC)

作者： Tong, Kai Wu, Jiehong Yang, Jiawei Li, Jing Zhang, Junyi Wang, Linyue Shenyang Aerosp Univ Shenyang 110000 Peoples R China

ISBN: (纸本)9781665440899

Computer game [1] is a research field, an important research direction in the field of artificial intelligence, and an important scientific research foundation in the field of machine intelligence, wargame deduction, intelligent decision system and other artificial intelligence. Machine game is considered to be one of the most challenging research directions in the field of artificial intelligence. As a member of computer game, military game is a game with incomplete and asymmetric information. One of the important links is that both sides need to play according to their own wishes in advance. It can be said that in the computer Military game, the layout affects the outcome of the whole game to a certain extent. In order to solve the problem of layout choice in practice, this paper proposes a random layout algorithm based on Fisher Yates shuffle algorithm, which can be used to generate absolutely random military chess layout, test the existing layout and program strength, and find the most suitable layout for the determined combat strategy and style. Compared with the previous method of generating a large amount of test data randomly, it can solve the problem. The new algorithm optimizes the original 25! times to 50 times, and optimizes the algorithm from O (n(2)) of Fisher algorithm to O(n), so researchers can have more energy to find the best way for different strategies, which objectively strengthens the combat capability of the program. And it weakens the influence of human factors in the test and reduces the dependence on human intelligence in computer game.

关键词： Computer Game shuffle algorithm Military Chess Random Placement

来源：评论

学校读者我要写书评

暂无评论

New Lossless Compression Method for JPEG

New Lossless Compression Method for JPEG

引用

Pacific-Asia Conference on Circuits, Communications and Systems

作者： Wang, W. Y. Guangxi Normal Univ Coll Elect Engn Guilin Peoples R China

ISBN: (纸本)9780769536149

Universal lossless algorithms of data compression are always efficient to text and inefficient to JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG. In the end, using the typical example as experiment has been carried out and obtained a preferable compression ratio with little time cost.

关键词： lossless JPEG shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Random placement algorithm of Military game based on Fisher-Yates

Random placement algorithm of Military game based on Fisher-...

引用

第33届中国控制与决策会议

作者： Kai Tong Jiehong Wu Jiawei Yang Jing Li Junyi Zhang Linyue Wang Shenyang Aerospace University

Computer game is a research field,an important research direction in the field of artificial intelligence,and an important scientific research foundation in the field of machine intelligence,wargame deduction,intelligent decision system and other artificial *** game is considered to be one of the most challenging research directions in the field of artificial *** a member of computer game,military game is a game with incomplete and asymmetric *** of the important links is that both sides need to play according to their own wishes in *** can be said that in the computer Military game,the layout affects the outcome of the whole game to a certain *** order to solve the problem of layout choice in practice,this paper proposes a random layout algorithm based on Fisher Yates shuffle algorithm,which can be used to generate absolutely random military chess layout,test the existing layout and program strength,and find the most suitable layout for the determined combat strategy and *** with the previous method of generating a large amount of test data randomly,it can solve the *** new algorithm optimizes the original 25!times to 50 times,and optimizes the algorithm from O（n） of Fisher algorithm to O（n）,so researchers can have more energy to find the best way for different strategies,which objectively strengthens the combat capability of the *** it weakens the influence of human factors in the test and reduces the dependence on human intelligence in computer game.

关键词： Computer Game shuffle algorithm Military Chess Random Placement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：