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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 期刊文献
52 篇 会议
1 篇 学位论文

馆藏范围

168 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

160 篇 工学
- 143 篇 电气工程
- 105 篇 计算机科学与技术...
- 62 篇 信息与通信工程
- 12 篇 交通运输工程
- 3 篇 软件工程
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 仪器科学与技术
53 篇 理学
- 50 篇 数学
- 3 篇 物理学
3 篇 医学
- 3 篇 临床医学
2 篇 管理学
- 2 篇 图书情报与档案管...

主题

168 篇 index coding
46 篇 network coding
22 篇 indexes
22 篇 side information
18 篇 encoding
17 篇 coded caching
15 篇 receivers
9 篇 minrank
8 篇 interference ali...
8 篇 servers
7 篇 caching
6 篇 distributed stor...
5 篇 capacity
5 篇 error correction
5 篇 lattice codes
5 篇 graph theory
5 篇 codes
5 篇 non-orthogonal m...
5 篇 unicast
5 篇 broadcast channe...

机构

12 篇 indian inst sci ...
7 篇 indian inst sci ...
5 篇 monash univ dept...
5 篇 univ newcastle s...
5 篇 city univ hong k...
4 篇 texas a&m univ d...
4 篇 acad coll tel av...
3 篇 univ naples fede...
3 篇 indian inst tech...
3 篇 univ new south w...
3 篇 univ utah dept e...
3 篇 indian inst sci ...
3 篇 univ southern ca...
3 篇 nanyang technol ...
3 篇 mediatek inc hsi...
3 篇 cornell univ sch...
3 篇 natl taipei univ...
2 篇 new jersey inst ...
2 篇 univ south austr...
2 篇 univ calif irvin...

作者

24 篇 rajan b. sundar
10 篇 ong lawrence
8 篇 viterbo emanuele
8 篇 natarajan lakshm...
7 篇 sung chi wan
7 篇 elia petros
7 篇 huang yu-chih
7 篇 hong yi
6 篇 thomas anoop
6 篇 johnson sarah j.
5 篇 karat nujoom sag...
5 篇 pachat jesy
5 篇 haviv ishay
5 篇 mahesh anjana a.
4 篇 gomez-vilardebo ...
4 篇 skachek vitaly
4 篇 tulino antonia m...
4 篇 mostafa salwa
4 篇 deepthi p. p.
4 篇 llorca jaime

语言

163 篇 英文
5 篇 其他

检索条件"主题词=Index coding"

共 168 条记录，以下是141-150 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Wavelet-based audio embedding and audio/video compression

Wavelet-based audio embedding and audio/video compression

引用

Conference on Applications of Digital Image Processing XXIV

作者： Mendenhall, MJ Claypoole, RL USAF Inst Technol Dept Elect & Comp Engn Wright Patterson AFB OH 45433 USA

ISBN: (纸本)0819441864

Watermarking, traditionally used for copyright protection, is used in a new and exciting way. An efficient wavelet-based watermarking technique embeds audio information into a video signal. Several effective compression techniques are applied to compress the resulting audio/video signal in an embedded fashion. This wavelet-based compression algorithm incorporates bit-plane coding, index coding, and Huffman coding. To demonstrate the potential of this audio embedding and audio/video compression algorithm, we embed an audio signal into a video signal and then compress. Results show that overall compression rates of 15:1 can be achieved. The video signal is reconstructed with a median PSNR of nearly 33 dB. Finally, the audio signal is extracted from the compressed audio/video signal without error. The views expressed in this article are those of the authors and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U. S. Government.

关键词： watermarking compression embedding bit-plane coding index coding entropy coding discrete wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Coded Caching Does Not Generally Benefit From Selfish Caching

Coded Caching Does Not Generally Benefit From Selfish Cachin...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Brunero, Federico Elia, Petros EURECOM Commun Syst Dept Sophia Antipolis France

ISBN: (纸本)9781665421607;9781665421591

In typical coded caching scenarios, the content of a central library is assumed to be of interest to all receiving users. However, in a realistic scenario the users may have diverging interests which may intersect to various degrees. What happens for example if each file is of potential interest to, say, 40% of the users and each user has potential interest in 40% of the library? What if then each user caches selfishly only from content of potential interest? In this work, we formulate the symmetric selfish coded caching problem, where each user naturally makes requests from a subset of the library, which defines its own file demand set (FDS), and caches selfishly only contents from its own FDS. For the scenario where the different FDSs symmetrically overlap to some extent, we propose a novel information-theoretic converse that reveals, for such general setting of symmetric FDS structures, that selfish coded caching yields a load performance which is strictly worse - in the non-trivial memory regime than that in standard coded caching.

关键词： Coded caching file popularity index coding information-theoretic converse selfish caching

来源：评论

学校读者我要写书评

暂无评论

Fast embedded image coding technique using wavelet difference reduction 3

Fast embedded image coding technique using wavelet differenc...

引用

Conference on Electronic Imaging and Multimedia Technology III

作者： Yuan, Y Mandal, MK Univ Alberta Dept Elect & Comp Engn Multimedia Comp & Commun Lab Edmonton AB T6G 2V4 Canada

ISBN: (纸本)0819447145

We propose two modified versions of the original wavelet difference reduction (WDR) algorithm proposed by Tian and Wells. The first algorithm encodes an image without entropy coding and achieves comparable PSNR performance with the original WDR at low bit rate while exceeding the PSNR performance of original WDR algorithm at medium to high bitrates. The second algorithm achieves slightly higher PSNR performance than that of original WDR with similar computational complexity. The modification to the original WDR is based on the observation that encoding the symbol streams generated in the sorting pass (significance map) and refinement pass (magnitudes) separately can be beneficial. We can either encode the symbol streams under different contexts using entropy coder, or output the raw symbol streams without entropy coding stage. It is shown in the experiments that up to 1/3 of both the encoding time and the decoding time can be saved without sacrificing any PSNR performance when compared to the original WDR.

关键词： image coding progressive coding wavelet transform index coding

来源：评论

学校读者我要写书评

暂无评论

On Approximating the Sum-Rate for Multiple-Unicasts

On Approximating the Sum-Rate for Multiple-Unicasts

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Shanmugam, Karthikeyan Asteris, Megasthenis Dimakis, Alexandros G. Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781467377041

We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with k independent sources. Our approximation algorithm runs in polynomial time and yields an upper bound on the joint source entropy rate, which is within an O (log(2) k) factor from the GNS cut. It further yields a vector-linear network code that achieves joint source entropy rate within an O (log(2) k) factor from the GNS cut, but not with independent sources: the code induces a correlation pattern among the sources. Our second contribution is establishing a separation result for vector-linear network codes: for any given field F there exist networks for which the optimum sum-rate supported by vector-linear codes over F for independent sources can be multiplicatively separated by a factor of k(1-delta), for any constant delta > 0, from the optimum joint entropy rate supported by a code that allows correlation between sources. Finally, we establish a similar separation result for the asymmetric optimum vector-linear sum-rates achieved over two distinct fields F-p and F-q for independent sources, revealing that the choice of field can heavily impact the performance of a linear network code.

关键词： Multiple unicasts network coding index coding GNS-cut sum-rate

来源：评论

学校读者我要写书评

暂无评论

Online Caching and coding at the WiFi Edge: Gains and Tradeoffs

Online Caching and Coding at the WiFi Edge: Gains and Tradeo...

引用

IEEE Wireless Communications and Networking Conference (IEEE WCNC)

作者： Chhangte, Lalhruaizela Viterbo, Emanuele Manjunath, D. Karamchandani, Nikhil IITB Monash Res Acad Mumbai Maharashtra India Monash Univ Clayton Vic Australia Indian Inst Technol Mumbai Maharashtra India

ISBN: (纸本)9781728151786

Video content delivery at the wireless edge continues to be challenged by insufficient bandwidth and highly dynamic user behavior which affects both effective throughput and latency. Caching at the network edge and coded transmissions have been found to improve user performance of video content delivery. The cache at the wireless edge stations (BSs, APs) and at the users' end devices can be populated by pre-caching content or by using online caching policies. In this paper, we propose a system where content is cached at the user of a WiFi network via online caching policies, and coded delivery is employed by the WiFi AP to deliver the requested content to the user population. The content of the cache at the user serves as side information for index coding. We also propose the LFU-index cache replacement policy at the user that demonstrably improves cache hit and index coding opportunities at the WiFi AP for the proposed system. Through an extensive simulation study, we determine the gains achieved by caching and index coding. Next, we analyze the tradeoffs between them in terms of data transmitted, latency, and throughput for different content request behaviors from the users. We also show that the proposed cache replacement policy performs better than traditional cache replacement policies like LRU and LFU.

关键词： cache edge index coding wireless

来源：评论

学校读者我要写书评

暂无评论

Improved Converses and Gap Results for Coded Caching

Improved Converses and Gap Results for Coded Caching

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Wang, Chien-Yi Bidokhti, Shirin Saeedi Wigger, Michele Telecom ParisTech LTCI F-75013 Paris France MediaTek Inc Hsinchu 30078 Taiwan Univ Penn Dept Elect & Syst Engn Philadelphia PA 19104 USA

ISBN: (纸本)9781509040971

Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is shown to be less than 2.315 in the worst case scenario and 2.507 in the average-case scenario.

关键词： Caching rate-memory tradeoff source coding index coding

来源：评论

学校读者我要写书评

暂无评论

Optimal index Code Design for IC-NOMA Transmission in VANETs 96

Optimal Index Code Design for IC-NOMA Transmission in VANETs

引用

IEEE 96th Vehicular Technology Conference (VTC-Fall)

作者： Pazhoor, Sreelakshmi Pachat, Jesy Karat, Nujoom Sageer Joseph, Vinay Deepthi, P. P. Rajan, B. Sundar Natl Inst Technol Dept Elect & Commun Engn Calicut 673601 Kerala India Govt Coll Engg Dept Elect & Commun Engn Kannur 670563 India Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

ISBN: (纸本)9781665454681

Vehicular ad hoc network (VANET), is a developing platform with massive data demands for infotainment services in recent years. index Coded NOMA (IC-NOMA) is a spectral efficient transmission method that can be used in VANETs. IC-NOMA applies the concepts of non-orthogonal multiple access (NOMA) over the index coded data to increase spectrum and power efficiency. In NOMA, far user does not get access to the near user data, while near user can successfully decode far user data. Therefore, the IC-NOMA demands a novel design of index code for improved bandwidth efficiency. This work considers the design of index code for NOMA when the user demands in VANET follows the data distribution of one- sided symmetric neighboring consecutive side information single unicast index coding problem (SNC-SUICP). For this setup, we develop an optimal closed form index coding (IC) solution which can bring in additional bandwidth savings through NOMA. The improved performance of the proposed IC-NOMA transmission scheme when compared with one- sided SNC-SUICP in terms of bandwidth efficiency is demonstrated.

关键词： Non-orthogonal multiple access index coding symmetric neighboring consecutive side information single unicast index coding problem index coded NOMA

来源：评论

学校读者我要写书评

暂无评论

Data Dissemination Problem in Wireless Networks 53

Data Dissemination Problem in Wireless Networks

引用

53rd Annual IEEE Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Kubjas, Ivo Skachek, Vitaly Univ Tartu Inst Comp Sci Tartu Estonia

ISBN: (纸本)9781509018246

In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define r-solvable networks, in which data dissemination can be achieved in r > 0 communications rounds. We show that the optimum number of transmissions for any one-round communications scheme is given by the minimum rank of a certain constrained family of matrices. For a special case of this problem, called bipartite data dissemination problem, we present lower and upper graph-theoretic bounds on the optimum number of transmissions. For general r-solvable networks, we derive an upper bound on the minimum number of transmissions in any scheme with >= r rounds. We experimentally compare the obtained upper bound to a simple lower bound.

关键词： Data dissemination data exchange index coding network coding

来源：评论

学校读者我要写书评

暂无评论

Optimal Instantly Decodable Network Codes for Multi-Sender Scenarios

Optimal Instantly Decodable Network Codes for Multi-Sender S...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Ambadi, Niranjana Indian Inst Sci Dept Elect Commun Engn Bangalore Karnataka India

ISBN: (纸本)9781538676462

Instantly Decodable Network Codes (IDNCs) are of practical interest in many broadcast and multicast applications in both wired and wireless networks. They have low encoding and decoding complexities (simple XORing) and lower decoding delay. This work explores multi-sender multicast-broadcast scenarios and gives the theoretically optimal algorithm to find instantly decodable network codes. All the broadcast symbols are scheduled by a control node. At any particular instant of time, only one sender broadcasts coded symbols. No sender-to-sender communication is assumed. The optimality criterion is maximizing the number of users that are able to decode exactly one amongst the messages they desire, when a coded symbol is broadcasted. An IDNC graph is defined with the messages as vertices, and edges denoting the infeasibility of combining the messages to form an IDNC broadcast symbol. The solution consists of finding maximum independent sets in certain induced subgraphs of the IDNC graph. This problem is known to be NP-hard in the general case. Simulation results show the improvement in the average decoding delay experienced by the users and the total completion time compared to the uncoded ARQ re-transmissions in a broadcast erasure channel.

关键词： Instantly Decodable Network coding index coding Network coding

来源：评论

学校读者我要写书评

暂无评论

On Linear Codes for Broadcasting with Noisy Side Information 24

On Linear Codes for Broadcasting with Noisy Side Information

引用

24th National Conference on Communications (NCC)

作者： Ghosh, Suman Natarajan, Lakshmi Indian Inst Technol Hyderabad Dept Elect Engn Sangareddy 502285 India

ISBN: (纸本)9781538612248

We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as broadcasting with noisy side information (BNSI), has applications in the re-transmission phase of downlink networks. We derive a necessary and sufficient condition for a linear coding scheme to satisfy the demands of all the receivers in a given BNSI network, and show that syndrome decoding can be used at the receivers to decode the demanded messages from the received codeword and the available noisy side information. We represent BNSI problems as bipartite graphs, and using this representation, classify the family of problems where linear coding provides bandwidth savings compared to uncoded transmission. We also provide a simple algorithm to determine if a given BNSI network belongs to this family of problems, i.e., to identify if linear coding provides an advantage over uncoded transmission for the given BNSI problem.

关键词： broadcast channel index coding linear codes network coding noisy side information syndrome decoding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：