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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,573 篇 会议
936 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

5,520 篇 source coding
1,266 篇 decoding
639 篇 codes
606 篇 channel coding
419 篇 rate-distortion
389 篇 entropy
341 篇 random variables
297 篇 image coding
274 篇 data compression
228 篇 software
223 篇 training
218 篇 computational mo...
211 篇 semantics
203 篇 video coding
200 篇 encoding
190 篇 quantization
186 篇 redundancy
185 篇 distortion
184 篇 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 篇 georgia inst tec...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
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,460 篇 英文
51 篇 其他
8 篇 中文
1 篇 俄文

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

共 5520 条记录，以下是131-140 订阅

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

详细简洁

排序：

Efficient Distributed source coding of Fragmented Genomic Sequencing Data

Efficient Distributed Source Coding of Fragmented Genomic Se...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Gershon, Yotam Cassuto, Yuval Technion Israel Inst Technol Viterbi Fac Electrial Engn Haifa Israel

ISBN: (纸本)9781538682098

In this paper we present a new compression scheme for genomic read data produced by modern sequencing technologies. In this setting, a reference genome similar to the one being sequenced is available only at the decoder, while the starting index of each read in this reference in unknown. The proposed scheme significantly reduces the encoding complexity relative to known reference-based compression schemes. The results include a code construction based on generalized concatenation coset codes, analysis of the decoding failure probability, and optimization of the scheme parameters for minimal compression rate.

关键词： Sequential analysis source coding Genomics Distributed databases Decoding Complexity theory Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Lossy source coding Via Deep Learning

Lossy Source Coding Via Deep Learning

引用

Data Compression Conference (DCC)

作者： Li, Qing Chen, Yang ScaleFlux Inc San Jose CA 95112 USA Univ Michigan Dept Stat Ann Arbor MI 48109 USA

ISBN: (纸本)9781728106571

Motivated by a recent work of learning rate distortion approaching posterior via Restricted Boltzmann Machines, we generalize the result to Deep Belief Networks and propose a deep learning based lossy compression for stationary ergodic sources. The compression algorithm consists of two stages, a training stage, which is to learn the posterior with the training data of the same class as the source, and a compression/reproduction stage, which consists of a lossless compression and a lossless reproduction. The theoretical result shows that our algorithm asymptotically achieves the optimum rate-distortion function for stationary ergodic sources, and the experimental results outperform the reported best results.

关键词： Rate-distortion Deep learning Distortion source coding Approximation algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Necessary and Sufficient Condition for Transform Optimality in source coding

A Necessary and Sufficient Condition for Transform Optimalit...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9781457705953

It is well-known for transform coding of multivariate Gaussian sources, that the Karhunen Loeve transform (KLT) minimizes the mean square error distortion. However, finding the optimal transform for general non-Gaussian sources has been an open problem for decades, despite several important advances that provide some partial answers regarding KLT optimality. In this paper, we present a necessary and sufficient condition for optimality of a transform when high resolution, variable rate quantizers are employed. We present not only a complete characterization of when KLT is optimal, but also a determining condition for optimality of a general (non-KLT) transform. This necessary and sufficient condition is shown to have direct connections to the well studied source separation problem. This observation can impact source separation itself, as illustrated with a new optimality result. Finally, we combine the transform optimality condition with algorithmic tools from source separation, to derive a practical numerical method to search for the optimal transform in source coding.

关键词： Transform coding source coding source separation quantization

来源：评论

学校读者我要写书评

暂无评论

Distributed source coding in Large Wireless Sensor Networks

Distributed Source Coding in Large Wireless Sensor Networks

引用

44th Asilomar Conference on Signals, Systems and Computers

作者： Barcelo-Llado, J. E. Morell, Antoni Seco-Granados, Gonzalo Univ Autonoma Barcelona Dpt Telecom & Syst Engn E-08193 Barcelona Spain

ISBN: (纸本)9781424497218

We study the performance of distributed source coding in large wireless sensor networks obtained with enhanced correlation estimators. Distributed source coding is especially useful when data correlation exists since it tries to remove the redundancy in the information;and dense sensor networks are rich in correlations. Existing results from information theory show that this compression can be executed in a distributed fashion and without any performance loss in comparison with the centralized approach. However, there is still performance gap between the theoretical bounds and the results achieved with practical implementations. In order to mitigate this, we propose the use of enhanced correlation estimators. Simulation results show a performance improvement in the energy consumption by reducing the number of transmitted bits compared to classical methods.

关键词： C-2 E-6 distributed source coding Wireless sensor networks source coding energy consumption data association performance boost Sensor networks Information Theory Estimators

来源：评论

学校读者我要写书评

暂无评论

Minimizing The Expected Distortion of Two-Hop Networks Using Multi-layer source coding 8

Minimizing The Expected Distortion of Two-Hop Networks Using...

引用

8th International Symposium on Telecommunications (IST)

作者： Khodam Hoseini, Sayed Ali Akhlaghi, Soroush Baghani, Mina Shahed Univ Dept Engn Tehran Iran Amirkabir Univ Technol Microwave & Wireless Commun Res Lab Dept Elect Engn Tehran Iran

ISBN: (纸本)9781509034352

This paper concerns minimizing the expected distortion of a Gaussian source, transmitted over a two-hop block fading channel, under the mean square-error measure. It is assumed that there is not a direct link between the source and destination, and a simple Decode and Forward (DF) relay, handles the communication. The channel state information (CSI) associated with each hop is available at the corresponding receiver, while the transmitters are unaware of associated CSIs. It is assumed that the source node performs successive refinement source coding approach, together with multi-layer channel coding to send its information to the relay. Then, the relay re-encodes its received information with a multi-layer channel code, and forwards it to the destination. Accordingly, the optimal power allocation policy across code layers in terms of minimizing the expected achievable distortion are formulated and addressed and then the results are numerically derived for Rayleigh block fading environment, showing the proposed method performs better than the Amplify and Forward (AF) relaying for source-channel mismatch factors greater than one.

关键词： Distortion Relays Resource management Fading channels Optimization Transmitters Encoding relay abnormal shapes Transmitters Fading channels distortion management of resources Channel coding source coding destination

来源：评论

学校读者我要写书评

暂无评论

A Unified Framework for Problems on Guessing, source coding, and Tasks Partitioning

A Unified Framework for Problems on Guessing, Source Coding,...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kumar, M. Ashok Sunny, Albert Thakre, Ashish Kumar, Ashisha Manohar, G. Dinesh Indian Inst Technol Palakkad Palakkad Kerala India Indian Inst Technol Indore Indore Madhya Pradesh India Tech Univ Munich Bavaria Germany

ISBN: (纸本)9781665421607;9781665421591

We formulate a general framework for which Campbell's source coding, Arikan's guessing, Huleihel et al.'s memorry-less guessing, Bunte and Lapidoth's tasks partitioning problems are specific ones. We then use this framework to show an equivalence among these problems. A full paper version of this paper is accessible at: https://***/abs/2012.13707v1

关键词： source coding Task analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Sensor Design and Zero-Delay source coding for Continuous-Time Vector Gauss-Markov Processes 56

Optimal Sensor Design and Zero-Delay Source Coding for Conti...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Tanaka, Takashi Skoglund, Mikael Ugrinovskii, Valeri Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden Univ New South Wales ADFA Sch Engn & IT Canberra ACT Australia

ISBN: (纸本)9781509028733

We consider the situation in which a continuoustime vector Gauss-Markov process is observed through a vector Gaussian channel (sensor) and estimated by the Kalman-Bucy filter. Unlike in standard filtering problems where a sensor model is given a priori, we are concerned with the optimal sensor design by which (i) the mutual information between the source random process and the reproduction (estimation) process is minimized, and (ii) the minimum mean-square estimation error meets a given distortion constraint. We show that such a sensor design problem is tractable by semidefinite programming. The connection to zero-delay source-coding is also discussed.

关键词： Mutual information Channel estimation Random processes source coding Estimation Rate-distortion Standards

来源：评论

学校读者我要写书评

暂无评论

Two-terminal source coding with common sum reconstruction

Two-terminal source coding with common sum reconstruction

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Adikari, Tharindu Draper, Stark Univ Toronto Toronto ON Canada

ISBN: (纸本)9781665421607;9781665421591

We present the problem of two-terminal source coding with Common Sum Reconstruction (CSR). Consider two terminals, each with access to one of two correlated sources. Both terminals want to reconstruct the sum of the two sources under some average distortion constraint, and the reconstructions at two terminals must be identical with high probability. In this paper, we develop inner and outer bounds to the achievable rate distortion region of the CSR problem for a doubly symmetric binary source. We employ existing achievability results for Steinberg's common reconstruction and Wyner-Ziv's source coding with side information problems, and an achievability result for the lossy version of Korner-Marton's modulo-two sum computation problem.

关键词： source coding common reconstruction modulotwo sum lossy Korner-Marton

来源：评论

学校读者我要写书评

暂无评论

Rate-Distortion Functions for source coding with Complementary Side Information

Rate-Distortion Functions for Source Coding with Complementa...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Timo, Roy Grant, Alex Kramer, Gerhard Univ S Australia Inst Telecommun Res Adelaide SA 5001 Australia Tech Univ Munich Dept Elect Elect & Informat Technol D-80290 Munich Germany

ISBN: (纸本)9781457705953

The rate-distortion (RD) function for source coding with complementary side-information is characterised for several special cases of the general problem. These include Steinberg's common-reconstruction setting, small distortions for both sources, zero distortion for one source, conditionally independent sources, and deterministic distortion measures.

关键词： Distortion measurement Joints Markov processes Minimization RD function Rate-distortion Receivers source coding common-reconstruction setting complementary side information rate distortion theory rate-distortion functions source coding source coding

来源：评论

学校读者我要写书评

暂无评论

On the Network-Wide Gain of Memory-Assisted source coding

On the Network-Wide Gain of Memory-Assisted Source Coding

引用

IEEE Information Theory Workshop (ITW)

作者： Sardari, Mohsen Beirami, Ahmad Fekri, Faramarz Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)9781457704376

Several studies have identified a significant amount of redundancy in the network traffic. For example, it is demonstrated that there is a great amount of redundancy within the content of a server over time. This redundancy can be leveraged to reduce the network flow by the deployment of memory units in the network. The question that arises is whether or not the deployment of memory can result in a fundamental improvement in the performance of the network. In this paper, we answer this question affirmatively by first establishing the fundamental gains of memory-assisted source compression and then applying the technique to a network. Specifically, we investigate the gain of memory-assisted compression in random network graphs consisted of a single source and several randomly selected memory units. We find a threshold value for the number of memories deployed in a random graph and show that if the number of memories exceeds the threshold we observe network-wide reduction in the traffic.

关键词： Conferences Context Erbium Redundancy Servers source coding data compression graph theory memory units memory-assisted source coding memory-assisted source compression network coding network traffic network-wide gain network-wide reduction random network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：