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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

210 篇 工学
- 127 篇 电气工程
- 106 篇 计算机科学与技术...
- 37 篇 信息与通信工程
- 30 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 16 篇 仪器科学与技术
- 16 篇 软件工程
- 9 篇 机械工程
- 5 篇 交通运输工程
- 3 篇 光学工程
- 2 篇 材料科学与工程（可...
- 2 篇 测绘科学与技术
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 石油与天然气工程
45 篇 理学
- 22 篇 数学
- 18 篇 物理学
- 4 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
- 1 篇 系统科学
13 篇 医学
- 12 篇 临床医学
10 篇 管理学
- 9 篇 管理科学与工程(可...
2 篇 经济学
- 1 篇 理论经济学
- 1 篇 应用经济学
1 篇 哲学
- 1 篇 哲学
1 篇 法学
- 1 篇 社会学
1 篇 艺术学

主题

236 篇 computation comp...
57 篇 computational co...
9 篇 iterative method...
9 篇 communication co...
8 篇 computer vision ...
8 篇 optimisation
8 篇 optimisation tec...
6 篇 optimization
6 篇 codes
6 篇 matrix algebra
6 篇 key distribution
5 篇 signal detection
5 篇 vectors
5 篇 multicast commun...
5 篇 radiofrequency i...
5 篇 feature extracti...
5 篇 storage complexi...
5 篇 polynomials
5 篇 image recognitio...
5 篇 privacy

机构

3 篇 nanyang technol ...
3 篇 xidian univ natl...
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 篇 beijing univ pos...
2 篇 yangzhou univ co...
2 篇 univ coll engn t...
2 篇 chinese acad sci...
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...

作者

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 篇 chen q.
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

语言

220 篇 英文
13 篇 其他
2 篇 中文
1 篇 法文
1 篇 俄文

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

共 236 条记录，以下是141-150 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Generalized Multi-organization Scheduling on Unrelated Parallel Machines

A Generalized Multi-organization Scheduling on Unrelated Par...

引用

10th International Conference on Parallel and Distributed Computing, Applications and Technologies

作者： Ooshita, Fukuhito Izumi, Tomoko Izumi, Taisuke Osaka Univ Grad Sch Informat Sci & Technol 1-5 Yamadaoka Suita Osaka 5650871 Japan Ritsumeikan Univ Coll Informat Sci & Engn Shiga 5258577 Japan Nagoya Inst Technol Grad Sch Engn Nagoya Aichi 4668555 Japan

ISBN: (纸本)9781424452910

We consider the parallel computing environment where m organizations provide machines and several jobs to be executed. While cooperation of organizations is required to minimize the global makespan, each organization also expects the faster completion of its own jobs primarily and thus it is not necessarily cooperative. To handle the situations, we formulate the alpha-cooperative multi-organization scheduling problem (alpha-MOSP), where alpha >= 1 is a parameter representing the degree of cooperativeness. alpha-MOSP minimizes the makespan under the cooperation constraint that each organization does not allow the completion time of its own jobs to be delayed alpha times of that in the case where those jobs are executed by itself. In this paper, we aim to reveal the relation between the makespan and the degree of cooperativeness. First, we investigate the relation between alpha and the quality of the global makespan. For alpha = 1 (i.e., each organization never sacrifices its completion time), we show an instance where the cooperation constraint degrades the optimal makespan by m times. In contrast, for alpha > 1, we can construct an algorithm transforming any unconstrained schedule to one satisfying the cooperation constraint. This algorithm bounds the degradation ratio by alpha/(alpha - 1), which implies that weak cooperation improves the makespan dramatically. Second, we study the complexity of alpha-MOSP. We show its strongly NP-hardness and inapproximability for the approximation factor less than max{(alpha 1)/alpha,3/2}. We also show the hardness of transformation: Even if an optimal schedule under no cooperation constraint is given, no polynomial-time algorithm finds an optimal schedule for a-MOSP. This result is a witness for inexistence of general polynomial-time transformation algorithms that preserve the approximation ratio.

关键词： heterogeneous parallel computing environments scheduling algorithm approximation algorithm computation complexity

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of computation Cost of FastSLAM Algorithm for Unmanned Ground Vehicles 7

Experimental Evaluation of Computation Cost of FastSLAM Algo...

引用

7th IEEE International Conference on Control, Mechatronics and Automation(ICCMA)

作者： Al-Tarras, Ahmed E. Yacoub, Mostafa, I Asfoor, Mostafa Sh Sharaf, A. M. Mil Tech Coll Automot Engn Dept Cairo Egypt

ISBN: (纸本)9781728137872

Two decades ago, FastSLAM algorithm for mobile robots was introduced. Since then, dozens of research work focused on FastSLAM algorithm performance enhancement while keeping reduced computation cost. Since experimental evaluation of computation cost is dependent on the hardware capabilities of the platform, the present work introduces a quantitative theoretical method for predicting the computation cost of the FastSLAM algorithm. The method relies on the big (0) computation complexity which represents the worst case. The method was evaluated experimentally with different number of particles and different number of map features. The computation cost evaluation analysis was broken down into prediction, observation, data association and resampling computation cost evaluation. The proposed method was proven to be helpful in customization of FastSLAM parameters like number of particles and data association optimization for FastSLAM algorithm developers.

关键词： computation complexity FastSLAM particle filter UGV

来源：评论

学校读者我要写书评

暂无评论

Phase Intensive Global Pattern for Periocular Recognition 11

Phase Intensive Global Pattern for Periocular Recognition

引用

11th Annual IEEE India Conference (INDICON)

作者： Bakshi, Sambit Sa, Pankaj K. Majhi, Banshidhar Natl Inst Technol Jamshedpur 831014 Jharkhand India Natl Inst Technol Rourkela 769008 Odisha India

ISBN: (纸本)9781479953646

Partially constrained human recognition through periocular region has emerged as a new paradigm in biometric security. This article proposes Phase Intensive Global Pattern (PIGP) : a novel global feature based on variation of intensity of a pixel-neighbours with respect to different phases. The feature thus extracted is claimed to be rotation invariant and hence useful to identify human from images with face-tilt. The performance of proposed feature is experimented on UBIRISv2 database, which is a very large standard dataset with unconstrained periocular images captured under visible spectrum. The proposed work has been compared with Circular Local Binary Pattern (CLBP), and Walsh Transform, and experimentally found to yield higher accuracy, though with increased computation complexity and increased size of the feature vector.

关键词： biometrics (access control) computational complexity feature extraction image recognition transforms CLBP PIGP UBIRISv2 database Walsh transform biometric security circular local binary pattern computation complexity face-tilt feature vector global feature partially constrained human recognition periocular recognition phase intensive global pattern pixel-neighbour rotation invariant unconstrained periocular image very large standard dataset visible spectrum Accuracy Feature extraction Indexes Iris recognition Transforms Vectors

来源：评论

学校读者我要写书评

暂无评论

Minimum Delay Routing for Connected and Autonomous Vehicles Communications 12

Minimum Delay Routing for Connected and Autonomous Vehicles ...

引用

12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)

作者： Zhao, Zhengquan Chen, Yu Hu, Zheng Beijing Univ Posts & Telecommun Natl Engn Lab Mobile Network Technol Beijing Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9781728167435

Designing an effective and reliable routing protocol to ensure communications between Connected and Autonomous Vehicles (CAVs) is a big challenge. In this paper, we improve the Ad-hoc on-demand distance vector (AODV) routing protocol and propose a minimum delay routing algorithm to minimize the end-to-end packet delay for each vehicular data flow. The algorithm complexity is comparable to that of the existing Bellman-Ford algorithm. Specifically, we build a simulation platform based on the Simulation of Urban Mobility (SUMO). The simulation results show that in such settings, our proposed routing protocol outperforms the existing routing protocols in quality of service performance.

关键词： routing protocol connected and automated vehicles end-to-end packet delay computation complexity quality of service

来源：评论

学校读者我要写书评

暂无评论

Diminished-1 Fermat Number Transform for Integer Convolutional Neural Networks 4

Diminished-1 Fermat Number Transform for Integer Convolution...

引用

4th IEEE International Conference on Big Data Analytics (ICBDA)

作者： Zhu Baozhou Ahmed, Nauman Peltenburg, Johan Bertels, Koen Al-Ars, Zaid Delft Univ Technol Dept Quantum & Comp Engn Delft Netherlands

ISBN: (纸本)9781728112824

Convolutional Neural Networks (CNNs) are a class of widely used deep artificial neural networks. However, training large CNNs to produce state-of-the-art results can take a long time. In addition, we need to reduce compute time of the inference stage for trained networks to make it accessible for real time applications. In order to achieve this, integer number formats INT8 and INT16 with reduced precision are being used to create Integer Convolutional Neural Networks (ICNNs) to allow them to be deployed on mobile devices or embedded systems. In this paper, Diminished-1 Fermat Number Transform (DFNT), which refers to Fermat Number Transform (FNT) with diminished-1 number representation, is proposed to accelerate ICNNs through algebraic properties of integer convolution. This is achieved by performing the convolution step as diminished-1 point-wise products between DFNT transformed feature maps, which can be reused multiple times in the calculation. Since representing and computing all the integers in the ring of integers modulo Fermat number 2(b) + 1 for FNT requires b + 1 bits, diminished-1 number representation is used to enable exact and efficient calculation. Using DFNT, integer convolution is implemented on a general purpose processor, showing speedup of 2-3x with typical parameter configurations and better scalability without any round-off error compared to the baseline.

关键词： CNNs Diminished-1 representation Fermat Number Transform computation complexity

来源：评论

学校读者我要写书评

暂无评论

Template Selection Algorithm for NR-based Image Feature Extraction 10

Template Selection Algorithm for NR-based Image Feature Extr...

引用

10th International Conference on Natural computation (ICNC)

作者： Hu, Zhengfa Xiao, Haixia Zhen, Xin Hubei Automot Ind Inst Sch Sci Shiyan 442002 Peoples R China Xiamen Univ Technol Xiamen 361024 Peoples R China

ISBN: (纸本)9781479951512

In this paper, a refined template selection algorithm was proposed for NR-based image feature extraction. The proposed method was devoted to reduce the computation complexity and to improve the recognition ability. Experimental results on several image databases strongly demonstrated the efficiency and effectiveness of the proposed method.

关键词： neural response template selection image feature extraction computation complexity recognition ability

来源：评论

学校读者我要写书评

暂无评论

Server Location Method for Keeping Shorter Distance from Users to Servers during Failures 6

Server Location Method for Keeping Shorter Distance from Use...

引用

2014 International Conference on Intelligent Networking and Collaborative Systems (IEEE INCoS 2014)

作者： Maeda, Nao Miwa, Hiroyoshi Kwansei Gakuin Univ Grad Sch Sci & Technol 2-1 Gakuen Sanda Hyogo 6691337 Japan

ISBN: (纸本)9781479963874

Recently, large contents in the Internet have increased loads of contents servers, networks and data centers, which may degrade the quality of services. To overcome this problem, some mirror servers providing the same contents are located on a network and a request is navigated to one of the mirror servers. A user must access to one of the servers and the hop length of a path from a user to a server should be short even during link failure. As it affects the performance, the location of the mirror servers is important. In this paper, we address the server location problem, which determines the location of the servers satisfying the following the constraint: any users can access servers within a small hop count even if some links fail. First, we formulate this problem and prove that it is NP-hard. Second, we present a polynomial-time algorithm for the case that the number of simultaneously failed links is restricted to one and the increase of the distance between a user node and servers during failure is restricted to be the number of nodes. Furthermore, we also present an approximation algorithm to solve this problem when the number of servers to be accessed is restricted to one and the number of simultaneously failed links is a constant positive integer, and we evaluate the performance by using some actual network topologies.

关键词： Network Graph theory computation complexity Link failures Server location NP-hard Polynomial-time algorithm Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：