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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

5,594 篇 source coding
1,266 篇 decoding
657 篇 codes
603 篇 channel coding
416 篇 rate-distortion
380 篇 entropy
342 篇 random variables
291 篇 image coding
271 篇 data compression
249 篇 software
235 篇 training
224 篇 computational mo...
218 篇 semantics
205 篇 video coding
198 篇 encoding
190 篇 quantization
188 篇 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,540 篇 英文
45 篇 其他
8 篇 中文
1 篇 俄文

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

共 5594 条记录，以下是4731-4740 订阅

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

详细简洁

排序：

Analytic algorithmics, combinatorics, and information theory

Analytic algorithmics, combinatorics, and information theory

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： W. Szpankowski Department of Computer Science Purdue University West Lafayette IN USA

Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's and Knuth's precept, we tackle these problems by complex analysis methods such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and de-poissonization, and singularity analysis. This approach lies at the crossroad of computer science and information theory. In this talk, we concentrate on one facet of information theory (i.e., source coding better known as data compression), namely the redundancy rate problem and types. The redundancy rate problem for a class of sources is the determination of how far the actual code length exceeds the optimal (ideal) code length. The method of types is a powerful technique in information theory, large deviations, and analysis of algorithms. It reduces calculations of the probability of rare events to a combinatorial analysis. Two sequences are of the same type if they have the same empirical distribution. We shall argue that counting types can be accomplished efficiently by enumerating Eulerian paths (Markov types) or binary trees with a given path length (universal types). On the other hand, analysis of the redundancy rate problem for memoryless and Markov sources leads us to tree generating functions (e.g., arising in counting labeled rooted trees) studied extensively in computer science.

关键词： Information analysis Algorithm design and analysis Combinatorial mathematics Information theory Computer science Fourier transforms Fourier series source coding Data compression Probability

来源：评论

学校读者我要写书评

暂无评论

Adaptive Nonasymmetric Slepian-Wolf Decoding using Particle Filtering based Belief Propagation

Adaptive Nonasymmetric Slepian-Wolf Decoding using Particle ...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Samuel Cheng Shuang Wang Lijuan Cui School of Electrical and Computer Engineering University of Oklahoma Tulsa OK 74135

ISBN: (纸本)9781424442959

A major difficulty that plagues the practical use of Slepian-Wolf coding (and distributed source coding in general) is that the precise correlation among sources need to be known a priori. To resolve this problem, we have proposed an adaptive asymmetric Slepian-Wolf decoding scheme using particle filtering based belief propagation in our recent work. In this paper, we extend the adaptive scheme to the non-asymmetric setup based on the code partitioning approach. We show through experiments that the proposed algorithm can simultaneously reconstruct the compressed sources and estimate the joint correlation among sources. Further, comparing to the conventional Slepian-Wolf decoder based on standard belief propagation, the proposed approach can achieve higher compression under varying correlation statistics.

关键词： Adaptive decoding Distributed algorithms source coding Data compression

来源：评论

学校读者我要写书评

暂无评论

Secure lossy transmission of vector Gaussian sources

Secure lossy transmission of vector Gaussian sources

引用

IEEE International Symposium on Information Theory

作者： Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland College Park MD USA

We study the secure lossy transmission of a Gaussian vector source to a legitimate user in the presence of an eaves-dropper, where both the legitimate user and the eavesdropper have Gaussian vector side information. The transmitter describes the source to the legitimate user in a way that the legitimate user can reconstruct the source within a certain distortion while the eavesdropper is kept ignorant of the source as much as possible. We obtain an outer bound for the rate, equivocation and distortion region of this secure lossy transmission problem. This outer bound is tight when the transmission rate constraint is removed. In other words, we obtain the maximum equivocation at the eavesdropper when the legitimate user needs to reconstruct the source within a fixed distortion level while there is no constraint on the transmission rate.

关键词： Markov processes Mutual information Optimization source coding Transmitters Covariance matrix Rate distortion theory

来源：评论

学校读者我要写书评

暂无评论

The finite field multi-way relay channel with correlated sources: Beyond three users

The finite field multi-way relay channel with correlated sou...

引用

IEEE International Symposium on Information Theory

作者： Lawrence Ong Roy Timo Sarah J. Johnson School of Electrical Engineering and Computer Science University of Newcastle Australia Institute for Telecommunications Research University of South Australia Australia

ISBN: (纸本)9781467325806

The multi-way relay channel (MWRC) models cooperative communication networks in which many users exchange messages via a relay. In this paper, we consider the finite field MWRC with correlated messages. The problem is to find all achievable rates, defined as the number of channel uses required per reliable exchange of message tuple. For the case of three users, we have previously established that for a special class of source distributions, the set of all achievable rates can be found [Ong et al., ISIT 2010]. The class is specified by an almost balanced conditional mutual information (ABCMI) condition. In this paper, we first generalize the ABCMI condition to the case of more than three users. We then show that if the sources satisfy the ABCMI condition, then the set of all achievable rates is found and can be attained using a separate source-channel coding architecture.

关键词： Relays Channel coding Atomic measurements Random variables Mutual information source coding

来源：评论

学校读者我要写书评

暂无评论

Lattice quantized coded modulation

Lattice quantized coded modulation

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： N. Minami K. Wakasugi M. Kasahara S. Tazaki Department of Electrical and Electronic Engineering Ehime University Matsuyama Japan Department of Electronic and Information Science Kyoto Institute of Technology Kyoto Japan

A combined coding scheme that unifies the lattice based source coding and the coded modulation is discussed. To reduce the average power of modulation, we propose both the direct and degenerate mapping methods. Assuming an image data model, we have evaluated the performance of both mapping methods. For the degenerate mapping method, the image SNR can be improved by approximately 6 dB as compared to the non mapping in a certain range of CNR. We have also evaluated the proposed scheme performance based on a combination of E/sub 8/ or /spl Lambda//sub 16/ lattice and a 256 QAM modulator by using the standard image data. From the results, a gain of approximately 10 dB can be achieved for the direct mapping method, and 6 dB for the degenerate mapping method with a relatively small mapping table. We should note that the maximum likelihood decoding algorithm can be easily applied, since the proposed encoding scheme still preserves the lattice structure. We have derived an optimal mapping by using a simulated annealing method for the degenerate mapping method. An extra gain of /spl sime/1 dB compared to the normal mapping method is obtained.

关键词： Lattices Modulation coding source coding Frequency Data models Simulated annealing Vectors Channel coding Information science Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Compress-forward relaying with quantized channel state feedback

Compress-forward relaying with quantized channel state feedb...

引用

Asilomar Conference on Signals, Systems & Computers

作者： Sha Yao Mikael Skoglund School of Electrical Engineering and ACCESS Linnaeus Center Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9781424458257

We consider a three-node slowly fading relay channel with a half-duplex relay node. Under short-term power constraints in the source and relay, we investigate the outage exponent of compress-forward relaying with quantized feedback of channel state information from the destination to the relay. In this initial work on this problem, Wyner-Ziv coding is not used at the relay. We show that with only 2-bit of feedback information, most of the gains from knowing the channel state can be obtained.

关键词： Relays State feedback OFDM modulation Fading Channel state information Hydrogen source coding Channel capacity Decoding Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Fanet: Feature Amplification Network for Semantic Segmentation in Cluttered Background

Fanet: Feature Amplification Network for Semantic Segmentati...

引用

IEEE International Conference on Image Processing

作者： Muhammad Ali Mamoona Javaid Mubashir Noman Mustansar Fiaz Salman Khan MBZUAI UAE Institute of Space Technology Pakistan IBM Research

ISBN: (数字)9798350349399

ISBN: (纸本)9798350349405

Existing deep learning approaches leave out the semantic cues that are crucial in semantic segmentation present in complex scenarios including cluttered backgrounds and translucent objects, etc. To handle these challenges, we propose a feature amplification network (FANet) as a backbone network that incorporates semantic information using a novel feature enhancement module at multi-stages. To achieve this, we propose an adaptive feature enhancement (AFE) block that benefits from both a spatial context module (SCM) and a feature refinement module (FRM) in a parallel fashion. SCM aims to exploit larger kernel leverages for the increased receptive field to handle scale variations in the scene. Whereas our novel FRM is responsible for generating semantic cues that can capture both low-frequency and high-frequency regions for better segmentation tasks. We perform experiments over challenging real-world ZeroWaste-f [1] dataset which contains background-cluttered and translucent objects. Our experimental results demonstrate the state-of-the-art performance compared to existing methods. The source code can be found at https://***/techmn/fanet.

关键词： Deep learning Semantic segmentation source coding Semantics Task analysis Kernel

来源：评论

学校读者我要写书评

暂无评论

On the variance and the probability of length overflow of lossless codes

On the variance and the probability of length overflow of lo...

引用

IEEE International Symposium on Information Theory

作者： R. Nomura T. Matsushima S. Hirasawa Waseda University Shinjuku Tokyo Japan Aaseda University Shinjuku Tokyo Japan

In this paper, we show the probability of length overflow of several codes by using the variance and the asymptotic normality of the codelength.

关键词： source coding Probability distribution Art

来源：评论

学校读者我要写书评

暂无评论

Embedded Operating System Memory-Related Vulnerabilities Detection Based on Taint Analysis and Graph Neural Networks

Embedded Operating System Memory-Related Vulnerabilities Det...

引用

Frontiers Technology of Information and Computer (ICFTIC), IEEE International Conference on

作者： Bin Wei Xiangji Xi Zishuai Wu Yanyun Lu Chang Guo Zhenfeng Li Beijing Smartchip Microelectronics Technology Co. Ltd. Beijing China Institute of Microelectronics of The Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Institute of Microelectronics of The Chinese Academy of Sciences Beijing China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

Embedded operating systems are highly customizable, with limited public information and severe security vulnerabilities. Among the vulnerabilities, one-third are memory-related. Traditional detection methods are inefficient and costly for addressing these vulnerabilities. Deep learning-based approaches may cause information loss or introduce irrelevant noise during the code representation process. Moreover, memory-related vulnerability patches are often very similar to the source code, making it difficult to represent vulnerability features. To address these issues, this paper proposes a graph neural network-based detection method using taint analysis. By tracking and slicing the representation graph based on taint information, the method can expand effective graph information and remove irrelevant noise. Experimental results show this method achieves an F1 score of 81.82% on an embedded OS memory-related Vulnerability dataset.

关键词： Analytical models Filters Operating systems source coding Computational modeling Noise Refining Graph neural networks Security Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Prompt a Robot to Walk with Large Language Models

Prompt a Robot to Walk with Large Language Models

引用

IEEE Conference on Decision and Control

作者： Yen-Jen Wang Bike Zhang Jianyu Chen Koushil Sreenath University of California Berkeley Institute for Interdisciplinary Information Sciences Tsinghua University Shanghai Qi Zhi Institute

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Large language models (LLMs) pre-trained on vast internet-scale data have showcased remarkable capabilities across diverse domains. Recently, there has been escalating interest in deploying LLMs for robotics, aiming to harness the power of foundation models in real-world settings. However, this approach faces significant challenges, particularly in grounding these models in the physical world and in generating dynamic robot motions. To address these issues, we introduce a novel paradigm in which we use few-shot prompts collected from the physical environment, enabling the LLM to autoregressively predict low-level control actions for robots without task-specific fine-tuning. We utilize LLMs as a controller, diverging from the conventional approach of employing them primarily as planners. Simulation experiments across various robots and environments validate that our method can effectively prompt a robot to walk. We thus illustrate how LLMs can function as low-level feedback controllers for dynamic motion control, even in high-dimensional robotic systems. The project website and source code can be found at: ***.

关键词： Legged locomotion Robot motion Grounding Large language models source coding Dynamics Motion control Adaptive control Robots Physics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：