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

第十届全国信息隐藏暨多媒体信息安全学术大会CIHW2012

作者： Jinwei WANG Xingming SUN Yuhui ZHENG Jin HAN Zhihua XIA Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology College of Computer and Software Nanjing University of Information Science and Technology China

With the development of the cloud environment, the multi-copyright protection of the works should be further developing. The multi-watermarking is becoming a possible solution. In this paper, firstly, one novel hybrid multi-watermarking rule is proposed, and is used to embed the watermark into DWT domain. Secondly, corresponding to the hybrid embedding rule, the novel optimum hybrid additive multi-watermarking decoder is proposed, which is based on the minimum Bayesian risk criterion, and simultaneously the performance of the hybrid decoder is theoretically analyzed. The DWT coefficients are modeled as the generalized Gaussian distribution. Finally, the theoretical and empirical experimental results prove the theoretical analysis validity.

关键词： hybrid additive rule optimal hybrid multi-watermarking decoder

来源：评论

学校读者我要写书评

暂无评论

: a QoS-based energy-aware task scheduling method in cloud environment

引用

Cluster Computing 2017年第4期20卷 3199-3212页

作者： Xue, Shengjun Zhang, Yiyun Xu, Xiaolong Xing, Guowen Xiang, Haolong Ji, Sai Jiangsu Engineering Center of Network Monitoring of Nanjing University of Information Science&Technology Nanjing China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Currently, energy consumption for cloud data centers has attracted much attention from both industry and academia. Meanwhile, it is also important to satisfy the customers’ quality of service (QoS) for cloud service providers. However, it is still a challenge to achieve energy savings based on QoS during task scheduling. In this paper, a QoS-based energy-aware task scheduling method, named QET, in cloud environment is proposed to address the above challenge. Technically, an energy consumption model based on QoS is proposed for heterogeneous cloud environment. And a corresponding task scheduling method is designed to minimize the energy consumption through QoS-aware PM selection. Comprehensive experimental analysis is conducted to evaluate the efficiency and effectiveness of our proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Genetic Algorithm Outsourcing in Cloud Computing

引用

Journal of Cyber Security 2020年第1期2卷 49-61页

作者： Leqi Jiang Zhangjie Fu College of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and TechnologyNanjing210044China

Genetic Algorithm(GA)has been widely used to solve various optimization *** the solving process of GA requires large storage and computing resources,it is well motivated to outsource the solving process of GA to the cloud ***,the algorithm user would never want his data to be disclosed to cloud ***,it is necessary for the user to encrypt the data before transmitting them to the *** the user will encounter a new *** arithmetic operations we are familiar with cannot work directly in the ciphertext *** this paper,a privacy-preserving outsourced genetic algorithm is *** user’s data are protected by homomorphic encryption algorithm which can support the operations in the encrypted *** is elaborately adapted to search the optimal result over the encrypted *** security analysis and experiment results demonstrate the effectiveness of the proposed scheme.

关键词： Homomorphic encryption genetic algorithm outsourcing cloud computing

来源：评论

学校读者我要写书评

暂无评论

CACA-UAN: A context-aware communication approach to efficient and reliable underwater acoustic sensor networks

CACA-UAN: A context-aware communication approach to efficien...

引用

作者： Liu, Qi Chen, Xuedong Liu, Xiaodong Linge, Nigel Jiangsu Collaborative Innovation Centre of Atmospheric Environment and Equipment Technology School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China School of Computer and Software Jiangsu Engineering Centre of Network Monitoring Nanjing University of Information Science and Technology Nanjing210044 China School of Computing Edinburgh Napier University 10 Clinton Road EdinburghEH10 5DT United Kingdom School of Computing Science and Engineering University of Salford Salford Greater ManchesterM5 4WT United Kingdom

Underwater acoustic sensor networks (UANs) have emerged as a promising technology recently, which can be applied in many areas such as military and civil, where the communication between devices is crucial and challenging owing to the unique characteristics of underwater acoustic-based environment, such as high latency and low bandwidth. In this paper, context awareness is applied to the design of an underwater communication approach, called context-aware communication approach for a UAN (CACA-UAN), which aims to improve the overall performance of the underwater communication. According to the results, the proposed CACA-UAN can increase the efficiency and reliability of the underwater communication system. © Copyright 2018 Inderscience Enterprises Ltd.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A new energy landscape paving heuristic for satellite module layouts

引用

Frontiers of Information Technology & Electronic engineering 2016年第10期17卷 1031-1043页

作者： Jing-fa LIU Juan HUANG Gang LI Wen-jie LIU Ting-zhao GUAN Liang HAO Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science & Technology Nanjing 210044 China School of Computer & Software Nanjing University of Information Science & Technology Nanjing 210044 China School of Mathematics and Statistics Nanfing University of Information Science & Technology Nanjing 210044 China Office of lnformationization Construction and Management Nanjing University of lnformation Science & Technology Nanjing 210044 China

This article describes a study of the satellite module layout problem （SMLP）, which is a three-dimensional （3D） layout optimization problem with performance constraints that has proved to be non-deterministic polynomial-time hard （NP-hard）. To deal with this problem, we convert it into an unconstrained optimization problem using a quasi-physical strategy and the penalty function method. The energy landscape paving （ELP） method is a class of Monte-Carlo-based global optimization algorithm that has been successfully applied to solve many optimization problems. ELP can search for low-energy layouts via a random walk in complex energy landscapes. However, when ELP falls into the narrow and deep valleys of an energy landscape, it is difficult to escape. By putting forward a new update mechanism of the histogram function in ELP, we obtain an improved ELP method which can overcome this drawback. By incorporating the gradient method with local search into the improved ELP method, a new global search optimization method, hELP, is proposed for SMLP. Two representative instances from the literature are tested. Computational results show that the proposed hELP algorithm is an effective method for solving SMLP with performance constraints.

关键词： Three-dimensional packing Energy landscape paving Layout optimization Performance constraints

来源：评论

学校读者我要写书评

暂无评论

Real-time human cross-race aging-related face appearance detection with deep convolution architecture

Real-time human cross-race aging-related face appearance det...

引用

作者： Tian, Qing Zhang, Wenqiang Mao, Junxiang Yin, Hujun School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science and Technology Nanjing China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and Astronautics Nanjing China School of Electrical and Electronic Engineering The University of Manchester Manchester United Kingdom

Human age estimation (AE) is an emerging research topic in computer vision and machine learning and has attracted increasing amount of research due its wide potential applications. In the process of human aging, facial appearances change from glabrous to crinkly similarly across all races, from European, Hispanic and African to Asian. To specially explore the relationships between aging and facial appearances across races, this paper is devoted to determining the correspondence between facial aging and facial appearances. Specifically, we first extract appearance vector features from facial images with their spatial structure preserved. Then, we propose to select the aging-related features shared by different races to explore their aging-related common facial regions, while removing redundant features. Thirdly, we improve the proposed model by incorporating potential cross-race relationships in an automated learning manner. Additionally, we extend our model with deep convolution architecture. Finally, we evaluate the proposed methodologies on a large face aging database with real-time efficiency. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A feature selection algorithm based on Hoeffding inequality and mutual information

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2015年第11期8卷 433-444页

作者： Yin, Chunyong Feng, Lu Ma, Luyu Yin, Zhichao Wang, Jin School of Computer and Software Jiangsu Key Laboratory of Meteorological Observation and Information Processing Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China Nanjing No.1 Middle School Nanjing China

With the rapid development of the Internet, the application of data mining in the Internet is becoming more and more extensive. However, the data source’s complex feature redundancy leads that data mining process becomes very inefficient and complex. So feature selection research is essential to make data mining more efficient and simple. In this paper, we propose a new way to measure the correlation degree of internal features of dataset which is a mutation of mutual information. Additionally we also introduce Hoeffding inequality as constraint of constructing algorithm. During the experiments, we use C4.5 classification algorithm as test algorithm and compare HSF with BIF(feature selection algorithm based on mutual information). Experiments results show that HSF performances better than BIF[1] in TP and FP rate, what’s more the feature subset obtained by HSF can significantly improve the TP, FP and memory usage of C4.5 classification algorithm. © 2015 SERSC.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Annealing genetic algorithm for protein folding simulations in the 3D HP model

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2012年第9期6卷 219-226页

作者： Liu, Jingfa Wang, Jun Zheng, Yu Yao, Yonglei Liu, Zhaoxia Network Information Center Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Sience and Technology Nanjing 210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

The protein folding problem, i.e., the prediction of the tertiary structures of protein molecules from their amino acid sequences is one of the most important problems in computational biology. This problem has been widely studied under the HP model in which each amino acid is classified, based on its hydro phobicity, as a hydrophobic (H) residue or a hydrophilic (or polar, P) one. The protein folding problem in the HP model is in fact to find conformations with the lowest energies for some benchmark amino acid sequences. A genetic algorithm (GA) is used to find the lowest energy conformation in this paper. Each time for a newly produced offspring individual, which is originated from the selection, crossover and mutation operator of two parent individuals, we adopt the new acceptance criteria based on the annealing strategy to let it pass into the next generation, and propose a so-called annealing genetic algorithm (aGA) to predict efficiently the protein folding conformations in the three-dimensional (3D) HP model. Eleven benchmarks are tested to verify the effectiveness of the proposed approach and the computational results show that aGA explores the conformation surfaces more efficiently than other methods, and finds new lower energies in several cases, which means that aGA is an efficient tool for the protein folding simulations.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A chinese character segmentation algorithm for complicated printed documents

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2013年第3期6卷 91-100页

作者： Mei, Yuan Wang, Xinhui Wang, Jin Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China

The character segmentation technology for printed documents plays an important role in optical character recognition, ticket information identification, postal code identification, automatic license plate recognition and so on. In this paper, a Chinese characters segmentation algorithm for complicated printed documents is proposed for the application in paper watermarking system. In this application, the algorithm aims to achieve high accuracy Chinese character segmentation and high consistent segmentation between the digital version images and print-scanned version images for the same documents. In this method, three main steps are included: connected regions recognition, connected regions merging, and fine-gained segmentation. Experiments show the effectiveness of the proposed algorithm.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

A new heuristic algorithm for packing equal circles into a larger equilateral triangular container

引用

International Journal of Advancements in Computing Technology 2012年第3期4卷 260-270页

作者： Liu, Jingfa Zhang, Guojian Liu, Wenjie Gao, Zexu Zhou, Ziling Network Information Center Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

This paper studies the problem of packing equal circles into a larger equilateral triangular container, which is concerned with how to pack these circles into the container without overlapping. Its aim is to minimize the edge length of the container as much as possible. By incorporating some heuristic configuration update strategies, a local search strategy based on the gradient method and the dichotomous search (DS) strategy into the simulated annealing (SA) algorithm, a new heuristic algorithm, the heuristic simulated annealing algorithm based on dichotomous search (HSADS), is put forward for solving this problem. In HSADS, the heuristic configuration update strategies are used to produce new configurations, and the gradient method is used to search for lower-energy minima near newly generated configurations, and the dichotomous search strategy is used to gain the minimal edge length of the equilateral triangular container. By testing six equal circles instances from the literature, the proposed algorithm improves the best known results of them so far. The experimental results show that HSADS is an effective algorithm for the problem of packing equal circles into a larger equilateral triangular container.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：