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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

145 篇 期刊文献
75 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

195 篇 工学
- 111 篇 电气工程
- 103 篇 计算机科学与技术...
- 38 篇 信息与通信工程
- 25 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 16 篇 仪器科学与技术
- 16 篇 软件工程
- 9 篇 机械工程
- 6 篇 交通运输工程
- 3 篇 光学工程
- 2 篇 材料科学与工程（可...
- 2 篇 测绘科学与技术
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 水利工程
46 篇 理学
- 23 篇 数学
- 18 篇 物理学
- 4 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
- 1 篇 系统科学
12 篇 医学
- 10 篇 临床医学
- 2 篇 基础医学(可授医学...
10 篇 管理学
- 9 篇 管理科学与工程(可...
2 篇 经济学
- 1 篇 理论经济学
- 1 篇 应用经济学
1 篇 哲学
- 1 篇 哲学
1 篇 法学
- 1 篇 社会学
1 篇 艺术学

主题

221 篇 computation comp...
43 篇 computational co...
8 篇 iterative method...
8 篇 communication co...
7 篇 optimisation
6 篇 optimization
6 篇 key distribution
5 篇 multicast commun...
5 篇 storage complexi...
5 篇 privacy
4 篇 approximation al...
4 篇 markov processes
4 篇 embedded systems
4 篇 parity check cod...
4 篇 vectors
4 篇 computational mo...
4 篇 radiofrequency i...
4 篇 feature extracti...
4 篇 vlsi
4 篇 complexity theor...

机构

3 篇 nanyang technol ...
2 篇 srm inst sci & t...
2 篇 nanjing univ sci...
2 篇 anna univ chenna...
2 篇 huazhong univ sc...
2 篇 beijing inst tec...
2 篇 mil tech coll au...
2 篇 univ chinese aca...
2 篇 yangzhou univ co...
2 篇 univ coll engn t...
2 篇 chinese acad sci...
2 篇 xidian univ natl...
2 篇 beijing key lab ...
2 篇 xidian univ stat...
2 篇 anna univ chenna...
2 篇 beijing univ pos...
2 篇 yamaguchi univ f...
2 篇 univ auckland de...
1 篇 henan univ sch m...
1 篇 yamaguchi univ f...

作者

3 篇 zhang lei
3 篇 bose s.
3 篇 kannan a.
3 篇 vijayakumar p.
2 篇 li sheng
2 篇 amutha r.
2 篇 he sun
2 篇 zhang enze
2 篇 deepa n.
2 篇 deborah lazarus ...
2 篇 li weijun
2 篇 balaji l.
2 篇 khoussainov bakh...
2 篇 cui sheng
2 篇 chen qingwei
2 篇 lim olivier
2 篇 mancini stephane
2 篇 pandiaraja p.
2 篇 chen weigang
2 篇 tu yicong

语言

207 篇 英文
11 篇 其他
2 篇 中文
1 篇 法文
1 篇 俄文

检索条件"主题词=computation complexity"

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

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

详细简洁

排序：

On complexity of Ehrenfeucht-Fraisse games

引用

International Symposium on Logical Foundations of Computer Science (LFCS 2007)

作者： Khoussainov, Bakhadyr Liu, Jiamou Univ Auckland Dept Comp Sci Auckland 1 New Zealand

ISBN: (纸本)3540727329

In this paper, we initiate the study of Ehrenfeucht-Fraisse games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call the Ehrenfeucht-Fraisse problem. Given n is an element of omega as a parameter, and two relational structures A and B from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game G(n)(A. B)? We provide algorithms for solving the Ehrenfeucht-Fraisse problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the Values of these constants as functions of n. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Finite model theory Ehrenfeucht-Fraisse game computation complexity

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Arithmetic Based on Narrow Band C-V

Image Segmentation Arithmetic Based on Narrow Band C-V

引用

International Conference on Advanced Measurement and Test (AMT 2010)

作者： Lv, Xiaohu Liu, Yongxin Inner Mongolia Univ Coll Elect Informat Engn Hohhot 010021 Peoples R China

ISBN: (纸本)9780878492695

The characters of C-V model are analyzed in this paper. Using the C-V technique to segment objects from an image, every pixel of whole image needed to be updated in each iterative calculation. The amount of iterative calculation is very large. So a computational method combine C-V model with the narrow band of level set is proposed. The segmentation iterative computation is defined on a narrow band, so the computation complexity is gotten lower. This segmentation algorithm is simulated in MATLAB. The simulation results shows that this segment arithmetic is efficiency, constringency fast and can get object integrally.

关键词： Image segmentation Narrow band C-V model computation complexity

来源：评论

学校读者我要写书评

暂无评论

Dead problem of program nets

Dead problem of program nets

引用

18th Workshop on Circuits and Systems

作者： Yamaguchi, S Yamada, K Ge, QW Tanaka, M Yamaguchi Univ Fac Engn Ube Yamaguchi 7558611 Japan Hitachi Elect Serv Ltd Tokyo 1086105 Japan Yamaguchi Univ Fac Educ Yamaguchi 7538513 Japan

In this paper, we discuss a new property, named dead, of (dataflow) program nets. We say that a node of a program net is dead iff the node cannot fire once in any possible firing sequence, and furthermore the program net is partially dead. We tackle a problem of deciding whether a given program net is partially dead, named dead problem. Program nets can be classified into four subclasses: general, acyclic, SWITCH-less, and acyclic SWITCH-less nets. For each subclass, we give a method of solving dead problem and its computation complexity. Our results show that (i) acyclic SWITCH-less nets are not partially dead;(ii) for SWITCH-less nets, dead problem can be solved in polynomial time;(iii) for acyclic nets and general nets, dead problem is intractable.

关键词： program nets dead dead problem computation complexity NP-completeness

来源：评论

学校读者我要写书评

暂无评论

Optimal Relay Selection and Channel Allocation for Multi-User Analog Two-Way Relay Systems

Optimal Relay Selection and Channel Allocation for Multi-Use...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Bai, Bo (Bob) Chen, Wei Ben Letaief, Khaled Cao, Zhigang Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Ctr Wireless Informat Technol Kowloon Hong Kong Peoples R China Tsinghua Univ TNList Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9781424492688

Analog network coding is a promising technique which can greatly improve the transmission efficiency of wireless communications. In two-way relay systems with multiple subchannels, multiple user pairs and multiple relays, however, the optimal joint relay selection and subchannel allocation problem has not been studied in a systematic way. In this paper, a random combinatorial optimization approach, referred to as the weighted random bipartite graph (WRBG) based minimum weighted matching (MWM) method, will be proposed to solve this problem. By analyzing the properties of the MWM on WRBG, we shall derive the outage probability and diversity-multiplexing tradeoff of each user after relay selection and channel allocation. Theoretical results will demonstrate that the outage probability, cooperative diversity, and frequency diversity of the proposed WRBG based MWM method for multi-user two-way relay systems is the same as that of two-way relay systems with only one user pair. The proposed algorithm for MWM also enjoys a low computation complexity of O(log(2) N) for parallel implementations, where N is the number of subchannels. Simulation results will illustrate the potential of the proposed method and also verify the theoretical derivations.

关键词： Bipartite graph complexity theory Joints MWM method Network coding Relays Resource management Signal to noise ratio WRBG channel allocation channel allocation computation complexity cooperative communication cooperative diversity diversity reception diversity-multiplexing tradeoff frequency diversity minimum weighted matching method multiuser analog two-way relay system optimal relay selection optimisation outage probability probability radiocommunication random combinatorial optimization approach weighted random bipartite graph wireless communications

来源：评论

学校读者我要写书评

暂无评论

Fast Local DC Programming for Optimal Power Allocation in Wireless Networks

Fast Local DC Programming for Optimal Power Allocation in Wi...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Kha, H. H. Tuan, H. D. Nguyen, Ha H. Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Univ Saskatchewan Dept Elect & Comp Engn Saskatoon SK Canada

ISBN: (纸本)9781424492688

Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global maximization of the minimum rate among network links are not only important but also very hard optimization problems due to their nonconvexity nature. Recently developed methods are either unable to locate the global optimal solutions or prohibitively complex for practical applications. This paper exploits the d.c. (difference of two convex functions/sets) structure of either the objective function or constraint of the these global optimization problems to develop efficient iterative algorithms with very low complexity. Numerical results demonstrate that the developed algorithms are able to locate the global optimal solutions by only a few iterations and they are superior to the previously-proposed methods in both performance and computation complexity.

关键词： Convergence Optimization Programming Resource management Throughput Vectors Wireless networks computation complexity computational complexity fast local DC programming global maximization global optimization problems interference-limited wireless network iterative algorithms iterative methods optimal power allocation optimisation radio networks radiofrequency interference weighted sum throughput

来源：评论

学校读者我要写书评

暂无评论

POTENTIAL OF AN EMBEDDED HYPERSPECTRAL COMPRESSIVE IMAGING SYSTEM FOR REMOTE SENSING APPLICATIONS

POTENTIAL OF AN EMBEDDED HYPERSPECTRAL COMPRESSIVE IMAGING S...

引用

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Lim, Olivier Mancini, Stephane Mura, Mauro Dalla Univ Grenoble Alpes CNRS Grenoble INP TIMA 46 Ave Felix Viallet F-38031 Grenoble France Univ Grenoble Alpes CNRS Grenoble INP GIPSA Lab 11 Rue MathCmatiques F-38402 St Martin Dheres France Inst Univ France IUF 1 Rue Descartes F-75231 Paris 05 France

ISBN: (纸本)9798350320107

The utilization of hyperspectral imaging in remote sensing has seen an increasing trend, as it enables to capture a greater amount of information. In this context, emerging snapshot sensors based on compressed sensing have been employed for various remote sensing applications. This work presents a prospective study by proposing a method to evaluate the performances we can expect when reconstructing data from a compressed sensing imager, the Double-Disperser Coded Aperture Snapshot Spectral Imager on an embedded system, i.e. on either a Graphics Processing Unit or a Field-Programmable Gate Arrays. This is original in the literature since most compressive sensing works focus on reconstruction quality and overlook the requirements for real-time, namely computational cost and data bandwidth. Moreover, works that use an embedded system are even more scarse. The study introduces methods to enhance these restrictions and assesses the resulting improvements. The study's findings support the use of Disperser Coded Aperture Snapshot Spectral Imager for remote sensing applications, potentially enabling a smaller sensor size.

关键词： Compressed sensing CGNE DD CASSI hyperspectral imaging computation complexity embedded systems FPGA GPU

来源：评论

学校读者我要写书评

暂无评论

An Indoor Localization of WiFi Based on Branch-bound Algorithm

An Indoor Localization of WiFi Based on Branch-bound Algorit...

引用

International Conference on Information Science, Electronics and Electrical Engineering (ISEEE)

作者： Yu, Feng Jiang, Minghua Liang, Jing Qin, Xiao Hu, Ming Peng, Tao Hu, Xinrong Wuhan Text Univ Sch Elect & Elect Engn Wuhan 430200 Peoples R China Auburn Univ Dept Comp Sci & Software Engn Auburn AL 36849 USA

ISBN: (纸本)9781479931972

Indoor localization based on existing WiFi signal strength is becoming increasingly prevalent. Many indoor localization algorithms have been proposed, such as NN, KNN and WKNN. In this paper, we propose an indoor localization of WiFi based on branch-bound algorithm(ILBBA). The ILBBA consists of offline and online phase. In the offline phase, the received signal strength(RSS) is collected by mobile devices, and is dealt with ILBBA to build fingerprint map;while in the online phase, real-time measured RSS is matched with the fingerprint map. Experimental results indicate that the proposed algorithm achieves high localization accuracy while reducing the computation complexity.

关键词： indoor localization WiFi fingerprint map ILBBA computation complexity

来源：评论

学校读者我要写书评

暂无评论

A Frequency-Invariant Fixed Beamformer for Speech Enhancement

A Frequency-Invariant Fixed Beamformer for Speech Enhancemen...

引用

Annual Summit and Conference of Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA)

作者： Mars, Rohith Reju, V. G. Khong, Andy W. H. Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore

ISBN: (纸本)9786163618238

Fixed beamformers maintain response that is independent of the signal and interference statistics. Frequency invariant fixed beamformers can achieve constant beamwidth across all frequencies which results in lower signal distortion and they have lower computation complexity compared to its adaptive counterpart. However, unlike data-dependent beamformers, their sidelobe attenuation is poor with respect to the direction of the interferences. In this paper we propose a method to improve the sidelobe attenuation while retaining the advantages of lower computational complexity and frequency-invariance. This is achieved by introducing frequency-invariant nulls in the interference directions. We also show how the weights for each null direction can be combined with the fixed beamformer to form the effective weights of the proposed beamformer.

关键词： array signal processing computational complexity interference (signal) speech enhancement computation complexity data dependent beamformers frequency invariant fixed beamformer interference directions interference statistics null direction signal distortion Attenuation Azimuth Cost function Interference Microphone arrays Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

Adaptive Gabor Convolutional Neural Networks for Finger-Vein Recognition

Adaptive Gabor Convolutional Neural Networks for Finger-Vein...

引用

International Conference on High Performance Big Data and Intelligent Systems (HPBD&IS)

作者： Zhang, Yakun Li, Weijun Zhang, Liping Lu, Yaxuan Chinese Acad Sci Inst Semicond Beijing Peoples R China Univ Chinese Acad Sci Ctr Mat Sci & Optoelect Engn Beijing Peoples R China Univ Chinese Acad Sci Sch Microelect Beijing Peoples R China Beijing Key Lab Semicond Neural Network Intellige Beijing Peoples R China Cognit Comp Technol Wave Joint Lab Beijing Peoples R China

ISBN: (纸本)9781728104669

Finger-vein recognition has become an important branch in the field of biometrics. Convolutional neural networks (CNNs) have achieved remarkable success in finger-vein recognition, but their models have many problems, such as high complexity, large parameters, running time slowly and so on. To solve these problems, we proposed adaptive Gabor convolutional neural networks (AGCNN). We replaced the normal convolution layer of CNNs with Gabor convolution layer, and systematically investigate comparative performance using AGCNN and CNNs in the raw image and region of interest (ROI) image of finger vein database respectively. Experimental results show that the parameter complexity of AGCNN is significantly less than that of CNNs with slight performance decrease. And the experimental results of the raw image database show that the processing speed has been greatly improved.

关键词： finger vein Gabor filter convolutional neural networks computation complexity speed

来源：评论

学校读者我要写书评

暂无评论

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved computation 22

Balanced Byzantine Reliable Broadcast with Near-Optimal Comm...

引用

ACM Symposium on Principles of Distributed Computing (PODC)

作者： Alhaddad, Nicolas Das, Sourav Duan, Sisi Ren, Ling Varia, Mayank Xiang, Zhuolun Zhang, Haibin Boston Univ Boston MA USA Univ Illinois Champaign IL USA Tsinghua Univ Beijing Peoples R China Beijing Inst Technol Beijing Peoples R China

ISBN: (纸本)9781450392624

This paper studies Byzantine reliable broadcast (BRB) under asynchronous networks, and improves the state-of-the-art protocols from the following aspects. Near-optimal communication cost: We propose two new BRB protocols for.. nodes and input message.. that has communication cost O (n|M |+n(2) logn), which is nearoptimal due to the lower bound of Omega(n|M |+n(2)). The first RBC protocol assumes threshold signature but is easy to understand, while the second RBC protocol is error-free but less intuitive. Improved computation: We propose a newconstruction that improves the computation cost of the state-of-the-art BRB by avoiding the expensive online error correction on the input message, while achieving the same communication cost. Balanced communication: We propose a technique named balanced multicast that can balance the communication cost for BRB protocols where the broadcaster needs to multicast the message.. while other nodes only needs to multicast coded fragments of size O(|M |/n + logn). The balanced multicast technique can be applied to many existing BRB protocols as well as all our new constructions in this paper, and can make every node incur about the same communication cost. Finally, we present a lower bound to show the near optimality of our protocol in terms of communication cost at each node.

关键词： Asynchronous Networks Reliable Broadcast Communication complexity computation complexity Lower Bounds

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：