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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,590 篇 会议
920 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,521 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,647 篇 工学
- 1,193 篇 电气工程
- 961 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 169 篇 软件工程
- 100 篇 电子科学与技术（可...
- 64 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
345 篇 理学
- 256 篇 数学
- 57 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 地球物理学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

5,521 篇 source coding
1,261 篇 decoding
639 篇 codes
602 篇 channel coding
418 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
227 篇 software
227 篇 training
223 篇 computational mo...
212 篇 semantics
203 篇 video coding
197 篇 encoding
191 篇 quantization
185 篇 distortion
184 篇 redundancy
182 篇 information theo...
181 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
24 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 stanford univ de...
18 篇 univ calif berke...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
14 篇 georgia inst tec...
13 篇 department of el...
13 篇 department of el...
12 篇 ibm thomas j. wa...
12 篇 university of ca...
12 篇 department of el...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
18 篇 k. rose
18 篇 jun chen
18 篇 michelle effros
17 篇 yasutada oohama
16 篇 skoglund mikael
15 篇 chao tian
14 篇 k. zeger
14 篇 b. girod
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,468 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

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

共 5521 条记录，以下是171-180 订阅

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

详细简洁

排序：

Discriminatory source coding for a noiseless broadcast channel

Discriminatory source coding for a noiseless broadcast chann...

引用

IEEE International Symposium on Information Theory

作者： Grokop, L Sahai, A Gastpar, M Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

ISBN: (纸本)0780391500

We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Slepian-Wolf rate, but at the cost of full information leakage to the eavesdropper. Our main result is a lower bound that implies that any entropically efficient broadcast scheme must be "like binning" in that it also must leak significant information to eavesdroppers.

关键词： source coding broadcast channels

来源：评论

学校读者我要写书评

暂无评论

Multi-terminal source coding Through a Relay

Multi-terminal Source Coding Through a Relay

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Soundararajan, Rajiv Vishwanath, Sriram Univ Texas Austin Dept Elect & Comp Engn LINC Austin TX 78712 USA

ISBN: (纸本)9781457705953

This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving "good" rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.

关键词： Decoding Gaussian processes Lattices Rate-distortion Relays source coding Zinc compress and forward compute and forward correlated Gaussian sources correlation methods intermediate relay multi terminal source coding point to point relay source coding source coding

来源：评论

学校读者我要写书评

暂无评论

Non-Asymptotic and Second-Order Achievability Bounds for source coding With Side-Information

Non-Asymptotic and Second-Order Achievability Bounds for Sou...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Watanabe, Shun Kuzuoka, Shigeaki Tan, Vincent Y. F. Univ Tokushima Tokushima Japan Wakayama Univ Dept Comp & Commun Sci Wakayama Japan Natl Univ Singapore Inst Infocomm Res Singapore Singapore

ISBN: (纸本)9781479904464

We present a novel achievability bound for the Wyner-Ahlswede-Korner (WAK) problem of lossless source coding with rate-limited side-information. This bound is proved using ideas from channel simulation and channel resolvability. The bound improves on all previous non-asymptotic bounds on the error probability of the WAK problem. We also present achievable second-order coding rates by applying the multidimensional Berry-Esseen theorem to our new non-asymptotic bound.

关键词： source coding side-information finite block-length non-asymptotic second-order coding rate

来源：评论

学校读者我要写书评

暂无评论

Sum-Rate-Distortion Function for Indirect Multiterminal source coding in Federated Learning

Sum-Rate-Distortion Function for Indirect Multiterminal Sour...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Zhang, Naifu Tao, Meixia Wang, Jia Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9781538682098

One of the main focus in federated learning (FL) is the communication efficiency since a large number of participating edge devices send their updates to the edge server at each round of the model training. Existing works reconstruct each model update from edge devices and implicitly assume that the local model updates are independent over edge devices. In FL, however, the model update is an indirect multi-terminal source coding problem, also called as the CEO problem where each edge device cannot observe directly the gradient that is to be reconstructed at the decoder, but is rather provided only with a noisy version. The existing works do not leverage the redundancy in the information transmitted by different edges. This paper studies the rate region for the indirect multiterminal source coding problem in FL. The goal is to obtain the minimum achievable rate at a particular upper bound of gradient variance. We obtain the rate region for the quadratic vector Gaussian CEO problem under unbiased estimator and derive an explicit formula of the sum-rate-distortion function in the special case where gradient are identical over edge device and dimension. Finally, we analyse communication efficiency of convex Minibatched SGD and non-convex Minibatched SGD based on the sum-rate-distortion function, respectively.

关键词： Training Upper bound source coding Redundancy Rate-distortion Estimation Collaborative work

来源：评论

学校读者我要写书评

暂无评论

Secure source coding with a Public Helper

Secure Source Coding with a Public Helper

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kittichokechai, Kittipong Chia, Yeow-Khiang Oechtering, Tobias J. Skoglund, Mikael Weissman, Tsachy KTH Royal Inst Technol Sch Elect Engn ACCESS Linnaeus Ctr S-11428 Stockholm Sweden Tech Univ Berlin Dept Telecommun Syst Berlin Germany Infocomm Inst Res Singapore Singapore IBM Res Collaboratory Singapore Singapore Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781479904464

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

关键词： public key cryptography source coding telecommunication security

来源：评论

学校读者我要写书评

暂无评论

Cascade source coding with Erased Side Information

Cascade Source Coding with Erased Side Information

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Tandon, Ravi Mohajer, Soheil Poor, H. Vincent Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781457705953

A cascade lossy source coding problem with one encoder and two decoders is considered. All variations of this problem are studied by varying the availability of correlated side information at the encoder/decoder(s). The set of achievable rate-distortion triples is characterized for three instances of this problem when the encoder is interested in transmission of a memoryless equiprobable binary source X subject to Hamming distortion and the side information Y is an erased version of X.

关键词： Availability Decoding Distortion measurement Hamming codes Hamming distortion Markov processes Rate-distortion source coding cascade lossy source coding problem correlated side information decoder decoding encoder erased side information memoryless equiprobable binary source X subject rate-distortion source coding

来源：评论

学校读者我要写书评

暂无评论

Non-Asymptotic Bounds on Fixed Length source coding for Markov Chains

Non-Asymptotic Bounds on Fixed Length Source Coding for Mark...

引用

51st IEEE Annual Allerton Conference on Communication, Control, and Computing

作者： Hayashi, Masahito Watanabe, Shun Nagoya Univ Grad Sch Math Nagoya Aichi 4648601 Japan Natl Univ Singapore Ctr Quantum Technol Singapore 117548 Singapore Univ Tokushima Dept Informat Sci & Intelligent Syst Tokushima Japan Univ Maryland Syst Res Inst College Pk MD 20742 USA

ISBN: (纸本)9781479934096

In this paper, we derive non-asymptotic bounds on the fixed length source coding with/without side-information at the decoder. Our bounds are efficiently computable in the sense that the computational complexity does not depend on the block length, and are also asymptotically optimal in the sense of the large deviation and/or the moderate deviation.

关键词： fixed length source coding Bound Tree graphs Markov chain Markov decoders complexity classes

来源：评论

学校读者我要写书评

暂无评论

Secure source coding with Action-dependent Side Information

Secure Source Coding with Action-dependent Side Information

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kittichokechai, Kittipong Oechtering, Tobias J. Skoglund, Mikael Royal Inst Technol KTH Sch Elect Engn Stockholm Sweden

ISBN: (纸本)9781457705953

We consider a secure lossy source coding problem with the presence of an eavesdropper who has access to the source description. An encoder wants to compress the source in such a way that the intended decoder can reconstruct the source sequence and satisfy a distortion criterion, while revealing only limited knowledge about the source to the eavesdropper. In our system an action sequence is generated based on the source description with some costs to influence the side information available to the legitimate decoder and the eavesdropper. We provide a complete characterization of the rate-distortion-cost-equivocation region for a discrete source with correlated action-dependent side information at the decoders. The result serves as a fundamental limit for example in secure sensor networking.

关键词： Decoding Entropy Markov processes Random variables Security source coding action dependent side information action sequence discrete source distortion criteria eavesdropper rate distortion cost equivocation region secure lossy source coding problem secure source coding source coding telecommunication security wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Generalization of Blahut-Arimoto Algorithm to Compute Rate-Distortion Regions of Multiterminal source coding Under Logarithmic Loss

A Generalization of Blahut-Arimoto Algorithm to Compute Rate...

引用

2017 IEEE Information Theory Workshop (ITW)

作者： Ugur, Yigit Aguerri, Inaki Estella Zaidi, Abdellatif Huawei Technol France Res Ctr Math & Algorithm Sci Lab F-92100 Boulogne France Univ Paris Est F-77454 Champs Sur Marne France

ISBN: (纸本)9781509030972

In this paper, we present iterative algorithms that numerically compute the rate-distortion regions of two problems: the two-encoder multiterminal source coding problem and the Chief Executive Officer (CEO) problem, both under logarithmic loss distortion measure. With the clear connection of these models with the distributed information bottleneck method, the proposed algorithms may find usefulness in a variety of applications, such as clustering, pattern recognition and learning. We illustrate the efficiency of our algorithms through some numerical examples.

关键词： Distortion source coding Distortion measurement Rate-distortion Loss measurement Clustering algorithms Decoding

来源：评论

学校读者我要写书评

暂无评论

Lossless source coding in the Point-to-Point, Multiple Access, and Random Access Scenarios

Lossless Source Coding in the Point-to-Point, Multiple Acces...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Chen, Shuqing Effros, Michelle Kostina, Victoria CALTECH Dept Elect Engn Pasadena CA 91125 USA

ISBN: (纸本)9781538692912

This paper treats point-to-point, multiple access and random access lossless source coding in the finite-blocklength regime. A random coding technique is developed, and its power in analyzing the third-order coding performance is demonstrated in all three scenarios. Results include a third-order-optimal characterization of the Slepian-Wolf rate region and a proof showing that for dependent sources, the independent encoders used by Slepian-Wolf codes can achieve the same third-order-optimal performance as a single joint encoder. The concept of random access source coding, which generalizes the multiple access scenario to allow for a subset of participating encoders that is unknown a priori to both the encoders and the decoder, is introduced. Contributions include a new definition of the probabilistic model for a random access-discrete multiple source, a general random access source coding scheme that employs a rateless code with sporadic feedback, and an analysis demonstrating via a random coding argument that there exists a deterministic code of the proposed structure that simultaneously achieves the third-order-optimal performance of Slepian-Wolf codes for all possible subsets of encoders.

关键词： source coding Error probability Entropy Maximum likelihood decoding Random variables

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：