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

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP)

作者： Guojun Ma Qingqi Pei Yuchen Wang Xiaohong Jiang The State Key Laboratory of Integrated Services Networks Xidian University Xi'an China School of Electronic Engineering University of Electronic Science and Technology of China Chengdu China Key Lab of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an China

Content sharing is one of the most significant issues of Digital Rights Management (abbr. DRM). Various schemes for content sharing have been presented in the past years. However, the main goals of these schemes are to solve portability problems instead of rational sharing between different users who are not family members. In this work, we propose an initial step toward this rational sharing and present a general sharing model based on proxy re-encryption. Our model can support the flexible sharing mechanism, with which the user can choose any of the purchased content to share with any legal device, and the content provider can know and limit the number of sharing devices to achieve some novel DRM policies such as pay-per-sharing. To our best knowledge, our sharing model is the first model for content sharing between different users' devices who are not family members using proxy re-encryption. With rational applications, our model can benefit for both the user and content provider to achieve win-win development.

关键词： Licenses Public key Computational modeling Encryption Educational institutions Law

来源：评论

学校读者我要写书评

暂无评论

Polite water-filling for weighted sum-rate maximization in MIMO B-MAC networks under multiple linear constraints

Polite water-filling for weighted sum-rate maximization in M...

引用

IEEE International Symposium on Information Theory

作者： An Liu Youjian Liu Vincent K. N. Lau Haige Xiang Wu Luo State Key Laboratory of Advanced Optical Communication Systems & Networks School of EECS Peking University China Department of Electrical and Computer Engineering University of Colorado Boulder USA Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong China

ISBN: (纸本)9781457705960

The algorithms in this paper exploit optimal input structure in interference networks and is a major advance from the state-of-the-art. Optimization under multiple linear constraints is important for interference networks with individual power constraints, per-antenna power constraints, and/or interference constraints as in cognitive radios. While for single-user MIMO channel transmitter optimization, no one uses general purpose optimization algorithms such as steepest ascent because water-filling is optimal and much simpler, this is not true for MIMO multiaccess channels (MAC), broadcast channels (BC), and the non-convex optimization of interference networks because the traditional water-filling is far from optimal for networks. We recently found the right form of water-filling, polite water-filling, for some capacity/achievable regions of the general MIMO interference networks, named B-MAC networks, which include BC, MAC, interference channels, X networks, and most practical wireless networks as special cases. In this paper, we use weighted sum-rate maximization under multiple linear constraints in interference tree networks, a natural extension of MAC and BC, as an example to show how to design highly efficiency and low complexity algorithms. Several times faster convergence speed and orders of magnitude higher accuracy than the state-of-the-art are demonstrated by numerical examples.

关键词： Interference MIMO Covariance matrix Optimization Complexity theory Receivers Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Existence of ternary perfect sequences with a few zero elements

Existence of ternary perfect sequences with a few zero eleme...

引用

International Workshop on Signal Design and Its Applications in Communications (IWSDA)

作者： Xudong Li Pingzhi Fan Wai Ho Mow School of Mathematics and Computer Engineering Xihua University Chengdu China Provincial Key Laboratory of Information Coding and Transmission Institute of Mobile Communications Southwest Jiaotong University Chengdu China Department of Electronic & Computer Engineering Hong Kong University of Science and Technology Hong Kong China

Ternary perfect sequences, which include the binary perfect sequences as special cases, are introduced. The new notions of elementary transformations on ternary perfect sequences are brought forward. Necessary conditions for ternary perfect sequences with k zero elements are proposed. It is proved that there exist no ternary perfect sequences of even lengths with one zero element, and no ternary perfect sequences of odd lengths with two zero elements. It is also proved that there exist no ternary perfect sequences of any length with two adjacent zero elements. An efficient search algorithm for ternary perfect sequences is given.

关键词： Correlation Equations Energy efficiency Educational institutions Algorithm design and analysis Information theory computers

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm on color image enhancement in the DCT domain

引用

ICIC Express Letters, Part B: Applications 2011年第2期2卷 295-300页

作者： Ji, Xiuhua Song, Xudong Feng, Jiefei School of Computer Science and Technology Shandong Economic University No. 7366 Second Ring East Road Jinan 250014 China Shandong Provincial Key Laboratory of Digital Media Technology Shandong Economic University No. 7366 Second Ring East Road Jinan 250014 China

The paper proposes an improved algorithm on color image enhancement in Discrete Cosine Transform (DCT) domain, which is based on histogram equalization of the DC images composed of the DC coefficients of Y component in each DCT block. It applies the histogram equalization algorithm in spatial domain to enhance an image in DCT domain and uses the algorithm of Color Enhancement by Scaling (CES) so that not only the contrast and brightness are enhanced, but also the colors are preserved. The visual qualities of images are greatly improved by the proposed algorithm, and the better subjective and objective quality evaluations are obtained. Moreover, a method using averaging enhancement factors among adjacent blocks is proposed to reduce the blocking artifact caused by enhancing color images in blocked DCT domain. © 2011 ISSN 2185-2766.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Entropy Clustering Using Possibilistic Approach

引用

Procedia Engineering 2011年 15卷 1993-1997页

作者： Fu Hai-Jun Wu Xiao-Hong Mao Han-Ping Wu Bin School of Electrical and Information Engineering Jiangsu University Jiangsu Zhenjiang 212013 China Jiangsu Provincial Key Laboratory of Modern Agricultural Equipment and Technology Jiangsu University Jiangsu Zhenjiang 212013 China School of Information and Computer Science Anhui Agricultural University Anhui Hefei 230036 China

Fuzzy entropy clustering (FEC) is sensitive to noises the same as fuzzy c-means (FCM) clustering because the probabilistic constraints in their memberships. To solve this noise sensitive problem of FCM, Krishnapuram and Keller have presented the possibilistic c-means (PCM) clustering by abandoning the constraints of FCM. A possibilistic type of fuzzy entropy clustering is proposed based on fuzzy entropy clustering and possibilistic c-means clustering. The proposed algorithm deals with noisy data better than FEC. Furthermore, the parameters of PCM is optimized using possibilistic clustering trick. Our experiments show that FEC is sensitive to noises while our proposed algorithm is insensitive to noises and has better clustering accuracy than FEC.

关键词： Fuzzy entropy clustering fuzzy c-means possibilistic c-means noisy data

来源：评论

学校读者我要写书评

暂无评论

Evolutionary channel state information feedback control for interference alignment

Evolutionary channel state information feedback control for ...

引用

Asilomar Conference on Signals, Systems & computers

作者： Lingyang Song Zhu Han Shaohui Sun Bingli Jiao The State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University Beijing China Electrical and Computer Engineering Department University of Houston Houston USA Datang Wireless Mobile Innovation Center China Academy of Telecommunication and Technology Beijing China

ISBN: (纸本)9781467303217

Interference alignment (IA) has been well recognized as a promising technique to obtain a large multiplexing gain in multiple input multiple output (MIMO) interference channels. However, most of the existing IA schemes require global channel state information (CSI) at the transmitter to design precoding vectors, which causes a large amount of feedback bits. To reduce the feedback overhead, in this paper, we model the evolution and dynamic behavior of the CSI feedback rate control problem using the evolutionary game theory over orthogonal feedback channels with a total bandwidth constraint. The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate, subject to an overall bandwidth constraint. Then, an algorithm for the implementation of the evolution process is also presented. The proposed game-theoretic framework for modeling the interactions among the feedback of multiple users can be used to efficiently control the CSI feedback amount while achieving fairness among all the mobile receivers.

关键词： Receivers Interference Vectors Games Mobile communication Transmitters Bandwidth

来源：评论

学校读者我要写书评

暂无评论

自稀疏磁共振谱的快速采集与欠采重建

自稀疏磁共振谱的快速采集与欠采重建

引用

第十七届全国波谱学学术会议

作者： Xiaobo Qu 屈小波 Xue Cao 曹雪 Di Guo 郭迪 Shuhui Cai 蔡淑惠 Zhong Chen 陈忠 Dept.of Electronic Science Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance Xiame 厦门大学电子科学系、福建省等离子体与磁共振研究重点实验室厦门361005 School of Software Shanghai Jiao Tong University Shanghai 200240China 上海交通大学软件学院上海200240 Dept.of Computer Science Xiamen University of Technology Xiamen 361024 China 厦门理工学院计算机系厦门361024

本研究通过实例分析NMR谱中稀疏变换的稀疏性和与采样系统的相干性对重建谱的影响。当在间接维进行部分数据采集时候，基于小波变换的传统稀疏重建方法丢失了谱峰，所陈述的方法能很好的恢复这些谱峰。

关键词：自稀疏磁共振谱采样系统稀疏变换重建算法

来源：评论

学校读者我要写书评

暂无评论

Concept lattice mining algorithm using rough entropy with variable precision thresholding and co-evolution

Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of ...

引用

Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of science and technology (Natural science Edition) 2011年第1期12卷 25-30页

作者： Ding, Wei-Ping Wang, Jian-Dong Guan, Zhi-Jin College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China School of Computer Science and Technology Nantong University Nantong 226019 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

Based on some special advantages of variable precision rough sets model and co-evolutionary particle swarm algorithm, a novel concept lattice mining algorithm (REVPT)using rough entropy with variable precision thresholding and co-evolution was proposed to solve some optimization problems of the concept lattice mining. In this algorithm, variable precision rough entropy was used to scale the subpopulations of various concept lattices dynamically, and rough approximation lattices constructed. The global optimization efficiency of concept lattices was improved by sharing search experiences among different populations, which can reduce the scale of the former concept lattices, and deduce the consistent decision rule sets efficiently. The experimental results show that the proposed algorithm is better on the convergence and lattice optimization when the variable precision thresholding β is at a certain appropriate range. Therefore it is of robustness on the rules mining accuracy and efficiency.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Texture image segmentation based on contourlet-domain contextual hidden Markov tree model

引用

ICIC Express Letters 2011年第10期5卷 3707-3712页

作者： Shen, Xiaohong Zhang, Caiming Wang, Gaoshan School of Computer Science and Technology Shandong Economic University No. 7366 Erhuan Donglu Lixia District Jinan 250014 China Shandong Provincial Key Laboratory of Digital Media Technology Shandong Economic University No. 7366 Erhuan Donglu Lixia District Jinan 250014 China School of Information Management Shandong Economic University No. 7366 Erhuan Donglu Lixia District Jinan 250014 China

A new texture image segmentation algorithm based on hidden Markov tree model (HMT) in the contourlet domain with a modified context scheme is proposed. The dependencies of contourlet coefficients are modeled as HMT, which guide multiscale raw segmentations based on the Bayesian criterion. In interscale fusion stage, the new context scheme adopts parents of the child's neighbors, instead of parents' eight neighbors, to capture the interscale and neighboring dependencies of raw segmentations. Experiments show that the proposed algorithm outperforms the wavelet HMTseg algorithm in misclassification and edge preservation. © 2011 ISSN 1881-803X.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

From the modern Web applications to the multi-tenant SaaS solution

引用

Tongxin Xuebao/Journal on Communications 2011年第9 A期32卷 133-138页

作者： Ma, Kun Yang, Bo Chen, Zhen-Xiang Ma, Bing-Xian Li, Qing-Zhong School of Computer Science and Technology Shandong University Jinan 250101 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China

Migrating existing Web applications toward SaaS (software-as-a-service) applications can reuse the legacy software assets and cut down the re-development cost and risk. However, it lacked generic migration approaches and tools. A generic approach was proposed to quickly enable existing Web applications to be multi-tenant based on the data middleware. It introduced the multi-tenancy at a minimum revision of the original application. This approach is transparent and loosely coupled for the application layer.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：