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

24th European MPI Users" Group Meeting, EuroMPI 2017

作者： Morgan, Bradley Holmes, Daniel J. Skjellum, Anthony Bangalore, Purushotham Sridharan, Srinivas Auburn University United States EPCC University of Edinburgh Scotland United Kingdom Dept. of Computer Science and Software Engineering Auburn University United States Dept. of Computer Science University of Alabama at Birmingham BirminghamAL35294-1170 United States SimCenter University of Tennessee ChattanoogaTN United States Intel Corporation 23-56P Outer Ring Road Bangalore560017 India

ISBN: (纸本)9781450348492

Advantages of nonblocking collective communication in MPI have been established over the past quarter century, even predating MPI-1. For regular computations with fixed communication patterns, more optimizations can be revealed through the use of persistence (planned transfers) not currently available in the MPI-3 API except for a limited form of point-to-point persistence (aka half-channels) standardized since MPI-1. This paper covers the design, prototype implementation of LibPNBC (based on LibNBC), and MPI-4 standardization status of persistent nonblocking collective operations. We provide early performance results, using a modified version of NBCBench and an example illustrating the potential performance enhancements for such operations. Persistent operations allow MPI implementations to make intelligent choices about algorithm and resource utilization once and amortize this decision cost across many uses in a long-running program. Evidence that this approach is of value is provided. As with non-persistent, nonblocking collective operations, the requirement for strong progress and blocking completion notification are jointly needed to maximize the benefit of such operations (e.g., overlap of communication with computation or other communication). Further enhancement of the current implementation prototype as well as additional opportunities to enhance performance through the application of these new APIs comprise future work. © 2017 Association for Computing Machinery.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

software Defect Prediction using Feature Selection and Random Forest Algorithm

Software Defect Prediction using Feature Selection and Rando...

引用

International Conference on New Trends in Computing sciences (ICTCS)

作者： Dyana Rashid Ibrahim Rawan Ghnemat Amjad Hudaib Dept. of Computer Science Princess Sumaya University for Technology Amman Jordan Dept. of Software Engineering University of Jordan Amman Jordan

ISBN: (纸本)9781538605288

software testing is the most important task in software production and it takes a lot of time, cost and effort. Thus, we need to reduce these resources. software Defect Prediction (SDP) mechanisms are used to enhance the work of SQA process through the prediction of defective modules, many approaches have been conducted by researchers in order to predict the fault-proneness modules. This paper proposed an approach for the SDP purpose, it employs two existed algorithms to have a high performance, that are the Bat-based search Algorithm (BA) for the feature selection process, and the Random Forest algorithm (RF) for the prediction purpose. This paper also has tested a number of feature selection algorithms and classifiers to see their effectiveness in this problem.

关键词： Classification algorithms Prediction algorithms software Feature extraction Radio frequency Algorithm design and analysis software algorithms

来源：评论

学校读者我要写书评

暂无评论

360◦ Panorama cloning on sphere

arXiv

引用

arXiv 2017年

作者： Zhao, Qiang Wan, Liang Feng, Wei Zhang, Jiawan Wong, Tien-Tsin Institute of Computing Technology Chinese Academy of Sciences China School of Computer Software Tianjin University China School of Computer Science and Technology Tianjin University China Dept. of Computer Science and Engineering Chinese University of Hong Kong

In this paper, we address a novel problem of cloning a patch of the source spherical panoramic image to the target spherical panoramic image, which we call 360◦ panorama cloning. Considering the sphere geometry constraint embedded in spherical panoramic images, we develop a coordinate-based method that directly clones in the spherical domain. Our method neither differentiates the polar regions and equatorial regions, nor identifies the boundaries in the unrolled planar-formatted panorama. We discuss in depth two unique issues in panorama cloning, i.e. preserving the patch's orientation, and handling the large-patch cloning (covering over 180◦ field-of-view) which may suffer from discoloration artifacts. As experimental results demonstrate, our method is able to get visually pleasing cloning results and achieve real time cloning performance. Copyright © 2017, The Authors. All rights reserved.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

3D face recognition via discriminative keypoint selection

3D face recognition via discriminative keypoint selection

引用

International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)

作者： Jiwhan Kim Dongyoon Han Wonjun Hwang Junmo Kim School of Electrical Engineering Korea Advanced Institute of Science and Technology Daejeon South Korea Dept. of Software and Computer Engineering Ajou University Suwon South Korea

In this paper, we propose a discriminative keypoint selection-based 3D face recognition method that is superior to prevalent techniques in terms of both computational complexity and performance. We use the average face model (AFM) for face registration to efficiently locate the axis of symmetry in the rotated face mesh and recover a full frontal face from a 3D face model commonly corrupted due to pose variances. Instead of using the keypoint detection method, we use the feature selection algorithm to find the most discriminant keypoints for face identification and reduce computational time for not only feature extraction but also keypoint matching. The results of the experiments conducted on the Bosphorus database and the UMBDB show that our algorithm can improve rank-1 identification accuracy, thus confirming its robustness against pose variances, expressions, and occlusions.

关键词： Face Three-dimensional displays Face recognition Databases Solid modeling Feature extraction Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Identifying recent behavioral data length in mobile phone log

arXiv

引用

arXiv 2017年

作者： Sarker, Iqbal H. Kabir, Muhammad Ashad Colman, Alan Han, Jun Dept. of Computer Science Software Engineering Swinburne University of Technology VIC Australia School of Computing and Mathematics Charles Sturt University NSW Australia

Mobile phone log data (e.g., phone call log) is not static as it is progressively added to day-by-day according to individual's diverse behaviors with mobile phones. Since human behavior changes over time, the most recent pattern is more interesting and significant than older ones for predicting individual's behavior. The goal of this poster paper is to identify the recent behavioral data length dynamically from the entire phone log for recency-based behavior modeling. To the best of our knowledge, this is the first dynamic recent log-based study that takes into account individual's recent behavioral patterns for modeling their phone call behaviors. Copyright © 2017, The Authors. All rights reserved.

关键词： Cellular telephones

来源：评论

学校读者我要写书评

暂无评论

Neighboring Zipcodes -- with a new distance mapping method for better accuracy 13

Neighboring Zipcodes -- with a new distance mapping method f...

引用

13th IEEE International Conference on Networking, Sensing, and Control (ICNSC)

作者： Apgar, Jordan Yu, Cui Dept. Computer Science and Software Engineering Monmouth University West Long Branch NJ United States

ISBN: (纸本)9781467399753

The basis for this project was to attempt to improve upon searches for neighboring zipcodes. Simple search algorithms lack the granularity to properly determine nearby zipcodes. In this paper, we include data concerning the boundaries of each zip code area which are then indexed using a new grid-based distance mapping approach to answer neighboring searches. Searches with this method become significantly more accurate at the expense of time. Furthermore, several methods of optimization are examined to demonstrate how they can bring the search time down to more reasonable threshold. © 2016 IEEE.

关键词： distance nearest neighbor search zip code

来源：评论

学校读者我要写书评

暂无评论

A comprehensive study on real world concurrency bugs in *** 17

A comprehensive study on real world concurrency bugs in ***

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Jie Wang Wensheng Dou Yu Gao Chushu Gao Feng Qin Kang Yin Jun Wei University of Chinese Academy of Sciences China Chinese Academy of Sciences Institute of Software China Dept. of Computer Science and Engineering The Ohio State University United States

ISBN: (纸本)9781538626849

*** becomes increasingly popular in building server-side JavaScript applications. It adopts an event-driven model, which supports asynchronous I/O and non-deterministic event processing. This asynchrony and non-determinism can introduce intricate concurrency bugs, and leads to unpredictable behaviors. An in-depth understanding of real world concurrency bugs in *** applications will significantly promote effective techniques in bug detection, testing and fixing for ***. In this paper, we present NodeCB, a comprehensive study on real world concurrency bugs in *** applications. Specifically, we have carefully studied 57 real bug cases from open-source *** applications, and have analyzed their bug characteristics, e.g., bug patterns and root causes, bug impacts, bug manifestation, and fix strategies. Through this study, we obtain several interesting findings, which may open up many new research directions in combating concurrency bugs in ***. For example, one finding is that two thirds of the bugs are caused by atomicity violation. However, due to lack of locks and transaction mechanism, *** cannot easily express and guarantee the atomic intention.

关键词： computer bugs Concurrent computing Instruction sets Open source software Databases Testing

来源：评论

学校读者我要写书评

暂无评论

A template approach for group key distribution in dynamic ad-hoc groups

A template approach for group key distribution in dynamic ad...

引用

IFIP Networking Conference

作者： Bruhadeshwar Bezawada Alex X. Liu Xiaojiang Liang Rui Li National Key Laboratory for Novel Software Technology Nanjing University Nanjing China Dept. of Computer Science and Engineering Michigan State University USA Mahindra Ecole Centrale School of Engineering Sciences Hyderabad India College of Computer Science and Networking Security Dongguan University of Technology

The ubiquitous wireless communication medium poses serious threats to the confidentiality and integrity of communication in constrained networks like Internet-of-Things (IoT), sensor nodes or ad-hoc groups of soldiers on a battlefield. Data encryption is essential for ensuring the confidentiality and integrity of the wireless network communication. We focus on the problem of group key distribution in dynamically formed groups of network nodes. One major challenge is that the neighborhood of a node is not known prior to deployment and therefore, the group key establishment protocol needs to be independent of the physical network topology. In this paper, we describe an efficient template based approach for group key establishment using only shared symmetric secrets. Our template is a logical shared secret distribution built on the network nodes prior to deployment, which ensures that any node shares a distinct set of secrets with any dynamic group of nodes and thus, is able to establish a secure group key. We illustrate our template using two secret distribution protocols: sub-set and dual one-way hash chain distributions. Compared to existing algorithms, our template approach gives flexibility to the network administrator to choose from different secret distribution protocols for fine-grained control over the security levels and performance.

关键词： Ad hoc networks Protocols Resistance Cryptography Wireless communication computer science

来源：评论

学校读者我要写书评

暂无评论

Enhancing security for two-party comparison over encrypted data 3

Enhancing security for two-party comparison over encrypted d...

引用

2016 3rd International Conference on Systems and Informatics, ICSAI 2016

作者： Yang, Ching-Nung Yeh, Zong-Xuan Hsu, Shen-Chieh Fu, Zhangjie Dept. of Computer Science and Information Engineering National Dong Hwa University Hualien Taiwan School of Computer and Software Nanjing University of Information Science and Technology Nanjing China

ISBN: (纸本)9781509055210

The so-called Yao's millionaire problem (YMP) is about securely comparing two numbers held by two parties, respectively. After comparison, the actual values of these two numbers are still unknown to both parties. Recently, Kaghazgaran and Sadeghyan propose a variant of YMP, the twoparty multiple comparison (TPMC) protocol, that determines the greatest one over multiple (more than two) encrypted data between two parties. However, in Kaghazgaran and Sadeghyan's TPMC (KS-TPMC) protocol, one of two parties may guess the original data with a probability. In this paper, we introduce a new TPMC protocol to enhance the security by reducing this guess probability, and meanwhile has the same computation cost compared with KS-TPMC protocol. Additionally, the proposed TPMC protocol is more effective on reducing the attack probability for the large number of encrypted data. Thus, our TPMC protocol is suitable for applications on multiple comparison over encrypted data. © 2016 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Mobile phone antenna

Mobile phone antenna

引用

International SoC Design Conference, ISOCC

作者： Cheng Zhu Zhao Wang Mark Leach Kalok Man Eng Gee Lim Dept. of Electrical and Electronic Engineering Daegu University Gyeongsan South Korea Dept. of Computer Science and Software Engineering Xi'an Jiaotong-Liverpool Univeristy Suzhou P.R. China Xi'an Jiaotong-Liverpool University Suzhou Jiangsu CN

This paper aims at developing an operative and reliable internal Planar Inverted F Antenna (PIFA) for mobile phone utilization with designed frequency bands at GSM900, GSM1800/1900, UMTS2100 and LTE2300/2500. Additionally, a feasible PIFA with operating band locates at GPS L4 band (1.8414GHz) is also investigated for GPS satellite framing signal receiving and transmission in a mobile phone. The property disparities between reference and designed antenna are explored and discussed.

关键词： Mobile antennas Mobile handsets Bandwidth Antenna feeds Microstrip antennas Pins

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：