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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是171-180 订阅

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

详细简洁

排序：

A Secure Key Distribution Protocol for Multicast Communication

A Secure Key Distribution Protocol for Multicast Communicati...

引用

1st International Conference on Logic, Information, Control and computation

作者： Vijayakumar, P. Bose, S. Kannan, A. Subramanian, S. Siva Anna Univ Dept Comp Sci & Engn Madras 25 Tamil Nadu India Anna Univ Dept Informat Sci & Technol Madras 25 Tamil Nadu India Univn Colln Engn Tindivanam Dept Math Tindivanam India

ISBN: (纸本)9783642192623

Providing efficient security method to support the distribution of multimedia multicast is a challenging issue, since the group membership in such applications requires dynamic key generation and updation which takes more computation time. Moreover, the key must be sent securely to the group members. In this paper, we propose a new Key Distribution Protocol that provides more security and also reduces computation complexity. To achieve higher level of security, we use Euler's Totient Function phi(n) and gcd(phi(n))in the key distribution protocol. Therefore, it increases the key space while breaking the re-keying information. Two major operations in this scheme are joining and leaving operations for managing group memberships. An N-ary tree is used to reduce number of multiplications needed to perform the member leave operation. Using this tree, we reduce the computation time when compared with the existing key management schemes.

关键词： Multicast Communication Key Distribution GCD One Way hash Function Euler's Totient Function computation complexity

来源：评论

学校读者我要写书评

暂无评论

Data Quality Maximization in Sensor Networks With a Mobile Sink

Data Quality Maximization in Sensor Networks With a Mobile S...

引用

7th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)

作者： Xu, Xu Liang, Weifa Wark, Tim Australian Natl Univ Sch Comp Sci Canberra ACT Australia CSIRO ICT Ctr Autonomous Syst Lab Brisbane Qld Australia

ISBN: (纸本)9781457705137

In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic.

关键词： Data communication Logic gates Mobile communication Mobile computing NP-hardness Routing protocols Sensors Trajectory communication complexity computation complexity data quality maximization energy-efficient routing protocol gateways high-capacity sensor

来源：评论

学校读者我要写书评

暂无评论

A Distance-Aware Technique for Object Detection Used in Self-Driving Vehicles 17

A Distance-Aware Technique for Object Detection Used in Self...

引用

17th International SoC Design Conference (ISOCC)

作者： Chen, Kuan-Hung Lu, Yu-Ta Feng Chia Univ Dept Elect Engn Taichung Taiwan

ISBN: (纸本)9781728183312

Object detection obtains huge improvement after adopting deep learning technique. However, deep learning technique requires extremely high computation complexity and heavy DRAM (Dynamic Random Access Memory) bandwidth requirements, which blocks the deployment over various kinds of platforms. This paper provides a distance-aware technique for object detection that can adjust the required computation complexity and DRAM access amount according to several different searching distances. According to our analysis, the perception system can save up to 34.2% and 21.5% of computation complexity and DRAM access amount, respectively, for detecting near field objects when compared to the full range detection, without sacrificing any detection accuracy.

关键词： CNN computation complexity distance-aware DRAM access object detection

来源：评论

学校读者我要写书评

暂无评论

TOWARDS REALIZATION OF A HIGH-FIDELITY SIMULATION MODEL FOR SHORT-TERM HORIZON FORECASTING IN WAFER FABRICATION FACILITIES

TOWARDS REALIZATION OF A HIGH-FIDELITY SIMULATION MODEL FOR ...

引用

2010 Winter Simulation Conference

作者： Scholl, Wolfgang Gan, Boon Ping Peh, Ming Li Lendermann, Peter Noack, Daniel Preuss, Patrick Rose, Oliver Infineon Technol Dresden Konigsbrucker Str 180 D-01099 Dresden Germany DSIMLAB Technol Pte Ltd Singapore 609431 Singapore Tech Univ Dresden Inst Appl Comp Sci D-01062 Dresden Germany DSIMLAB Technol GmbH D-01099 Dresden Germany

ISBN: (纸本)9781424498642

Discrete Event Simulation (DES) has widely been used for mid and long term forecasting in wafer fabrication plants. But the use of DES for short term forecasting has been limited due to the perceived modelling and computation complexity as well as the and computation complexity as well as the non-steady state nature of today's wafer fab operations. In this paper, we discuss some important modelling issues associated with building an online simulation model. Key elements considered are actual process routes, process and throughput modelling as a function of equipment behavior, lot size, and available processing modules, process dedication at equipment level, equipment downs at mainframe level, estimated lot release strategy, send ahead wafers, dispatch rules, and setup. Typical application areas are proactive dedication management, preventive maintenance scheduling and WIP based sampling optimization.

关键词： WIP actual process routes computation complexity computational complexity discrete event simulation discrete event simulation forecasting theory high-fidelity simulation model nonsteady state online simulation model preventive maintenance scheduling proac

来源：评论

学校读者我要写书评

暂无评论

A Fast PN Synchronization Algorithm in CDMA2000 Spread Spectrum Systems 3rd

A Fast PN Synchronization Algorithm in CDMA2000 Spread Spect...

引用

3rd International Conference on Communications, Signal Processing, and Systems (CSPS)

作者： Tian, Zengshan Gu, Jie Zhou, Mu Chongqing Univ Posts & Telecommun Chongqing Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China

ISBN: (纸本)9783319089911;9783319089904

The traditional algorithms are normally suffered from large computation complexity and serious acquisition performance. This paper proposes a fast pseudo noise (PN) phase synchronization algorithm for mobile station downlink channels. Based on overlap-saving method and fast Fourier transform (FFT), the proposed algorithm achieves phase synchronization with less time and resource consumption. Simulation results indicate that the proposed algorithm could significantly decrease PN codes acquisition time cost and is proved to perform well in PN phase synchronization.

关键词： CDMA Pseudo noise phase acquisition Fast synchronization Overlap-saving method computation complexity

来源：评论

学校读者我要写书评

暂无评论

An Algebraic Framework for the Real-Time Solution of Inverse Problems on Embedded Systems 17

An Algebraic Framework for the Real-Time Solution of Inverse...

引用

2015 IEEE 17th International Conference on High Performance Computing and Communications (HPCC)

作者： Gugg, Christoph Harker, Matthew O'Leary, Paul Rath, Gerhard Univ Leoben Dept Prod Engn Chair Automat Leoben Austria

ISBN: (纸本)9781479989379

This article presents a new platform independent approach to the real-time solution of inverse problems on embedded systems. The class of problems addressed corresponds to ordinary differential equations (ODEs) with generalized linear constraints, whereby the data from an array of sensors forms the forcing function. The algebraic discretization of the problem enables an one-to-one mapping of the ODE to its discrete equivalent linear differential operator, together with an additional matrix equation representing the constraints. The solution of the equation is formulated as a least squares (LS) problem with linear constraints. The LS approach makes the method suitable for the explicit solution of inverse problems where the forcing function is perturbed by noise. The algebraic computation is partitioned into an initial preparatory step, which precomputes the matrices required for the run-time computation;and the cyclic run-time computation, which is repeated with each acquisition of sensor data. The cyclic computation consists of a single matrix-vector multiplication;in this manner computation complexity is known a-priori, fulfilling the definition of a real-time computation. The solution is implemented with model based design and uses only fundamental linear algebra;consequently, this approach supports automatic code generation for deployment on embedded systems. The targeting concept was tested via software-and processor-in-the-loop verification. The method was tested on a laboratory prototype with real measurement data for the monitoring of flexible structures. The measurement arrangement consists of an embedded system with a chain of 14 inclinometer sensors connected to it;two additional nodes implement a total of four constraints. The problem solved is: the real-time overconstrained reconstruction of a curve from measured gradients. Such systems are commonly encountered in the monitoring of structures and/or ground subsidence.

关键词： computational complexity embedded systems inverse problems least squares approximations linear algebra linear differential equations program compilers program verification LS problem ODE automatic code generation computation complexity cyclic run-time computation discrete equivalent linear differential operator embedded system fundamental linear algebra inclinometer sensors inverse problem least square problem matrix equation ordinary differential equation processor-in- the-loop verification sensor data acquisition single matrix-vector multiplication software-verification computational modeling Embedded systems Inverse problems Mathematical model Polynomials Real-time systems Sensors ODE solver model based design numerical solver structural health monitoring wireless sensor network Embedded systems Inverse method Ordinary differential equation Sensor Data compilers program verification Linear algebra least squares approximations Linear differential equations real-time systems Sensors computational modeling Code generation Wireless sensor networks structural monitoring

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT BAND SELECTION METHOD FOR HYPERSPECTRAL IMAGERIES BASED ON COVARIANCE MATRIX 8

AN EFFICIENT BAND SELECTION METHOD FOR HYPERSPECTRAL IMAGERI...

引用

8th Workshop on Hyperspectral Image and Signal Processing - Evolution in Remote Sensing (WHISPERS)

作者： Sun, Kang Shuai, Tong Chen, Jinyong Geng, Xiurui Ji, Luyan Tang, Hairong Jiang, Kang Yu, Kai Zhao, Yongchao China Elect Technol Grp Corp Res Inst 54 Shijiazhuang Hebei Peoples R China Chinese Acad Sci Key Lab Technol Geospatial Informat Proc & Applic Inst Elect Beijing Peoples R China Tsinghua Univ Minist Educ Key Lab Earth Syst Modelling Ctr Earth Syst Sci Beijing Peoples R China

ISBN: (纸本)9781509006083

Band selection plays an important role in reducing the dimensionality of hyperspectral data sets. It is a combinatorial optimization problem for optimal band (feature) subset selection which generally involves high computational complexity. In this paper, we present an efficient band selection methods based on the covariance matrix. The method tries to compute the subset of bands with the largest determinant of covariance matrix. By using a recursive role found in this study, the proposed method can be very efficient. Besides, it also has the potentiality to determine the number of required bands.

关键词： Hyperspectral data dimensionality reduction feature extraction band selection computation complexity

来源：评论

学校读者我要写书评

暂无评论

Enforcing bounded realness of S parameter through trace parameterization

Enforcing bounded realness of S parameter through trace para...

引用

12th Topical Meeting on Electrical Performance of Electronic Packaging

作者： Chen, HB Fang, JY Univ Calif Santa Cruz Dept Elect Engn Santa Cruz CA 95064 USA

ISBN: (纸本)0780381289

A new method of enforcing the bounded realness of S parameter macro-model is proposed in this paper. With a given stable rational function obtained from fitting the original data, its closest bounded real rational function is solved through semidefinite programming. This optimization problem is formulated through trace parameterization and uses minimal number of variables.

关键词： S-parameters multiport networks state-space methods circuit optimisation circuit simulation rational functions circuit complexity transient analysis bounded realness S parameter trace parameterization macromodel stable rational function bounded real rational function semidefinite programming optimization problem minimal number of variables transient analysis multiport parameter computation complexity state-space realization

来源：评论

学校读者我要写书评

暂无评论

EDCA: Efficient Diffusion Cipher and Authentication Scheme for Wireless Sensor Networks

EDCA: Efficient Diffusion Cipher and Authentication Scheme f...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Noura, Hassan Martin, Steven Al Agha, Khaldoun Univ Paris Sud CNRS Lab Rech Informat Paris France

ISBN: (纸本)9781479930838

The security of Wireless Sensor Networks (WSN) is essential for effective deployment in various areas and applications such as military and business. The existing security solutions of WSN are based on multi-round function, which requires high computing complexity and energy consumption. WSN have, however, limited resources that prevent their efficient deployment for a long period. In this paper, a new kind of security system based on a cipher and authentication algorithm called EDCA is presented to ensure the necessary security requirements with low computation complexity. Furthermore, the proposed cipher is based on a dynamic binary diffusion layer. The contents of packets is divided into many blocks, which are mixed together to produce the cipher blocks. Likewise, an enhanced version of cipher is presented to attain a better statistical properties. Additionally, EDCA is evaluated by comparing it with AES, which is considered reliable and robust in several standards of sensor networks. The results show that the proposed algorithm has a reduced computation complexity, and is robust and could be adopted for different types of wireless or mobile networks.

关键词： computational complexity cryptography data privacy statistical analysis telecommunication network reliability telecommunication security wireless sensor networks AES EDCA scheme WSN advanced encryption standard business application computation complexity dynamic binary diffusion layer efficient diffusion cipher and authentication scheme energy consumption military application mobile network multiround function security system statistical property wireless sensor network Authentication Ciphers complexity theory Encryption Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of reach-ability computation schemes in multi-signal modeling

Analysis of reach-ability computation schemes in multi-signa...

引用

2009 Joint International Conference on Modelling and Simulation

作者： Xiaomei, Chen Xiaofeng, Meng North China Electric Power University Beijing China College of Instrument Science and Optoelectronics Engineering Behang University Beijing China

ISBN: (纸本)9781846260612

The critical step in multi-signal modeling hierarchically is the reach-ability computation. In this paper, two different schemes for reach-ability computation are put forward and then they are analyzed and compared with time complexity, At last, the effectiveness of the algorithms are verified. The work in this paper is valuable for future further research based on multi-signal.

关键词： computation complexity Digraph Hierarchically Multi-signal model Reach-ability computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共23页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：