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

The constructions of ternary sequence pairs with two-level autocorrelation

Journal of information and Computational Science 2014年第13期11卷 4605-4612页

作者： Jia, Yanguo Duan, Xiaobei Shi, Yan Shen, Xiumin Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao China

In this letter, a periodic autocorrelation signal is presented, which is the ternary sequence pair with two-level autocorrelation. The methods of constructing ternary sequence pairs based on binary sequence pairs and cyclotomy are presented by us. Then we have a discussion about perfect binary sequence pairs, pseudorandom binary sequence pairs, difference set pairs and ternary sequence pairs. These signals enrich the theory of sequence pair discrete correlation signals. Copyright © 2014 Binary information Press.

关键词： Autocorrelation

来源：评论

学校读者我要写书评

暂无评论

Robust recommendation algorithm based on the identification of suspicious users and matrix factorization

引用

Journal of information and Computational Science 2014年第13期11卷 4769-4777页

作者： Yi, Huawei Zhang, Fuzhi Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao China

The existing recommendation algorithms have lower robustness against shilling attacks. With this in mind, in this paper we propose a robust recommendation algorithm based on the identification of suspicious users and matrix factorization. We first give the computational methods of Deviation Degree about the Number of Ratings (DDNR) and Average Similarity of Neighbors (ASN) according to the distribution of users' ratings. Then we identify suspicious users based on the differences of computational results of users' DDNR and ASN. Finally, we introduce the matrix factorization technology which incorporates indicator function and the identification results of suspicious users to make recommendations for users. Experimental results show that the proposed algorithm not only improves the recommendation accuracy, but also has better robustness. Copyright © 2014 Binary information Press.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

New construction of quaternary sequence pairs with even period

引用

Journal of information and Computational Science 2014年第13期11卷 4613-4621页

作者： Jia, Yanguo Shi, Yan Duan, Xiaobei Shen, Xiumin Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao China

In the paper, we present a new method for constructing a class of quaternary sequence pairs with even period 2N from the known binary sequence pairs with odd period N by using the reverse Gray mapping and interleaving technique. The distribution of correlation function of the proposed quaternary sequence pairs is also derived, which is decided by the properties and the periods of the known binary sequence pairs. Copyright © 2014 Binary information Press.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

The constructions of ternary sequence pairs based on cyclotomy

引用

ICIC Express Letters 2015年第6期9卷 1761-1767页

作者： Jia, Yanguo Duan, Xiaobei Shi, Yan Shen, Xiumin School of Information Sciences and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Heibei Province No. 438 Hebei Avenue Qinhuangdao China

In this paper, two new methods of constructing ternary sequence pairs based on cyclotomy are presented. The ternary sequence pairs with three-level correlation are constructed based on cyclotomic numbers of order 4. And the ternary sequence pairs with four-level correlation are constructed based on cyclotomic numbers of order 6. The two methods cover all the prime period respectively. © 2015 ICIC International.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Multi-path SDN route selection subject to multi-constraints

Multi-path SDN route selection subject to multi-constraints

引用

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Qingfeng Pan Xianghan Zheng Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou 350108 China College of Mathematics and Computer Science Fuzhou University 350108 China

ISBN: (纸本)9781510821873

Multi-constrained optimal routing problem and disjoint path selection are NP-hard problem. The conventional single-path and single constraint routing can not meet people's needs. The reliability of network data transmission and packet loss rate can be decreased when the route or the transmission fails. To solve the problems, we need to study the routing path selection strategies. This paper optimizes the routing path that meets the QoS constraints under the SDN pre planning routing, and proposes a routing mechanism that can solve problems in polynomial time. Firstly, the paper combined with Clustering and Gauss algorithm to simulate the network simulation, obtain the initial experimental data. It can reflect the network status more accurately. Secondly, simplify the multi-objectives based on the AHP, It reduces the complexity of the problem and meets QoS requirements. Finally, select the disjoint communication paths and backup paths with the heuristic algorithms in order to balance the load of network and improve the transmission reliability. The selection mechanism can improve the efficiency of data transmission, and the survival of network communication.

关键词： Analytic Hierarchy Process Disjoint Path Multi constraints Optimal Path QoS Routing

来源：评论

学校读者我要写书评

暂无评论

computer-aided design bitmap retrieval methods based on shape features

Computer-aided design bitmap retrieval methods based on shap...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yuan Yin Shengxiang Gao Zhengtao Yu Yunshan Zhang Key Laboratory of Intelligent Information Processing Kunming University of Science and Technology Kunming China Yunnan Administration College Computer Network Center Kunming China

ISBN: (纸本)9781467376839

This paper presents a computer-aided design (CAD) bitmap retrieval method based the on shape characteristics of CAD bitmaps. First, using the Canny edge detection algorithm to extract edge shapes of the CAD bitmaps, the edge direction histogram of CAD bitmaps are constructed according to the edge shapes. Next, using Euclidean distance and cosine value to calculate the distances between edge histograms, the similarities between CAD bitmaps are obtained according to the distances between histograms. Finally, sorting series of CAD bitmaps are obtained according to similarity values. The experimental results show that using shape features results in better effects than using color or texture features for CAD bitmap retrieval.

关键词： Design automation Image edge detection Shape Histograms Feature extraction Euclidean distance Color

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for community discovery in weighted social networks

引用

Journal of information and Computational Science 2015年第18期12卷 6873-6881页

作者： Guo, Jingfeng Liu, Miaomiao Liu, Linlin College of Information Science and Engineering Yanshan University QinhuangdaoHebei China Northeast Petroleum University DaqingHeilongjiang China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei China

The problems of AGMA (Automatic Graph Mining Algorithm) are improved and a novel algorithm, namely CRMA (Clustering Re-clustering Merging Algorithm) is proposed which can realize more reasonable community division for weighted social networks. Firstly, when re-clustering nodes, AGMA neglected the clustering situation of its neighbors and didn't take into account the weight of the edge connecting the current node and its unclustered neighbor, which led to unreasonable clustering. Aiming to this, the concept of the connection compactness is introduced. Then according to the node weight, the edge weight and the friend coefficient, each node would be clustered into the community has the largest connection compactness with itself. Secondly, for community division in some unweighted networks and signed networks, if there are many nodes whose clustered neighbors is less than its unclustered neighbors, the division results of AGMA tend to produce many small communities, which would result in the lower modularity. In view of this problem, the concepts of positive edge weight density, the cluster density and the connection coefficient between clusters are proposed. Lastly, we merge communities based on the above three concepts and the modularity is effectively enhanced finally. The higher correctness and better generality of the improved algorithm are verified through experiments. © 2015 by Binary information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical Engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

Privacy Quantification Model Based on the Bayes Conditional Risk in Location-Based Services

引用

Tsinghua Science and Technology 2014年第5期19卷 452-462页

作者： Xuejun Zhang Xiaolin Gui Feng Tian Si Yu Jian An Department of Computer Science and Technology the Shaanxi Province Key Laboratory of Computer NetworkXi’an Jiaotong University School of Electronic and Information Engineering Lanzhou Jiaotong University

The widespread use of Location-Based Services （LBSs）, which allows untrusted service providers to collect large quantities of information regarding users＇ locations, has raised serious privacy concerns. In response to these issues, a variety of LBS Privacy Protection Mechanisms （LPPMs） have been recently proposed. However, evaluating these LPPMs remains problematic because of the absence of a generic adversarial model for most existing privacy metrics. In particular, the relationships between these metrics have not been examined in depth under a common adversarial model, leading to a possible selection of the inappropriate metric, which runs the risk of wrongly evaluating LPPMs. In this paper, we address these issues by proposing a privacy quantification model, which is based on Bayes conditional privacy, to specify a general adversarial model. This model employs a general definition of conditional privacy regarding the adversary＇s estimation error to compare the different LBS privacy metrics. Moreover, we present a theoretical analysis for specifying how to connect our metric with other popular LBS privacy metrics. We show that our privacy quantification model permits interpretation and comparison of various popular LBS privacy metrics under a common perspective. Our results contribute to a better understanding of how privacy properties can be measured, as well as to the better selection of the most appropriate metric for any given LBS application.

关键词： location-based services Bayes decision estimator privacy metric adversarial mode

来源：评论

学校读者我要写书评

暂无评论

Video restoration based on PatchMatch and reweighted low-rank matrix recovery

引用

Multimedia Tools and Applications 2015年第5期75卷 2681-2696页

作者： Bo-Hua Xu Yi-Gang Cen Zhe Wei Yi Cen Rui-Zhen Zhao Zhen-Jiang Miao School of Computer and Information Technology Beijing Jiaotong University Beijing China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China Huawei International Pte. Ltd Singapore Singapore School of Information Engineering Minzu University of China Beijing China

In this paper, a new video restoration approach is proposed. By using a modified version of random PatchMatch algorithm, nearest-neighbor patches among the video frames can be grouped quickly and accurately. Then the video restoration problem can be boiled down to a low-rank matrix recovery problem, which is able to separate sparse errors from matrices that possess potential low-rank structures. Furthermore, the reweighted low-rank matrix model is used to improve the performance of video restoration by enhancing the sparsity of the sparse matrix and the low-rank property of the low-rank matrix. Experimental results show that our system achieves good performance in denosing of joint multi-frames and inpainting in the presence of small damaged areas.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：