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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是211-220 订阅

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

详细简洁

排序：

2019 ieee 18th International symposium on Network Computing and Applications, NCA 2019

2019 IEEE 18th International Symposium on Network Computing ...

引用

18th ieee International symposium on Network Computing and Applications, NCA 2019

ISBN: (纸本)9781728125220

the proceedings contain 58 papers. the topics discussed include: a randomized algorithm for joint power and channel allocation in 5G D2D communication;anomalous communications detection in IoT networks using sparse autoencoders;using LSTM neural network for time series predictions in financial markets;digital signature based countermeasure against puppet attack in the Internet of things;to route or to ferry: a hybrid packet forwarding algorithm in flying ad hoc networks;towards occupation inference in non-instrumented services;and nap: network-aware data partitions for efficient distributed processing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Clustering Analysis for Big Data in Network Security Domain Using a Spark-Based Method

Clustering Analysis for Big Data in Network Security Domain ...

引用

ieee International symposium on Wireless Systems (IDAACS-SWS)

作者： Hui Xu Wei Zhang Man Gao Hongwei Chen No. 28 Nanli Road Hong-shan District Hubei University of Technology Wuhan China

ISBN: (数字)9781728199603

ISBN: (纸本)9781728199610

Considering the problem of network security under the background of big data, the clustering analysis algorithms can be utilized to improve the correctness of network intrusion detection models for security management. As a kind of iterative clustering analysis algorithm, K-means algorithm is not only simple but also efficient, so it is widely used. However, the traditional K-means algorithm cannot well solve the network security problem when facing big data due to its high complexity and limited processing ability. In this case, this paper proposes to optimize the traditional K-means algorithm based on the Spark platform and deploy the optimized clustering analysis algorithm in the distributed architecture, so as to improve the efficiency of clustering algorithm for network intrusion detection in big data environment. the experimental result shows that, compared with the traditional K-means algorithm, the efficiency of the optimized K-means algorithm using a Spark-based method is significantly improved in the running time.

关键词： Clustering algorithms Big Data Security Sparks Communication networks distributed databases Arrays

来源：评论

学校读者我要写书评

暂无评论

parallel FEM-DDM with BD-SGS Preconditioner for 3D Scattering by Large Inhomogeneous Objects 5

Parallel FEM-DDM with BD-SGS Preconditioner for 3D Scatterin...

引用

5th ieee International Conference on Computational Electromagnetics, ICCEM 2019

作者： Liu, Rui-Qing Yang, Ming-Lin Gao, Hong-Wei Sheng, Xin-Qing Center for Electromagnetic Simulation Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9781538671115

We present in this paper a flexible and efficient block diagonal symmetric Gauss-Seidel (BD-SGS) preconditioner for the hierarchical parallel FEM-DDM. In the hierarchical domain decomposition scheme, the whole FEM solution domain is first decomposed into large size subdomains with a total number equals to MPI processes. then, each large subdomain is distributed to a MPI process and further decomposed into smaller ones to achieve good computation efficiency. Our preconditioner is based on this hierarchical parallel structure. It is specially designed to accelerate the convergence of iterative solution and reduce both the time and memory consumption of the reduced interface problems from FEM-DDM by constructing symmetric Gauss-Seidel preconditioner (SGS) for each large subdomain. Numerical examples are presented to demonstrate the efficiency, scalability, and capability of this specially designed BD-SGS preconditioner. © 2019 ieee.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

Ultra reliable communication: Aavailability analysis in 5g cellular networks 20

Ultra reliable communication: Aavailability analysis in 5g c...

引用

20th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2019

作者： Benchaabene, Yosra Boujnah, Noureddine Zarai, Faouzi National Engineering Schcool of Gabes Tunisia Research Unit in New Technology and Telecom System Sfax Tunisia Faculty of Sciences of Gabes Tunisia TSSG-Waterford Institute of Technology Ireland National School of Electronics and Telecommunications of Sfax Research Unit in New Technology and Telecom System Sfax Tunisia

ISBN: (纸本)9781728126166

To meet the growing demand of users, the fifth generation (5G) will continue to provide services to higher data rates with higher carrier frequencies and wider bandwidths. As part of the 5G communication paradigm, ultra-reliable communication (URC) is envisaged as an important technology pillar for providing anywhere and anytime services to end users. Ultra Reliable Communication (URC) is considered an important technology that why it has become an active research topic. In this work, we analyze the availability of a service in the space domain. We characterize spatially available areas consisting of all locations that meet a performance requirement with confidence, and we define cell availability and system availability, individual user availability and user-oriented System Availability. Poisson point process (PPP) and Voronoi tessellation are adopted to model the spatial characteristics of a cell deployment in heterogeneous networks. Numerical results are presented, also highlighting the effect of different system parameters on the achievable link availability. © 2019 ieee.

关键词： Availability

来源：评论

学校读者我要写书评

暂无评论

distributed SDN Architecture for NoC-based Many-core SoCs 19

Distributed SDN Architecture for NoC-based Many-core SoCs

引用

13th ieee/ACM International symposium on Networks-on-Chip (NOCS)

作者： Ruaro, Marcelo Velloso, Nedison Jantsch, Axel Moraes, Fernando G. Pontificia Univ Catolica Rio Grande do Sul Porto Alegre RS Brazil TU Wien Vienna Austria

ISBN: (纸本)9781450367004

In the Software-Defined Networking (SDN) paradigm, routers are generic and programmable forwarding units that transmit packets according to a given policy defined by a software controller. Recent research has shown the potential of such a communication concept for NoC management, resulting in hardware complexity reduction, management flexibility, real-time guarantees, and self-adaptation. However, a centralized SDN controller is a bottleneck for large-scale systems. Assuming an NoC with multiple physical subnets, this work proposes a distributed SDN architecture (D-SDN), with each controller managing one cluster of routers. Controllers work in parallel for local (intra-cluster) paths. For global (inter-cluster) paths, the controllers execute a synchronization protocol inspired by VLSI routing, with global and detailed routing phases. this work also proposes a short path establishment heuristic for global paths that explores the controllers' parallelism. D-SDN outperforms a centralized approach (C-SDN) for larger networks without loss of success rate. Evaluations up to 2,304 cores and 6 subnets shows that: (i) D-SDN outperforms C-SDN in path establishment latency up to 69.7% for 1 subnet above 32 cores, and 51% for 6 subnets above 1,024 cores;(ii) D-SDN achieves a smaller latency then C-SDN (on average 54%) for scenarios with more than 70% of local paths;(iii) the path success rate, for all scenarios, is similar in both approaches, with an average difference of 1.7%;(iv) the data storage for the C-SDN controller increases with the system size, while it remains constant for D-SDN.

关键词： Network-on-Chip (NoC) Software-Defined Networking (SDN) distributed Management System-on-Chip (SoC) Many-core

来源：评论

学校读者我要写书评

暂无评论

Additive logarithmic weighting HetNet selection method for video services over 5G networks 19

Additive logarithmic weighting HetNet selection method for v...

引用

proceedings of the 23rd ieee/ACM International symposium on distributed Simulation and Real Time Applications

作者： Cristina Desogus Mauro Fadda Sara Pizzi Giacomo Genovese Maurizio Murroni University of Cagliari Italy Mediterranea University of Reggio Calabria Italy

ISBN: (纸本)9781728129235

5th-Generation (5G) applications require high data rates and Quality of Service (QoS) levels. Mobile devices can access the Internet exploiting several technologies, as for example Long Term Evolution (LTE) or Wireless Fidelity (WiFi). In this context, the heterogeneous network (HetNet) paradigm has been introduced to allow the coexistence of devices and services with different characteristics assuring a high QoS level to users without modifying resource distribution and management. Several access network selection methods have been proposed showing the limitation of not considering both the type of traffic for the service requested by users and the characteristics of devices. To overcome this limitation, a new HetNet selection method based on additive logarithmic weighting (ALW) algorithm is presented in this paper, combining information related to the received signal power, network load, and mobility of users.

关键词： 5G video services HetNets logarithmic algorithm

来源：评论

学校读者我要写书评

暂无评论

XPC: Architectural Support for Secure and Efficient Cross Process Call 19

XPC: Architectural Support for Secure and Efficient Cross Pr...

引用

46th International symposium on Computer Architecture (ISCA)

作者： Du, Dong Hua, Zhichao Xia, Yubin Zang, Binyu Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Key Lab Scalable Comp Syst Shanghai Peoples R China

ISBN: (纸本)9781450366694

Microkernel has many intriguing features like security, fault-tolerance, modularity and customizability, which recently stimulate a resurgent interest in both academia and industry (including seL4, QNX and Google's Fuchsia OS). However, IPC (inter-process communication), which is known as the Achilles' Heel of microkernels, is still the major factor for the overall (poor) OS performance. Besides, IPC also plays a vital role in monolithic kernels like Android Linux, as mobile applications frequently communicate with plenty of user-level services through IPC. Previous software optimizations of IPC usually cannot bypass the kernel which is responsible for domain switching and message copying/remapping;hardware solutions like tagged memory or capability replace page tables for isolation, but usually require non-trivial modification to existing software stack to adapt the new hardware primitives. In this paper, we propose a hardware-assisted OS primitive, XPC (Cross Process Call), for fast and secure synchronous IPC. XPC enables direct switch between IPC caller and callee without trapping into the kernel, and supports message passing across multiple processes through the invocation chain without copying. the primitive is compatible with the traditional address space based isolation mechanism and can be easily integrated into existing microkernels and monolithic kernels. We have implemented a prototype of XPC based on a Rocket RISC-V core with FPGA boards and ported two microkernel implementations, seL4 and Zircon, and one monolithic kernel implementation, Android Binder, for evaluation. We also implement XPC on GEM5 simulator to validate the generality. the result shows that XPC can reduce IPC call latency from 664 to 21 cycles, up to 54.2x improvement on Android Binder, and improve the performance of real-world applications on microkernels by 1.6x on Sqlite3 and 10x on an HTTP server with minimal hardware resource cost.

关键词： operating system microkernel inter-process communication accelerators

来源：评论

学校读者我要写书评

暂无评论

FPGA-based High-Performance parallel Architecture for Homomorphic Computing on Encrypted Data 25

FPGA-based High-Performance Parallel Architecture for Homomo...

引用

25th ieee International symposium on High Performance Computer Architecture (HPCA)

作者： Roy, Sujoy Sinha Turan, Furkan Jarvinen, Kimmo Vercauteren, Frederik Verbauwhede, Ingrid Katholieke Univ Leuven Imec COSIC Leuven Belgium Univ Birmingham Sch Comp Sci Birmingham W Midlands England Univ Helsinki Dept Comp Sci Helsinki Finland

ISBN: (纸本)9781728114446

Homomorphic encryption is a tool that enables computation on encrypted data and thus has applications in privacy-preserving cloud computing. though conceptually amazing, implementation of homomorphic encryption is very challenging and typically software implementations on general purpose computers are extremely slow. In this paper we present our year long effort to design a domain specific architecture in a heterogeneous Arm+FPGA platform to accelerate homomorphic computing on encrypted data. We design a custom co-processor for the computationally expensive operations of the well-known Fan-Vercauteren (FV) homomorphic encryption scheme on the FPGA, and make the Arm processor a server for executing different homomorphic applications in the cloud, using this FPGA-based co-processor. We use the most recent arithmetic and algorithmic optimization techniques and perform design-space exploration on different levels of the implementation hierarchy. In particular we apply circuit-level and block-level pipeline strategies to boost the clock frequency and increase the throughput respectively. To reduce computation latency, we use parallel processing at all levels. Starting from the highly optimized building blocks, we gradually build our multi-core multi-processor architecture for computing. We implemented and tested our optimized domain specific programmable architecture on a single Xilinx Zynq UltraScale+ MPSoC ZCU102 Evaluation Kit. At 200 MHz FPGA-clock, our implementation achieves over 13x speedup with respect to a highly optimized software implementation of the FV homomorphic encryption scheme on an Intel i5 processor running at 1.8 GHz.

关键词： Cloud computing privacy in cloud computing homomorphic encryption FV homomorphic encryption latticebased cryptography polynomial multiplication number theoretic transform domain specific accelerator hardware accelerator

来源：评论

学校读者我要写书评

暂无评论

Succinct representations in collaborative filtering: A case study using wavelet tree on 1,000 cores 20

Succinct representations in collaborative filtering: A case ...

引用

20th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2019

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

ISBN: (纸本)9781728126166

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. © 2019 ieee.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study to Detect the Collision Rate in Similarity Hashing Algorithm Using MD5 5

An Empirical Study to Detect the Collision Rate in Similarit...

引用

5th International Conference on Data Science and Engineering, ICDSE 2019

作者： Gangavarapu, Tushaar Jaidhar, C.D. Worldwide Deals Automated Advertising *** Inc. Bangalore India National Institute of Technology Karnataka Department of Information Technology Mangalore India

ISBN: (纸本)9781728120874

Similarity Hashing (SimHash) is a widely used locality-sensitive hashing algorithm employed in the detection of similarity, in large-scale data processing, including plagiarism detection and near-duplicate web document detection. Collision resistance is a crucial property of cryptographic hash algorithms that are used to verify the message integrity in internet security applications. A hash function is said to be collision-resistant if it is hard to find two different inputs that hash to the same output. In this paper, we present an empirical study to facilitate the detection of collision rate when SimHash is employed to check the integrity of the message. the analysis was performed using bit sequences with length varying from 2 to 32 and Message Digest 5 (MD5) as the internal hash function. Furthermore, to enable faster collision detection with more significant speedup and efficient space utilization, we parallelized the process using a distributed data-parallel approach with synchronous computation and optimum load balancing. Collision detection is desirable, owing to its applicability in digital signature systems, proof-of-work systems, and distributed content systems. Our empirical study revealed a collision rate of 0% to 0.048% in SimHash (with MD5) with the variation in the length of the bit sequence. © 2019 ieee.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：