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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

91 篇 期刊文献
62 篇 会议
2 册 图书
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

101 篇 工学
- 48 篇 电气工程
- 44 篇 计算机科学与技术...
- 26 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 8 篇 软件工程
- 6 篇 控制科学与工程
- 5 篇 机械工程
- 5 篇 交通运输工程
- 3 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 生物医学工程（可授...
29 篇 教育学
- 21 篇 教育学
- 12 篇 心理学(可授教育学...
24 篇 理学
- 8 篇 数学
- 6 篇 生物学
- 4 篇 物理学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 生态学
14 篇 文学
- 10 篇 外国语言文学
- 5 篇 新闻传播学
14 篇 医学
- 9 篇 临床医学
- 5 篇 基础医学(可授医学...
- 3 篇 公共卫生与预防医...
13 篇 管理学
- 11 篇 管理科学与工程(可...
- 2 篇 公共管理
5 篇 法学
- 4 篇 社会学
- 1 篇 政治学
4 篇 农学
2 篇 经济学
- 2 篇 应用经济学
1 篇 哲学
- 1 篇 哲学
1 篇 艺术学

主题

157 篇 coding scheme
13 篇 encoding
11 篇 decoding
10 篇 channel coding
6 篇 channel capacity
5 篇 xml
5 篇 modulation
4 篇 file system 1.in...
4 篇 gaussian channel...
4 篇 optimisation
4 篇 codes
4 篇 receivers
4 篇 labeling scheme
4 篇 broadcast channe...
4 篇 awgn channels
3 篇 lt codes
3 篇 flash memories
3 篇 reliability
3 篇 mimo communicati...
3 篇 feedback

机构

3 篇 univ groningen f...
2 篇 ecole technol su...
2 篇 univ jyvaskyla m...
2 篇 univ jyvaskyla a...
2 篇 harbin inst tech...
2 篇 faculty of infor...
2 篇 def sci & techno...
2 篇 univ chinese aca...
2 篇 hunan university...
2 篇 univ valencia fa...
2 篇 univ calif san d...
2 篇 department of el...
1 篇 zagazig univ fac...
1 篇 department of el...
1 篇 iowa state univ ...
1 篇 birmingham child...
1 篇 univ queensland ...
1 篇 technion israel ...
1 篇 univ warwick com...
1 篇 univ malaga dept...

作者

4 篇 maes bea
4 篇 dhondt ann
4 篇 van der putten a...
4 篇 van keer ines
3 篇 xiao ke
3 篇 yaakobi eitan
2 篇 li zhijun
2 篇 lehtinen esa
2 篇 chen gaowei
2 篇 perea manuel
2 篇 jie deng
2 篇 parzysz fanny
2 篇 ioannou andri
2 篇 nissi riikka
2 篇 siegel paul h.
2 篇 chen yi
2 篇 he hao
2 篇 chen yongrui
2 篇 khisti ashish
2 篇 wolf jack k.

语言

153 篇 英文
2 篇 其他
2 篇 中文
1 篇 德文

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

共 157 条记录，以下是121-130 订阅

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

详细简洁

排序：

Simulation of a Memristor-Based Spiking Neural Network Immune to Device Variations

Simulation of a Memristor-Based Spiking Neural Network Immun...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Querlioz, Damien Bichler, Olivier Gamrat, Christian Univ Paris 11 CNRS Inst Elect Fondamentale Bat 425 F-91405 Orsay France CEA LIST Embedded Comp Lab F-91191 Gif Sur Yvette France

ISBN: (纸本)9781424496365

We propose a design methodology to exploit adaptive nanodevices (memristors), virtually immune to their variability. Memristors are used as synapses in a spiking neural network performing unsupervised learning. The memristors learn through an adaptation of spike timing dependent plasticity. Neurons' threshold is adjusted following a homeostasis-type rule. System level simulations on a textbook case show that performance can compare with traditional supervised networks of similar complexity. They also show the system can retain functionality with extreme variations of various memristors' parameters, thanks to the robustness of the scheme, its unsupervised nature, and the power of homeostasis. Additionally the network can adjust to stimuli presented with different coding schemes.

关键词： Biological neural networks CMOS integrated circuits Memristors Nanoscale devices Neuromorphics Neurons Robustness adaptive nanodevice coding scheme device variation encoding homeostasis-type rule memristor memristors nanoelectronics neural nets plasticity spike timing dependent plasticity spiking neural network synapses system level simulation unsupervised learning unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Persistent Scheduling in Two-hop Relay Networks

Optimizing the Persistent Scheduling in Two-hop Relay Networ...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Kim, Seong Hwan Jin, Hu Sung, Dan Keun Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea

ISBN: (纸本)9781612842547

We propose two scheduling protocols which are applicable to two-hop relay networks based on mobile WiMAX system: the first protocol adopts a persistent scheduling (PS) scheme in both hops, called the PS-PS protocol, while the second protocol adopts the PS scheme only in the first hop and the dynamic scheduling (DS) scheme in the second hop, called the PS-DS protocol. We optimize the above two protocols by minimizing their average resource usage (ARU) through appropriate selection of the modulation and coding scheme (MCS) level for given delay and packet error requirements. Taking into account different characteristics in both a source-relay (SR) link and a relay-destination (RD) link, resource usage due to hybrid automatic repeat request (HARQ) retransmissions, and the accompanying signaling overhead, we compare the performance of the proposed optimization methods with that of the conventional method in terms of ARU. The PS-PS protocol outperforms the PS-DS protocol and the conventional method considered in most channel case, while the PS-DS protocol outperforms other schemes in a harsh channel condition.

关键词： Decoding Dynamic scheduling PS-DS protocol PS-PS protocol Protocols Relays Signal to noise ratio Strontium WiMAX WiMax automatic repeat request average resource usage coding scheme dynamic scheduling harsh channel condition hybrid automatic repeat request retransmissions mobile WiMAX system mobile radio modulation scheme optimisation optimization methods packet error requirements packet radio networks persistent scheduling protocols relay-destination link scheduling scheduling protocols signaling overhead source-relay link two-hop relay networks wireless channels

来源：评论

学校读者我要写书评

暂无评论

Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

Minimization of Storage Cost in Distributed Storage Systems ...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Yu, Quan Shum, Kenneth W. Sung, Chi Wan City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China City Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424492688

In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established.

关键词： Distributed databases Linear programming Maintenance engineering Minimization Network coding Peer to peer computing Resource management coding scheme data storage cost distributed storage systems flow graphs information flow graph linear programming linear programming problem network coding protocol repair consideration repair-bandwidth

来源：评论

学校读者我要写书评

暂无评论

Rateless Codes for Slant Path Free Space Optical Channels

Rateless Codes for Slant Path Free Space Optical Channels

引用

Globecom Workshops

作者： Liu, Ling Dang, Anhong Guo, Hong Peking Univ Sch Elect & Comp Sci Beijing 100871 Peoples R China

ISBN: (纸本)9781424488650

The application of packet-level rateless codes for slant path free space optical (FSO) links is studied. From the compromise between the code rate and decoding complexity, the raptor codes with moderate block length is considered and the corresponding coding scheme is presented. Two decoding strategies are discussed: maximum-likelihood (ML) decoding and erasure decoding. The decoding performance for these two decoding strategies is compared by calculating their error exponents, and erasure decoding is illustrated to work better in view of reliability. Numerical results indicate that our considered rateless codes with such erasure decoding can always automatically achieve the code rate very close to channel capacity for the slant path FSO links.

关键词： block codes block length channel capacity channel capacity code rate coding scheme decoding complexity decoding performance erasure decoding maximum likelihood decoding maximum-likelihood decoding optical links packet-level rateless code raptor code relia

来源：评论

学校读者我要写书评

暂无评论

Semi-Deterministic Broadcast Channels with Cooperation 28

Semi-Deterministic Broadcast Channels with Cooperation

引用

IEEE 28th Convention of Electrical and Electronics Engineers in Israel (IEEEI)

作者： Goldfeld, Ziv Permuter, Haim H. Kramer, Gerhard Ben Gurion Univ Negev IL-84105 Beer Sheva Israel Tech Univ Munich D-80290 Munich Germany

ISBN: (纸本)9781479959877

The semi-deterministic broadcast channel (BC) where the decoders may cooperate via a finite-capacity one-sided link is considered. The capacity region is derived via a novel converse that uses a probabilistic construction of auxiliary random variables that depends on the distribution induced by the codebook. Achievability is established by providing a coding scheme that incorporates techniques such as rate-splitting and Marton coding with a Wyner-Ziv-like coding mechanism that optimally leverages the cooperation link. The BC is shown to be operationally equivalent to a certain class of relay-broadcast channels (RBCs) and the correspondence between their capacity regions is established.

关键词： broadcast channels channel capacity cooperative communication decoding probability relay networks (telecommunication) Marton coding RBC Wyner-Ziv-like coding auxiliary random variables capacity region codebook coding scheme cooperation link decoders finite-capacity one-sided link probabilistic construction rate-splitting relay-broadcast channels semideterministic broadcast channels Decoding Encoding Joints Probabilistic logic Random variables Relays Upper bound

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of UWB using Compressed Sensing in Multipath Channel Estimations

Performance Evaluation of UWB using Compressed Sensing in Mu...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Chen, Shao-Yuan Stark, Wayne E. Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9781424492688

We consider the problem of channel estimation for ultrawideband communication in a multipath channel using compressed sensing techniques. The receiver when using a compressed sensing approach consists of a number of correlators processing the received signal with random projection vectors. The theory is based on Gaussian distributed vectors. We have compared the performance of using orthogonal Hadamard vectors with that of using a random projection matrix in compressed sensing procedures. We have also compared the performance of systems with different parameters for Gaussian and Hadamard projections vectors such as number of pilots, number of projection vectors and different coding schemes. Moreover, we are investigating different receiver structures resulting in different complexity of the receivers. We show that the sampling rate can be reduced significantly with only a slight degradation in the performance.

关键词： Bit error rate Channel estimation Correlators Error correction Gaussian distributed vector Gaussian processes Gaussian projections vector Hadamard matrices Hadamard projections vector Matching pursuit algorithms Multipath channels Receivers UWB channel estimation coding scheme compressed sensing technique correlators processing multipath channel estimation orthogonal Hadamard vector performance evaluation radio receivers random projection matrix random projection vector receiver complexity receiver structure sampling rate ultra wideband communication ultrawideband communication vectors

来源：评论

学校读者我要写书评

暂无评论

A Design Space for Engineering Graphical Adaptive Menus 16

A Design Space for Engineering Graphical Adaptive Menus

引用

8th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS)

作者： Bouzit, Sara Calvary, Gaelle Chene, Denis Vanderdonckt, Jean Orange Labs 28 Chemin Vieux Chene F-38240 Meylan France Univ Grenoble Alpes LIG DNRS F-38000 Grenoble France Catholic Univ Louvain Louvain Sch Management Louvain Interact Lab B-1348 Louvain La Neuve Belgium

ISBN: (纸本)9781450343220

This paper presents a design space for exploring design options of adaptive graphical menus based on Bertin's eight visual variables: position, size, shape, value, color, orientation, texture, and motion. In order to transfoun a traditional (static) menu into an adaptive one, at least one visual variable should be exploited to convey which menu items have been promoted or demoted depending on five characteristics: select, associative, quantitative, order, and length. The paper reviews selected adaptive menu interaction techniques belonging to each of these variables, classifies them according to the variables and characteristics and suggests not yet explored adaptive menu designs. It then defines four stability properties depending on which variables remain constant after adaptivity. A supporting software for prototyping the rendering of graphical adaptive menus is then introduced.

关键词： Adaptation adaptive menu coding scheme prediction window stability property visual variable

来源：评论

学校读者我要写书评

暂无评论

On a capacity achieving scheme for the colored Gaussian channel with feedback

On a capacity achieving scheme for the colored Gaussian chan...

引用

IEEE International Symposium on Information Theory

作者： Shahar-Doron, A Feder, M Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel

ISBN: (纸本)0780382803

A coding scheme with feedback for the colored Gaussian noise channel, extending the earlier schemes of Schalkijk and Butman is discussed. By showing a relation between the scheme parameters and the capacity formula we show that this scheme can achieve the channel capacity in its optimal configuration. Using suboptimal configurations, a series of lower bounds for the feedback channel capacity can be constructed.

关键词： Gaussian noise feedback Gaussian channels channel capacity channel coding colored Gaussian noise channel capacity feedback channel coding scheme channel configuration

来源：评论

学校读者我要写书评

暂无评论

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate

Codes for Computationally Simple Channels: Explicit Construc...

引用

IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)

作者： Guruswami, Venkatesan Smith, Adam Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Penn State Univ Comp Sci & Engn Dept University Pk PA 16802 USA

ISBN: (纸本)9780769542447

In this paper, we consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter p and (b) the process which adds the errors can be described by a sufficiently "simple" circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. For three classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. Unique decoding for additive errors: We give the first construction of a poly-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity 1 - H(p). List-decoding for online log-space channels: We give an efficient code with optimal rate (arbitrarily close to 1 H( p)) that recovers a short list containing the correct message with high probability for channels which read and modify the transmitted codeword as a stream, using at most O(log N) bits of workspace on transmissions of N bits. List-decoding for poly-time channels: For any constant c we give a similar list-decoding result for channels describable by circuits of size at most N-c, assuming the existence of pseudorandom generators.

关键词： Shannon capacity adversarial errors channel coding coding scheme coding theory communication complexity computationally bounded channel computationally bounded channels decoding error correction codes explicit constructions information theory list decoding message passing online logspace channel polytime encodable code pseudorandom generator pseudorandomness unique decoding

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limits of Caching: Symmetry Structure and Coded Placement schemes

Fundamental Limits of Caching: Symmetry Structure and Coded ...

引用

作者： Zhang, Kai Texas A&M University

学位级别：Ph.D., Doctor of Philosophy

Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. In 2014, Maddah-Ali and Niesen introduced a framework for coded caching, and showed that significant improvement can be obtained compared to uncoded caching. Considerable efforts have been devoted to identify the precise information theoretic fundamental limit of such systems, however the difficulty of this task has also become clear. One of the reasons for this difficulty is that the original coded caching setting allows multiple demand types during delivery, which in fact introduces tension in the coding strategy to accommodate all of them. We seek to develop a better understanding of the fundamental limit of coded caching. In order to characterize the fundamental limit of the tradeoff between the amount of cache memory and the delivery transmission rate of multiuser caching systems, various coding schemes have been proposed in the literature. These schemes can largely be categorized into two classes, namely uncoded prefetching schemes and coded prefetching schemes. While uncoded prefetching schemes in general over order-wise optimal performance, coded prefetching schemes often have better performance at the low cache memory regime. At first sight it seems impossible to connect these two different types of coding schemes, yet finding a unified coding scheme that achieves the optimal memory-rate tradeoff is an important and interesting problem. We take the first step on this direction and provide a connection between the uncoded prefetching scheme proposed by Maddah Ali and Niesen (and its improved version by Yu et al.) and the coded prefetching scheme proposed by Tian and Chen. The intermediate operating points of this general scheme can in fact provide new memory-rate tradeoff points previously not known to be achievable in the literature. This new general coding scheme is then presented and analyzed rigorously, which yields a new inner bound to th

关键词： Caching network Linear Programming Symmetry structure coding scheme Fundamental limit Uncoded prefetching

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：