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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,654 篇 工学
- 1,198 篇 电气工程
- 965 篇 计算机科学与技术...
- 513 篇 信息与通信工程
- 173 篇 软件工程
- 100 篇 电子科学与技术（可...
- 68 篇 控制科学与工程
- 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,581 篇 source coding
1,261 篇 decoding
652 篇 codes
600 篇 channel coding
415 篇 rate-distortion
382 篇 entropy
340 篇 random variables
290 篇 image coding
271 篇 data compression
248 篇 software
234 篇 training
224 篇 computational mo...
216 篇 semantics
205 篇 video coding
196 篇 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...
13 篇 department of co...
12 篇 ibm thomas j. wa...
12 篇 university of ca...

作者

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
19 篇 michelle effros
18 篇 k. rose
18 篇 jun chen
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,528 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

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

共 5581 条记录，以下是4741-4750 订阅

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

详细简洁

排序：

Communication and distributional complexity of joint probability mass functions

Communication and distributional complexity of joint probabi...

引用

IEEE International Symposium on Information Theory

作者： S. Jaggi M. Effros Department of Electrical Engineering California Institute of Technology Pasadena CA USA

The problem of truly-lossless (P e =0) distributed source coding requires knowledge of the joint statistics of the sources. In particular the locations of the zeroes of the probability mass functions (pmfs) are crucial for encoding at rates below (H(X),H(Y)). We consider the distributed computation of the empirical joint pmf P n of a sequence of random variable pairs observed at physically separated nodes of a network. We consider both worst-case and average measures of information exchange and treat both exact calculation of P n and a notion of approximation. We find that in all cases the communication cost grows linearly with the size of the input. Further, we consider the problem of determining whether the empirical pmf has a zero in a particular location and show that in most cases considered this also requires a communication cost that is linear in the input size

关键词： Costs Probability Random variables Protocols source coding Statistical distributions Encoding Computer networks Distributed computing Physics computing

来源：评论

学校读者我要写书评

暂无评论

Joint source-Channel Decoding forH.264 Coded Video Stream

Joint Source-Channel Decoding forH.264 Coded Video Stream

引用

IEEE Workshop on Multimedia Signal Processing

作者： Yue Wang Songyu Yu Jing Yang Institute of Image Communication & Information Processing Shanghai Jiaotong University Shanghai China

H.264 is the newest video coding standard and has achieved a significant improvement in coding efficiency. The entropy coding methods used in H.264 are CAVLC and CABAC. Although these two variable length code methods can achieve high compression, they are very sensitive to channel errors. This paper presents a joint source-channel MAP (maximum a posteriori probability) decoding method to dealing with this sensitivity to channel errors and applied it to the decoding of the motion vector in H.264 coded video stream. Although H.264 codec has proposed several error resilience methods, we believe this method could provide additional error resilience to H.264 stream. Experiment indicates that our JSCD achieves significant improvement than a separate scheme

关键词： Streaming media Iterative decoding Error correction Channel coding Resilience Video coding Video compression source coding Code standards Image coding

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Collection with Sampling in WSNs: Making Use of Matrix Completion Techniques

Efficient Data Collection with Sampling in WSNs: Making Use ...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Jie Cheng Hongbo Jiang Xiaoqiang Ma Lanchao Liu Lijun Qian Chen Tian Wenyu Liu Department of EIE Wuhan National Laboratory of Optoelectronics Huazhong University of Science and Technology Wuhan China Department of Electrical & Computer Engineering Prairie View A and M University Prairie View TX USA

Data collection is of paramount importance in many applications of wireless sensor networks (WSNs). Especially, to accommodate ever increasing demands of signal source coding applications, the capacity of processing multi-user data query is crucial in WSNs where the efficiency is one key consideration. To that end, this paper presents EDCA: an Efficient Data Collection Approach for data query in WSNs, which exploits recent matrix completion techniques. Specifically, for the efficiency of energy consumption, we randomly select a part of nodes from the sensor network to sample at each time instance and directly forward the data to the sink. Then, to recover the data precisely, we shift the rank minimization problem, which is NP-hard, to a convex optimization one. Compared with the centralized scheme, energy consumption using EDCA is significantly reduced due to lower sampling rate and fewer packets to transmit. The experimental results demonstrate that EDCA significantly outperforms the existing naive method in terms of energy consumption and the introduced errors are quite trivial.

关键词： Peer to peer computing Wireless sensor networks source coding Power demand Compressed sensing Energy consumption Minimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Multi-stage coding of Correlated sources

Distributed Multi-stage Coding of Correlated Sources

引用

Data Compression Conference (DCC)

作者： Ankur Saxena Kenneth Rose Department of Electrical & Computer Engineering University of California Santa Barbara CA USA

This paper considers the problem of distributed scalable coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sensor networks. The conditions of communication channels between the sensor sources and fusion center may be time-varying and it is often desirable to guarantee a base layer of coarse information during channel fades. Specifically, we consider a multi-stage coding system to perform such distributed scalable coding of correlated sources. This problem poses new challenges. We show that mere extensions of distributed coding ideas to include multi-stage coding yield poor rate-distortion performance, due to underlying conflicts between the objectives of scalable and distributed coding. An appropriate system paradigm is developed which allows such tradeoffs to be explicitly controlled within joint optimization of all the system components. We propose an iterative joint design technique and derive the necessary conditions for optimality which yield its update rules. Simulation results show substantial gains over single source (separate) multi-stage coding as well as naive extensions to incorporate scalability in distributed scalable coding schemes.

关键词： Algorithm design and analysis source coding Iterative algorithms Communication channels Sensor fusion Rate-distortion Scalability Decoding Training data Data compression

来源：评论

学校读者我要写书评

暂无评论

HIL Validation of Power Plant Controller Model

HIL Validation of Power Plant Controller Model

引用

Annual North-American Power Symposium

作者： Venkateswaran Lakshminarayanan Chathura Patabandi Om Nayak Bob Lopez Nayak Corporation Skillman New Jersey USA Nor-Cal Controls ES Inc. El Dorado Hills California USA

ISBN: (纸本)9781665499224

There is an increasing requirement to supply Inverter Based Resource (IBR) models compiled using the actual code used in the inverter-controls to support detailed electromagnetic transient (EMT) studies. Similarly, EMT models of Power Plant Controllers (PPC), which are commonly used for managing these utility-scale renewable energy plants, are also required by the utilities. However, validation of these models against the performance of the actual hardware controller is seldom provided. It is generally assumed that the performance of the model, based on the actual controller source code or, identical block-diagram, is the same as the hardware controller performance. However, this may not be acceptable to all end-users since the simulation platform and the hardware are two significantly different computing platforms. Validation via field tests is usually narrow in scope. The hardware-in-loop (HIL) validation using a real-time digital simulator is a well accepted, more flexible, and cost-effective method for a thorough validation. This paper presents the HIL validation of an EMT model of a PPC against its actual hardware controller.

关键词： Renewable energy sources Computational modeling source coding Hardware Inverters Real-time systems Delays

来源：评论

学校读者我要写书评

暂无评论

Tables for practical Wyner-Ziv coding of Laplacian sources

Tables for practical Wyner-Ziv coding of Laplacian sources

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Debargha Mukherjee HP Laboratories Palo Alto CA USA

Many practical coding scenarios deal with sources with transform coefficients that are well modeled as Laplacians. For the Wyner-Ziv coding problem for such sources when correlated side-information is available at the decoder, the side-information is modeled as obtained by independent additive Laplacian or Gaussian innovation on the source. This paper deals with the optimal choice of encoding parameters for practical Wyner-Ziv coding in such scenarios, using the same quantizer family as in the regular codec to cover a range of rate-distortion trade-offs, given the variances of the source and innovation. Using our prior analysis of a general encoding model based on multi-level coset codes combining source and channel coding, we present comprehensive tables with optimal encoding parameters. These tables can be readily incorporated into a practical codec to read off the encoding parameters.

关键词： Laplace equations Decoding Codecs Channel coding Technological innovation Entropy source coding Quadratic programming Laboratories Rate-distortion

来源：评论

学校读者我要写书评

暂无评论

Methods of Forming Learner Groups for Mutual Teaching among Leaners with Different Situations in Programming Exercise

Methods of Forming Learner Groups for Mutual Teaching among ...

引用

Computing (ICOCO), IEEE International Conference on

作者： Kota Tabei Hiroki Nakayama Ryo Onuma Hiroaki Kaminaga Youzou Miyadera Shoichi Nakamura Dept. Computer Science and Mathmatics Fukushima University 1 Kanayagawa Fukushima-shi Fukushima Japan Division of Natural Science Tokyo Gakugei University 4-1-1 Nukuikitamachi Koganei-shi Tokyo Japan

ISBN: (数字)9798331530303

ISBN: (纸本)9798331530310

In response to the growing demand for developing programming skills, opportunities for providing programming exercises have been increasing at educational institutions such as universities. Instructors must be attentive to learners’ progress and situations to provide effective support. However, there are limits to supporting a large number of learners by a small number of instructors. Peer or group-based learning has been recognized as a promising approach to address these challenges, but most existing methods rely on static group formation based on pre-exercise information. We developed methods for forming dynamic learning groups that leverage learners’ current situations for effective peer-assisted learning. This paper mainly describes the dynamic formation of learner groups taking into account multiple factors such as whether learners are struggling and the similarity between source codes. We also describe the experiments on forming learner groups and discuss the basic effectiveness of the proposed methods on the basis of the experimental results.

关键词： source coding Education Dynamic programming Programming profession

来源：评论

学校读者我要写书评

暂无评论

Binary-level Directed Symbolic Execution Through Pattern Learning

Binary-level Directed Symbolic Execution Through Pattern Lea...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Zhijie Zhang Liwei Chen Haolai Wei Guochao Dong Yuantong Zhang Xiaofan Nie Gang Shi Chinese Academy of Sciences Institute of Information Engineering Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Institute 706 Second Academy of China Aerospace and Industry Corporation Beijing China

Directed symbolic execution is an effective technique that tests specific parts of programs. It is widely used in various security tasks, for instance, patch testing, bug reproduction, and static report verification. However, existing works perform at the source level, while few works focus on the binary level as source codes of the security-critical program are not always available. In addition, current techniques at the source level migrating to the binary level introduce excessive overhead, thus exacerbating the scalability issues inherent in symbolic execution. In this paper, we propose a data-driven approach to enhance the efficiency of state selection strategies in binary-level directed symbolic execution, named DSyML. We leverage the supervised machine learning technique to learn how to approach target sites from the analysis of vulnerable paths to targets. Given a target site, we utilize the machine learning model to guide symbolic execution toward the specific target, generating an input that exercises the target. We evaluated DSyML on the Cyber Grand Challenge (CGC) dataset, which is a famous dataset containing abundant vulnerable programs. The experimental results demonstrate that DSyML outperforms both directed heuristic strategy(Director) and undirected data-driven strategy(SyML) in the majority of cases. DSyML triggered 6 more vulnerabilities than Director, 4 faster out of 5 vulnerabilities triggered together. In addition, out of 11 vulnerabilities for a given target, DSyML triggered 9 of them faster than SyML.

关键词： source coding Scalability Computer bugs Machine learning Probabilistic logic Classification algorithms Security

来源：评论

学校读者我要写书评

暂无评论

Non-Linear Index coding Outperforming the Linear Optimum

Non-Linear Index Coding Outperforming the Linear Optimum

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Eyal Lubetzky Uri Stav School of Mathematics Tel-Aviv University Tel-Aviv Israel School of Computer Science Tel-Aviv University Tel-Aviv Israel

The following source coding problem was introduced by Birk and Kol: a sender holds a word x epsi {0,1} n , and wishes to broadcast a codeword to n receivers, R 1 ,..., R n middot. The receiver R i is interested in x;, and has prior side information comprising some subset of the n bits. This corresponds to a directed graph G on n vertices, where ij is an edge iff R i knows the bit x j . An index code for G is an encoding scheme which enables each R i to always reconstruct Xj, given his side information. The minimal word length of an index code was studied by Bar-Yossef Birk, Jay ram and Kol. Thev introduced a graph parameter, minrk 2 (G), which completely characterizes the length of an optimal linear index code for G. The authors of (Z. Bar-Yossef, 2006) showed that in various cases linear codes attain the optimal word length, and conjectured that linear index coding is in fact always optimal. In this work, we disprove the main conjecture of (Z. Bar-Yossef, 2006) in the following strong sense: for any epsiv > 0 and sufficiently large n, there is an n-vertex graph G so that evety linear index code for G requires codewords of length at least n 1-epsiv and yet a non-linear index code for G has a word length of n epsiv . This is achieved by an explicit construction, which extends Alon's variant of the celebrated Ramsey construction of Frankl and Wilson.

关键词： source coding Broadcasting Computer science Mathematics Encoding Linear code Binary codes

来源：评论

学校读者我要写书评

暂无评论

A distributed constant bit rate Slepian-Wolf based multiple access scheme with nodes having common and correlated information

A distributed constant bit rate Slepian-Wolf based multiple ...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Arulsaravana Jeyaraj Magda El Zarki Dept. of EECS UC Irvine CA USA Dept. of ICS UC Irvine CA

Practical implementation of video compression for distributed sources is currently an active research area. The distributed compression paradigm based on the Slepian-Wolf model has been proposed for low-complexity video compression algorithms and energy efficient wireless sensor networks. In this paper, we consider a joint source-channel resource allocation for sensor network applications based on the Slepian-Wolf paradigm in fading channel environments. The sensor nodes are modeled as a multiuser uplink channel transmitting correlated information. We study an efficient distributed constant bit rate allocation scheme based on the Slepian-Wolf model operating in a multiaccess wireless channel.

关键词： Bit rate Wireless sensor networks Resource management source coding Video compression Fading Cross layer design Wireless communication IP networks Entropy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 471 472 473 474 475 476 477 478 479 480 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：