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

作者： Duan, Lijuan Wu, Chunpeng Miao, Jun Qing, Laiyun Fu, Yu College of Computer Science and Technology Beijing University of Technology Beijing 100124 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Information Science and Engineering Graduate University Chinese Academy of Sciences Beijing 100049 China Department of Computing University of Surrey Guildford Surrey GU2 7XH United Kingdom

ISBN: (纸本)9781457703942

In this paper, a new visual saliency detection method is proposed based on the spatially weighted dissimilarity. We measured the saliency by integrating three elements as follows: the dissimilarities between image patches, which were evaluated in the reduced dimensional space, the spatial distance between image patches and the central bias. The dissimilarities were inversely weighted based on the corresponding spatial distance. A weighting mechanism, indicating a bias for human fixations to the center of the image, was employed. The principal component analysis (PCA) was the dimension reducing method used in our system. We extracted the principal components (PCs) by sampling the patches from the current image. Our method was compared with four saliency detection approaches using three image datasets. Experimental results show that our method outperforms current state-of-the-art methods on predicting human fixations. © 2011 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Network survivability against region failure

Network survivability against region failure

引用

IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)

作者： Ran Li Xiaoliang Wang Xiaohong Jiang Department of Commanding Information System Xian Communication Institute Shaanxi China State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University China Future University Hakodate Hokkaido Japan

Communication networks are now facing more and more potential large scale region threats such as natural disaster and physical attack. Under such region failure scenarios, numerous network elements within a geographically correlated region may be simultaneously destroyed, resulting a dramatical compromise or even breakdown of overall network connectivity. In this paper, we study the network survivability against a random region failure, which is modeled as a circular cut residing on the network. For a network adopting the cost effective multiple path routing mechanism, we examine how the network throughput performance degrades with region failure under the region-disjoint and node-disjoint routing constraints. The corresponding traffic throughput optimization problem and linear programming formulation are also addressed. We further discuss the problem of upgrading network with the minimal cost when the link capacity is not sufficient to protect the network against region failure.

关键词： Throughput Routing USA Councils Network topology Optimization Mission critical systems Linear programming

来源：评论

学校读者我要写书评

暂无评论

Histogram-based image hashing for searching content-preserving copies

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6730 LNCS卷 83-108页

作者： Xiang, Shijun Kim, Hyoung Joong Department of Electronic Engineering School of Information Science and Technology Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China CIST Graduate School of Information Management and Security Korea University Seoul Korea Republic of

ISBN: (纸本)9783642245558

Image hashing as a compact abstract can be used for content search. Towards this end, a desired image hashing function should be resistant to those content-preserving manipulations (including additive-noise like processing and geometric deformation operations). Most countermeasures proposed in the literature usually focus on the problem of additive noises and global affine transform operations, but few are resistant to recently reported random bending attacks (RBAs). In this paper, we address an efficient and effective image hashing algorithm by using the resistance of two statistical features (image histogram in shape and mean value) for those challenging geometric deformations. Since the features are extracted from Gaussian-filtered images, the hash is also robust to common additive noise-like operations (e.g., lossy compression, low-pass filtering). The hash uniqueness is satisfactory for different sources of images. With a large number of real-world images, we construct a hash-based image search system to show that the hash function can be used for searching content-preserving copies from the same source. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

Circle Text Expansion as Low-Rank Textures

Circle Text Expansion as Low-Rank Textures

引用

International Conference on Document Analysis and Recognition

作者： Xin Zhang Fuchun Sun Department of Computer Science and Technology State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Tsinghua University Beijing China

Circle ring aligned text is very common in our daily life, such as university logo, advertisement, there are quite few methods to expand the circle text which will greatly improve the working range of optical character recognition (OCR) product and the accuracy of text segmentation. In this paper, a new method is proposed to handle this circumstance, called curve Transform Invariant Low-rank Textures(TILT). By change the Cartesian system into polar system, the transformed image matrix D can be decomposed into low-rank matrix A and a sparse error matrix E. Matrix A represent the text expansion image and E is the noises and other non-regular component of text image. All this consist of an optimized convex problem and can be solved by alternating direction method (ADM) method. The proposed method also provides a frame work for curve text expansion. Extensive experiments show the robustness of proposed method in expanding artificial and real text image, which contain English or Chinese texts.

关键词： Transforms Optical character recognition software Sparse matrices Character recognition Matrix decomposition Jacobian matrices Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Time Petri net model with mixed semantics

引用

Ruan Jian Xue Bao/Journal of Software 2011年第6期22卷 1199-1209页

作者： Pan, Li Ding, Zhi-Jun Guo, Guan-Qi School of Information and Communication Engineering Hu'nan Institute of Science and Technology Yueyang 414006 China Department of Computer Science and Technology Tongji University Shanghai 200092 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

This paper presents a time Petri net (TPN) model with mixed semantics that efficiently addresses the schedulability analysis problem of the existing semantics models. The proposed model associates each firable transition with a mandatory firing point that is set to the least upper bound of the transition and its non-conflicting transitions. This treatment not only eliminates the effect of conflicting transitions on the transition friability and extends the scheduling scope of the TPN model, but also ensures the time limit of the task scheduling. To determine the expressiveness of the mixed model, the study proves that the mixed semantics model has the power of Turing machines and its marking reachability problem is undecidable. The timed expressiveness of three semantics models with respect to timed language acceptance is also compared. A state class approach is then proposed for the scheduling analysis of the mixed model. Finally, a flexible manufacturing system is used as an example to compare the scheduling ability of three semantics models. ©2011 ISCAS.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Network dividing for mapping problem of large scale emulation network

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2011年第SUPPL.期34卷 104-108页

作者： Huang, Min-Huan Zhang, Yao-Xue Tang, Hong Kuang, Xiao-Hui Department of Computer Science and Technology Tsinghua University Beijing 100084 China Science and Technology on Information System Security Laboratory Beijing 100101 China

Mapping of the large scale emulation network topology to the physical devices of network testbed automatically is an non-deterministic polynomial hard problem because the best solution of network dividing is un-resolvable. With high capability and similarity of the physical devices, which can for working out the approximate optimal solution of network dividing by improving the annealing algorithm, a method is presented. Besides, with the help of the information of network topology structure, this method can simplify the complexity of large scale emulation network topology on different network level by preprocessing. Experiment verifies that this method could improve the efficiency of network dividing and mapping.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

A Survey of Game Theory in Wireless Sensor Networks security

引用

Journal of Networks 2011年第3期6卷 521-532页

作者： Shen, Shigen Yue, Guangxue Cao, Qiying Yu, Fei College of Information Science and Technology Donghua University Shanghai China College of Mathematics and Information Engineering Jiaxing University Jiaxing China College of Computer and Communication Hunan University Changsha China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

Wireless Sensor Networks (WSNs) are becoming an integral part of our lives. There are not widespread applications of WSNs without ensuring WSNs security. Due to the limited capabilities of sensor nodes in terms of computation, communication, and energy, providing security to WSNs is challenging. In fact, the process of implementing WSNs security is adaptive and dynamic, which evolves continually. The essence of attack-defend in WSNs security can be expressed by mutual strategies of interdependence while game theory can be used for the purpose of accounting for interactions among strategies of rational decision makers. Therefore, studying WSNs security with game theory has higher scientificity and rationality. This paper presents a survey of security approaches based on game theory in WSNs. According to different applications, a taxonomy is proposed, which divides current existing typical game-theoretic approaches for WSNs security into four categories: preventing Denial of Services (DoS) attacks, intrusion detection, strengthening security, and coexistence with malicious sensor nodes. The main ideas of each approach are overviewed while advantages and disadvantages of various approaches are discussed. Then, this paper overviews related work and highlights the difference from other surveys, and points out some future research areas for ensuring WSNs security based on game theory, including Base Station (BS) credibility, Intrusion Detection system (IDS) efficiency, WSNs mobility, WSNs Quality of Service (QoS), real-world applicability, energy consumption, sensor nodes learning, and expanding game theory applications and different games. Thus, a global view of WSNs security approaches based on game theory is provided. To our best knowledge of knowing, it is the first paper centrally focusing on game theory in WSNs security. It will make the researchers a better understanding of game-theoretic solutions to WSNs security and further research directions. © 2011 ACADEMY PU

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Compatibility of photographed images with touch-based fingerprint verification software

Compatibility of photographed images with touch-based finger...

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Fengling Han Jiankun Hu Mohammed Alkhathami Kai Xi State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing University China School of Computer Science & IT Royal Melbourne Institute of Technology Melbourne VIC Australia School of Engineering and Information Technology University of New South Wales Canberra ACT Australia

In this paper, the compatibility of fingerprint images captured with mobile cameras (touch-less) with existing touch-based commercial fingerprint verification software VeriFinger SDK is investigated. The touch-less fingerprint images taken with mobile cameras are different with the fingerprint images captured from touch-based scanners. The research in this paper shows that the commercial fingerprint verification software VeriFinger SDK can load the photographed fingerprint images, and can extract minutiae from the photographed images. Furthermore, the minutiae matching of a sample against a reference have been successfully performed based on the photographed fingerprint images using VeriFinger SDK. This research result will make the mobile fingerprint verification more interoperable which has significant contribution to the security of m-commerce applications.

关键词： Fingerprint recognition Mobile communication Image matching Cameras Fingers Software Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Multi-User Private keyword Search for Cloud Computing

Multi-User Private Keyword Search for Cloud Computing

引用

IEEE International Conference on Cloud Computing technology and science (CloudCom)

作者： Yanjiang Yang Haibing Lu Jian Weng Institute for Infocomm Research Singapore Department of Operations Management and Information Systems The Leavey School of Business Santa Clara University USA State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China Department of Computer Science and Emergency Technology Research Center of Risk Department of Computer Science and Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities.

关键词： Encryption Indexes keyword search Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Homomorphic Linear Authentication Schemes for Proofs of Retrievability

Homomorphic Linear Authentication Schemes for Proofs of Retr...

引用

International Conference on Intelligent Networking and Collaborative systems (INCOS)

作者： Shengli Liu Kefei Chen Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China

In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential step-stone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1).

关键词： Games Authentication Servers Protocols Data mining Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：