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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

83 篇 期刊文献
27 篇 会议

馆藏范围

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

日期分布

学科分类号

107 篇 工学
- 90 篇 电气工程
- 31 篇 电子科学与技术（可...
- 26 篇 计算机科学与技术...
- 19 篇 信息与通信工程
- 8 篇 控制科学与工程
- 5 篇 仪器科学与技术
- 4 篇 交通运输工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 石油与天然气工程
- 1 篇 生物医学工程（可授...
- 1 篇 软件工程
12 篇 医学
- 10 篇 临床医学
- 1 篇 基础医学(可授医学...
10 篇 理学
- 4 篇 物理学
- 4 篇 系统科学
- 2 篇 数学
- 1 篇 生物学

主题

110 篇 computational co...
59 篇 computational co...
9 篇 interference sup...
8 篇 filtering theory
8 篇 ofdm
7 篇 ofdm modulation
7 篇 communication co...
6 篇 video coding
6 篇 mimo communicati...
6 篇 feedback
6 篇 iterative method...
6 篇 array signal pro...
6 篇 matrix algebra
6 篇 search problems
5 篇 motion estimatio...
5 篇 signal processin...
5 篇 optimisation
5 篇 resource allocat...
5 篇 radiofrequency i...
5 篇 cooperative comm...

机构

2 篇 nagoya univ grad...
2 篇 indian inst tech...
2 篇 nanyang technol ...
2 篇 mie univ grad sc...
1 篇 beihang univ res...
1 篇 sharif univ tech...
1 篇 british telecom ...
1 篇 southern marine ...
1 篇 department of te...
1 篇 new jersey inst ...
1 篇 natl def managem...
1 篇 dharmsinh desai ...
1 篇 pontifical catho...
1 篇 singapore inst t...
1 篇 univ calif davis...
1 篇 dept.of electric...
1 篇 infinera unipess...
1 篇 univ fed lavras ...
1 篇 indian inst info...
1 篇 gwangju inst sci...

作者

2 篇 nogueira fernand...
2 篇 kitaoka norihide
2 篇 nishino takanori
2 篇 kondo kazunobu
2 篇 higuchi kenichi
2 篇 mizuno yusuke
2 篇 de aguiar eduard...
2 篇 vellasco marley ...
2 篇 takeda kazuya
1 篇 syahali syabeela
1 篇 miranda md
1 篇 kim sooyoung
1 篇 cui jianhua
1 篇 singh bhim
1 篇 adzic velibor
1 篇 deman h
1 篇 zhu yuesheng
1 篇 golestani hossei...
1 篇 zhu xun-lin
1 篇 dwyer vm

语言

107 篇 英文
3 篇 其他

检索条件"主题词=computational complexity reduction"

共 110 条记录，以下是91-100 订阅

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

详细简洁

排序：

A Study on Low-complexity Receiver of NCSP-OFDM for Sidelobe Suppression 5

A Study on Low-Complexity Receiver of NCSP-OFDM for Sidelobe...

引用

5th IEEE Global Conference on Consumer Electronics

作者： Kawasaki, Hikaru Doi, Hideo Ohta, Masaya Yamashita, Katsumi Osaka Prefecture Univ Grad Sch Engn Naka Ku 1-1 Gakuencho Sakai Osaka 5998531 Japan

ISBN: (纸本)9781509023332

N-continuous symbol padding orthogonal frequency division multiplexing (NCSP-OFDM) is a modulation technique for sidelobe suppression, which adds the correction symbol only into the guard interval to enable the seamless connection of OFDM symbols. NCSP-OFDM requires the calculation of an inverse matrix per channel estimation, and so its computational complexity is large. This paper considers low-complexity receivers of the NCSP-OFDM. Numerical experiments are conducted to evaluate its performance compared with conventional NCSP-OFDM receiver.

关键词： OFDM N-continuous Symbol Padding OFDM sidelobe suppression computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

A fast motion estimation using a three-dimensional reference motion vector

A fast motion estimation using a three-dimensional reference...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Lai, KC Wong, SC Hong Kong Polytech Univ Ctr Multimedia Signal Proc Dept Elect & Informat Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)0780374029

Based on a study of the motion vector (MV) obtained by the Full Search algorithm among several test sequences, we found that the prediction process for motion estimation in many existing algorithms are not optimal. We optimize the prediction process by classifying the blocks into four different classes based on a newly proposed three-dimensional reference MV. Different search patterns and strategies are used for each class. The proposed algorithm can improve computation requirement as high as 43.9% than the diamond search algorithm.

关键词： motion estimation video coding search problems image sequences fast motion estimation three-dimensional reference motion vector 3D reference motion vector full search algorithm test sequences prediction process diamond search algorithm video compression standard computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

FAST AND HIGH-QUALITY SINGING VOICE SYNTHESIS SYSTEM BASED ON CONVOLUTIONAL NEURAL NETWORKS

FAST AND HIGH-QUALITY SINGING VOICE SYNTHESIS SYSTEM BASED O...

引用

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

作者： Nakamura, Kazuhiro Takaki, Shinji Hashimoto, Kei Oura, Keiichiro Nankaku, Yoshihiko Tokuda, Keiichi Technospeech Inc Dept Res & Dev Nagoya Aichi Japan Nagoya Inst Technol Dept Comp Sci Nagoya Aichi Japan

ISBN: (纸本)9781509066315

The present paper describes singing voice synthesis based on convolutional neural networks (CNNs). Singing voice synthesis systems based on deep neural networks (DNNs) are currently being proposed and are improving the naturalness of synthesized singing voices. As singing voices represent a rich form of expression, a powerful technique to model them accurately is required. In the proposed technique, long-term dependencies of singing voices are modeled by CNNs. An acoustic feature sequence is generated for each segment that consists of long-term frames, and a natural trajectory is obtained without the parameter generation algorithm. Furthermore, a computational complexity reduction technique, which drives the DNNs in different time units depending on type of musical score features, is proposed. Experimental results show that the proposed method can synthesize natural sounding singing voices much faster than the conventional method.

关键词： Singing voice synthesis statistical model acoustic modeling convolutional neural network computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Optimizing Deep Learning-based Failure Management in Optical Networks by Monitoring Relative Neural Activity

Optimizing Deep Learning-based Failure Management in Optical...

引用

International Conference on Optical Network Design and Modeling (ONDM)

作者： Khan, Lareb Zar Pedro, Joao Ayoub, Omran Costa, Nelson Sgambelluri, Andrea De Marinis, Lorenzo Napoli, Antonio Sambo, Nicola Scuola Super Sant Anna Pisa Italy Infinera Unipessoal Lda Lisbon Portugal IST Inst Telecomunicacoes Aveiro Portugal Univ Appl Sci Southern Switzerland Manno Switzerland Infinera Munich Germany

ISBN: (纸本)9783903176621;9798350351132

Despite demonstrating exceptional performance in optical networks, neural networks often receive criticism due to their significant computational complexity. To address this, we propose a novel relative-neural-activity-based algorithm to optimize neural networks for low computational complexity and memory footprint for failure management in optical networks, with failure identification as the considered use-case. The results suggest up to 96.31% and 87.12% reduction in computational and memory requirements, respectively.

关键词： Neural networks computational complexity reduction failure identification relative neural activity

来源：评论

学校读者我要写书评

暂无评论

Asterism decoding for layered space-time systems using 8PSK

Asterism decoding for layered space-time systems using 8PSK

引用

IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

作者： Conder, P Wysocki, TA Univ Wollongong Telecommun & Informat Technol Res Inst Wollongong NSW 2500 Australia

ISBN: (纸本)0780382196

The area of Layered Space-Time (LST) systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using Multiple Transmit and Receive antennas. The optimal detection strategy for a LST receiver is to perform a Maximum-Likelihood (ML) search over all possible transmitted symbol combinations has an exponential complexity when the constellation size of number of transmit antennas increase. While sub-optimal decoders, such as VBLAST, provide linear decoding only where the number of receive antennas is at least equal to the number of transmit antennas. The decoding scheme proposed in this paper, called Asterism decoding, looks for a more efficient way of finding the ML solution by first considering the case of multiple transmit antennas and a single receive antenna. The decoder is then extended to achieve ML like performance for any number of receive antennas. It further shows that Asterism decoding has at least an approximate order of magnitude reduction in computational complexity when compared to ML decoding. Asterism decoding is the first lower complexity decoder that achieves ML-like performance for systems where the number of receive antennas is less than the number of transmit antennas without the additional use of error coding.

关键词： maximum likelihood decoding array signal processing phase shift keying Asterism decoding layered space-time systems 8PSK LST receiver maximum-likelihood search multiple transmit/receive antennas transmitted symbol combinations transmit antenna constellation size computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

A Perpetual Code for Network Coding 79

A Perpetual Code for Network Coding

引用

IEEE 79th Vehicular Technology Conference (VTC-Spring)

作者： Heide, Janus Pedersen, Morten V. Fitzek, Frank H. P. Medard, Muriel Aalborg Univ Fac Sci & Engn Aalborg Denmark MIT Cambridge MA 02139 USA

ISBN: (纸本)9781479944828

Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the coding vector. This adds to the overall energy consumption and is problematic for computational limited and battery driven platforms. In this work we present an approach to RLNC where the code is sparse and non-uniform. The sparsity allow for fast encoding and decoding, and the non-uniform protection of symbols enables recoding where the produced symbols are indistinguishable from those encoded at the source. The results show that the approach presented here provides a better trade-off between coding throughput and code overhead. In particular it can provide a coding overhead identical to RLNC but at significantly reduced computational complexity. It also allow for easy adjustment of this trade-off, which make it suitable for a broad range of platforms and applications. Finally it is easy to perform recoding and coding vectors can be efficiently represented.

关键词： computational complexity decoding linear codes network coding random codes RLNC computational complexity reduction energy consumption perpetual code random linear network coding vector recoding throughput sparse code overhead symbol nonuniform protection complexity theory Decoding Encoding Equations Finite element analysis Matrices Vectors DECODING complexity classes random codes Network coding complexity theory linear codes energy consumption matrices Finite element method coding Codes

来源：评论

学校读者我要写书评

暂无评论

Digital audio codec based on the improved optimization algorithm of adaptive wavelets and dynamic bits allocation scheme

Digital audio codec based on the improved optimization algor...

引用

3rd International Conference on Signal Processing (ICSP 96)

作者： Xiong, XB Zhao, EY Department of Telecommunications Engineering Beijing University슠of Posts and슠Telecommunications

ISBN: (纸本)7505338900

This paper presents the idea of optimization algorithm of adaptive wavelets that can improve the coding algorithm to decrease the computation complexity to ten percent of that presented in the paper[5]. The full optimization of adaptive wavelets is replaced by the new method, in which the optimization is divided into two cascaded steps. And the entropy-coding-based quantization of side information is adopted so that tile bit rate is significantly reduced because it accounts for a plenty of percent of bit costs. The bit rate can decrease about 15 percent of that presented ill paper [8] by taking the method. It also coordinates with psycho-acoustics model and dynamic bits allocation scheme to make the coding noise inaudible under the condition of the least bits cost.

关键词： digital communication codecs audio coding entropy codes quantisation (signal) adaptive signal processing wavelet transforms optimisation computational complexity digital audio codec optimization algorithm adaptive wavelets dynamic bit allocation coding algorithm computational complexity reduction entropy coding based quantization side information bit rate reduction psychoacoustics model coding noise bit costs

来源：评论

学校读者我要写书评

暂无评论

FAST SOURCE SEPARATION BASED ON SELECTION OF EFFECTIVE TEMPORAL FRAMES

FAST SOURCE SEPARATION BASED ON SELECTION OF EFFECTIVE TEMPO...

引用

20th European Signal Processing Conference (EUSIPCO)

作者： Mizuno, Yusuke Kondo, Kazunobu Nishino, Takanori Kitaoka, Norihide Takeda, Kazuya Nagoya Univ Grad Sch Informat Sci Nagoya Aichi 4648603 Japan Yamaha Corp Corp Res & Dev Ctr Shizuoka 4380192 Japan Mie Univ Grad Sch Engn Tsu Mie 5148507 Japan

ISBN: (纸本)9781467310680

A faster computational method for performing frequency domain independent component analysis (FDICA) using a dodecahedral microphone array is proposed. Source separation with FDICA uses the spectrum of observed signals and estimates separation filters for each frequency. However, this technique is complex and requires high computational resources. In this paper, a method of selecting temporal frames which are effective for training the separation filters is proposed and evaluated. The log power spectrum and the kurtosis of amplitude distribution are employed as selection criteria. Performance was evaluated by comparing signal-to-interference performance with that of the conventional method. Experimental results showed that the proposed method reduced computation to 17.1 % of that required by the conventional method, and that separation performance of the proposed method is superior. Therefore, the proposed method can achieve faster computation with lower computational complexity, and its effectiveness can be confirmed.

关键词： Dodecahedral microphone array Frequency domain independent component analysis computational complexity reduction Signal-to-interference improvement

来源：评论

学校读者我要写书评

暂无评论

Real-time Video Based Finger Spelling Recognition System Using Low computational complexity Artificial Neural Networks

Real-time Video Based Finger Spelling Recognition System Usi...

引用

2006 International Telecommunications Symposium (ITS)

作者： Bragatto, T. A. C. Ruas, G. I. S. Lamar, M. V. Univ Fed Parana Dept Elect Engn BR-81531990 Curitiba Parana Brazil

ISBN: (纸本)9781424436446

The automatic sign language translation still is the most complex and challenging task for video recognition and processing. This work presents the Brazilian Sign Language Automatic Translation project and specifically focuses on low complexity Artificial Neural Networks dedicated to real-time video processing. A new approach for reducing the computational complexity of the activation function of the Multi-Layer Perceptron is proposed in this work, allowing complex processing of video signals be done in real-time. The low complexity neural networks are used in two stages of the system. In the color detection and hand posture classification blocks. The obtained results indicate an increase of the frame rate from 8.6 fps to 28.1 fps using a personal microcomputer with a USB webcam, without reduction of the correct recognition rate.

关键词： Gesture Recognition computational complexity reduction Low complexity Neural Networks

来源：评论

学校读者我要写书评

暂无评论

A complexity reduction Approach to the Detection of Safety Critical Situations in Air Traffic Management Systems 49

A Complexity Reduction Approach to the Detection of Safety C...

引用

49th IEEE Conference on Decision and Control (CDC)

作者： Petriccone, Alessandro Pola, Giordano Di Benedetto, Maria D. De Santis, Elena Univ Aquila Ctr Excellence DEWS Dept Elect & Informat Engn I-67100 Laquila Italy

ISBN: (纸本)9781424477463

In Air Traffic Management (ATM) systems, catastrophic events are often caused by errors made by agents operating in the procedures. Detecting safety critical situations that may arise in the evolution of ATM systems is of primary importance in the analysis of their behavior. The inherent complexity of ATM systems, typically involving a large number of agents, makes this analysis prohibitive today. Compositionality has been an effective way of tackling this problem. We present a compositional hybrid systems framework to accurately describe the behavior of the agents operating in ATM scenarios and of their interaction. We then expose some results that reduce the computational effort required in detecting safety critical situations. Benefits from the use of this complexity reduction approach are illustrated using the analysis of the Airborne Separation-In Trail Procedure (ASEP-ITP).

关键词： Air traffic management systems hybrid systems critical observability computational complexity reduction airborne separation in-trail procedure

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：