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

作者： Zhong, Kan Liu, Duo Liang, Liang Zhu, Xiao Long, Linbo Wang, Yi Sha, Edwin Hsing-Mean College of Computer Science Chongqing University Chongqing400044 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education Chongqing400044 China College of Communication Engineering Chongqing University Chongqing400044 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

Smartphones are becoming increasingly energy-hungry to support feature-rich applications, posing a lot of pressure on battery lifetime and making energy consumption a non-negligible issue. In particular, dynamic random access memory (DRAM)-based main memory subsystem is a major contributor to the energy consumption of mobile devices. In this paper, we propose direct read (DR). Swap, an energy-efficient in-memory paging design to reduce energy consumption in smartphones. In DR. Swap, we adopt emerging energy-efficient nonvolatile memory (NVM) and use it as the swap area. Utilizing NVMs byte-addressability, we propose DR which guarantees zero memory copy for read-only requests when accessing a page in swap area. To better understand the energy consumption of swapping, we build an energy model to analyze the energy consumption of different paging architectures. We evaluate DR. Swap based on the Google Nexus 5 smartphone, experimental results show that our technique can reduce more than 50% energy consumption compared to DRAM backed swapping. © 2015 IEEE.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

A new private-preserving algorithm based on SMART

引用

Journal of Computers (Taiwan) 2016年第4期27卷 171-185页

作者： Han, Bowen Zhang, Zhenjiang Uden, Lorna School of Electronic and Information Engineering Key Laboratory of Communication and Information Systems Beijing Jiaotong University Beijing100044 China School of Software Engineering Key Laboratory of Communication and Information Systems Beijing Jiaotong University Beijing100044 China School of Computing FACS Staffordshire University The Octagon Beaconside StaffordSt180AD United Kingdom

Privacy is a critical issue in many WSN applications because wireless sensor networks (WSNs) are vulnerable to malicious attacks due to their characteristics. Existing hop by hop and shuffling based privacy preserving protocols does not provide an energy efficient, accurate and secure data aggregation because of the energy consuming decryption at the aggregator node. How to provide effective privacy-preserving algorithm during data aggregation is important. Our main aim is to provide an energy efficient and secure data aggregation scheme, which guarantees the privacy, authenticity and freshness of individual sensed data as well as the confidentiality, accuracy and integrity of aggregated data. This paper improved on the limitations of the SMART (Slice-Mix-AggRegaTe) algorithm, and proposes a new privacy protection algorithm for wireless sensor network (WSN). We have different operations between different nodes, bring in probabilistic segmentation, and also add the data coefficient as well as the positive and negative factors. In addition we also consider making exchange time random in the algorithm. Simulation results demonstrate that the proposed algorithm reduces the communication consumption and the data traffic, improves the precision of data aggregation and the degree of privacy-preserving to a certain extent. © 2016, Computer Society of the Republic of China. All rights reserved.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Speaker recognition with mel scale-based wavelet packet decomposition and AR-volterra model

引用

ICIC Express Letters, Part B: Applications 2016年第10期7卷 2087-2094页

作者： Yang, Shuying Guo, Jijn Jiang, Jiaojiao School of Computer and Communication Engineering Tianjin University of Technology No. 391 Binshui Xidao Xiqing District Tianjin300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology No. 391 Binshui Xidao Xiqing District Tianjin300384 China

In order to improve the rate of speaker recognition, this paper proposes a new scheme with Mel scale-based Wavelet Packet Decomposition and AR-Volterra model. First, the speech signal is decomposed by wavelet packet of Mel scale, and calculate energy spectrum of the sub-band signals. The sub-bands of low energy are discarded according to weighting the proportion ofenergy for all-bands. Second, chaos ofsub-band signals are determined by the largest Lyapunov exponent. Ifsub-band is chaotic, Volterra adaptive model will be used to extract features. Otherwise, the autoregressive model will be used to extract features. Third, linear and nonlinear characteristic parameters will be used to speaker recognition. Hidden Markov model is used to recognize speaker. The experimental results show the extracted features have been obviously improved. © 2016 ICIC International.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE BASED ON BLOCK HISTOGRAM SHIFTING

REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE BASED ON BLOCK HIS...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Zhaoxia Yin Andrew Abel Xinpeng Zhang Bin Luo School of Communication and Information Engineering Shanghai University Shanghai 200072 P.R. China. Computing Science and Mathematics University of Stirling. Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230601 P.R. China.

ISBN: (纸本)9781479999897

Since there is good potential for practical applications such as encrypted image authentication, content owner identification and privacy protection, reversible data hiding in encrypted image (RDHEI) has attracted increasing attention in recent years. In this paper, we propose and evaluate a new separable RDHEI framework. Additional data can be embedded into a cipher image previously encrypted using Josephus traversal and a stream cipher. A block histogram shifting (BHS) approach using self-hidden peak pixels is adopted to perform reversible data embedding. Depending on the keys held, legal receivers can extract only the embedded data with the data hiding key, or, they can decrypt an image very similar to the original with the decryption key. They can extract both the embedded data and recover the original image error-free if both keys are available. The results demonstrate that higher embedding payload, better quality of decrypted-marked image and error-free image recovery are achieved.

关键词： Signal processing in encrypted domain (SPED) Reversible data hiding in encrypted images (RDHEI) Privacy protection Hidden data images keys keys Cays Imagery (Psychotherapy) embedding Image Error-free operations Locks

来源：评论

学校读者我要写书评

暂无评论

Interactive reflection simulation via physical shading model and fast environment mapping

引用

ICIC Express Letters, Part B: Applications 2016年第2期7卷 351-356页

作者： Xu, Jie Fu, Jinhua School of Software Zhengzhou University of Light Industry China School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou China

In order to enhance realistic reflection effects on some objects and realize faster rendering to meet interactive requirements, we present a novel method to produce interactive reflection simulation using physical shading model and fast environment mapping. The physical shading model could efficiently express ambient lighting, specular lighting and diffuse lighting. Also the model is based on the microfacet distribution function, which can describe physics-based characteristics. Fast environment mapping is realized by Spherical Harmonics (SH) transformation, and the rendering equation can be rewritten as a simple dot product of SH coefficients, which fits for GPU (Graphics Processing Unit) computation. The results show that we can realize faster rendering and acquire realistic reflection effects such as glossy and mapping scene on the surface. © 2016 ICIC International.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems, AIS 2015

作者： Zhao, Dongdong Luo, Wenjian Liu, Ran Yue, Lihua School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China School of Computer Science China University of Geosciences Wuhan430074 China

ISBN: (纸本)9781509002986

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the Khidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Performance optimization and evaluation of space management in cloud storage systems 15th

Performance optimization and evaluation of space management ...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Xu, Guangping Li, Huan Mao, Qunfang Lin, Sheng Zhang, Hua Tianjin Key Laboratory of Intelligence Computing and New Software Technology Tianjin300384 China Computer and Communication Engineering School Tianjin University of Technology Tianjin300384 China

ISBN: (纸本)9783319271392

Cloud service providers and enterprises usually deploy high performance storage to manage the unrelenting growth of data. In this paper, we focus on performance optimization and evaluation by using optimal regeneration codes in such cloud storage systems. We present an efficient data maintenance management framework to reduce network repair traffic with the minimum data movement while keeping the desired fault-tolerance in storage systems. In the management framework, it has two phases including the traditional erasure coding process and the optimal placement process. We formally represent the optimal placement as a variant of the bin packing problem by bipartite graphs. Then, we model the placement transform by the interchange graph and propose an efficient heuristic algorithm to find the optimal solution. All feasible solutions are linked together by interchange operation and thus the search space can be taken as an interchange graph. Finally, we evaluate the performance of the optimal placement during data maintenance with different practical settings in our experiments. The experimental results show that the amount of network repair traffic can be reduced by about 10% than the initial placement and by about 2X than traditional erasure coding placement. © Springer International Publishing Switzerland 2015.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Complete separable reversible data hiding in encrypted image 1st

Complete separable reversible data hiding in encrypted image

引用

1st International Conference on Cloud computing and Security, ICCCS 2015

作者： Zhaoxia, Yin Huabin, Wang Haifeng, Zhao Bin, Luo Xinpeng, Zhang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China School of Communication and Information Engineering Shanghai University Shanghai200072 China

ISBN: (纸本)9783319270500

Reversible data hiding in encrypted image (RDHEI) is an emerging technology since it has good potential for practical applications such as encrypted image authentication, content owner identification and privacy protection. But there is one key problem of many existing published works, that the embedded data only can be extracted either before or after image decryption. In this paper, a complete separable reversible data hiding scheme in encrypted images is proposed. Additional data can be embedded into a cipher image which is encrypted by RC4 and can be extracted error-free both from the cipher domain and the plaintext domain. Moreover, the proposed method is simpler to calculate, while offering better performance. The results demonstrate that larger payload, better image quality, and error-free data extraction as well as image recovery are achieved. © Springer International Publishing Switzerland 2015.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

SvdNPD: a negative data publication method based on the sensitive value distribution

SvdNPD: a negative data publication method based on the sens...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Linli Wu Wenjian Luo Dongdong Zhao University of Science and Technology of China Hefei Anhui CN Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Existing data publication methods retain the relationship between the quasi-identifier attributes and sensitive attributes of published data. We call them "positive data publication". However, it will lead to potential risk that attackers could deduce the privacy of the corresponding individuals from the published data. Recently, by combining the negative representation with k-anonymity and l-diversity, (k, m)- anonNPD and (l, m)-divNPD algorithms have been proposed, which improve the degree of privacy because the sensitive value of each individual is transformed into a negative value randomly. However, to reduce the average error of the reconstructed distribution, the data published by (k, m)-anonNPD and (l, m)-divNPD are often much larger than the original data. In this paper, we take the Sensitive Value Distribution into consideration, and propose a novel Negative Data Publication approach (i.e. SvdNPD), which is based on l-diversity. According to the sensitive value distribution, the negative selection probability of the sensitive attribute in each record can be calculated. Then the data could be published by transforming the sensitive value to a negative one with this probability. Experimental results show that the effective usage of the individual sensitive value distribution could enhance the utility of published data. Meanwhile, compared with (l, 1)-divNPD, SvdNPD just sacrifices a tiny privacy degree which is acceptable.

关键词： Data privacy Privacy Diseases Aggregates Databases Lungs Organizations

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Dongdong Zhao Wenjian Luo Ran Liu Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China School of Computer Science China University of Geosciences Wuhan China

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the K-hidden algorithm for generating hard-to-reverse NDBs (called K-hidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the K-hidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the q-hidden-NDB.

关键词： Search problems Databases Security Data privacy Algorithm design and analysis Computer science NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：