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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Adaptive DWT-based watermarking scheme using neighboring mean value relationship

Adaptive DWT-based watermarking scheme using neighboring mea...

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： Der-Chyuan Lou Jiang-Lung Liu Ming-Chang Chang Chin-Chiang Pan Chao-Lung Chou Department of Electrical Engineering Chug ChEngineering Institute of Technology National Defense University Taoyuan Taiwan

ISBN: (纸本)0780386604

A watermarking algorithm performed in the wavelet domain is proposed. For the purpose of security and robustness, a watermark sequence is embedded by selectively modifying the middle-frequency parts of the image. Human visual system (HVS) is adopted to further ensure the watermark invisibility. The original image is not required for watermark extraction. Simulation results show that the proposed scheme is superior to quantization-based methods in terms of transparency, robustness, and computation complexity.

关键词： watermarking image processing discrete wavelet transforms computational complexity adaptive DWT-based watermarking scheme neighboring mean value relationship wavelet domain watermark sequence middle-frequency image parts human visual system watermark invisibility computation complexity

来源：评论

学校读者我要写书评

暂无评论

CONSTRAINED LEARNING ALGORITHMS FOR FINDING THE ROOTS OF POLYNOMIALS:ACASE STUDY

CONSTRAINED LEARNING ALGORITHMS FOR FINDING THE ROOTS OF POL...

引用

2002年IEEE十区计算机、通信、控制和电机工程会议

作者： De-Shuang Huang Senior Member, IEEE Hefei Institute of Intelligent Machines, Chinese Academy of Sciences,P.O.Box 1130, Hefei, Anhui 230031, China

This paper makes further discussions onthe constrained learning algorithms (CLA) proposedby Perantonis et al, which is an efficient constrainedback propagation (BP) algorithm formed byimposing the constraint conditions (most of whichare from the a priori information of the involvedproblems) implicit in the problems on theconventional BP algorithm. In addition, for theproblem of applying CLA's to Finding the roots ofpolynomials based on the relation between the rootsand the coefficients of polynomials, we discuss thecomputation complexities for different number ofconstrained conditions. Finally, some computersimulation results are given to support our claims.

关键词： Constrained Learning Algorithms Adaptive Parameter Selection Feedforward Neural Networks Polynomials Roots computation complexity

来源：评论

学校读者我要写书评

暂无评论

How to Find the Optimal Paths in Stochastic Time-Dependent Transportation Networks?

How to Find the Optimal Paths in Stochastic Time-Dependent T...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Shichao Sun Zhengyu Duan Shuo Sun Dongyuan Yang Key Lab. of Road & Traffic Eng. of the Minist. of Educ Tongji Univ. Shanghai China

ISBN: (纸本)9781479960798

This paper conducted a theoretical study on finding optimal paths in stochastic time-dependent (STD) transportation networks. A stochastic consistent network with STD link travel times was built. The methodology of robust optimization was applied to evaluate the paths for a priori optimization without requiring the probability distribution of travel times. The paths with greatest robustness, namely minimum upper bounds of travel times were defined as the optimal path. Under the stochastic consistent condition, the STD robust optimal path model can be converted into solving a time-dependent shortest path problem in a FIFO network. Then extended Dijkstra's algorithm can be applied to solve the simplified STD problem with computation complexity O (n~2). In the field experiment, several tests were conducted on finding robust optimal paths in a sampled STD transportation network of Shanghai, China. The numerical results confirmed the validity of the proposed approach and verified that the natural extension of conventional Dijkstra's algorithm can solve the STD robust optimal path problem as efficiently as a static network problem.

关键词： optimal control robust control statistical distributions stochastic systems traffic transportation Dijkstra algorithm FIFO network STD robust optimal path model STD robust optimal path problem STD transportation networks computation complexity probability distribution robust optimal paths robust optimization sampled STD transportation network simplified STD problem static network problem stochastic consistent condition stochastic consistent network stochastic time-dependent transportation networks time-dependent shortest path problem Algorithm design and analysis Heuristic algorithms Optimization Robustness Stochastic processes Transportation Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Based Assembly Sequence Planning System

Knowledge-Based Assembly Sequence Planning System

引用

The 8th International Conference on Computer Supported Cooperative Work in Design(第八届计算机支持的协同工作设计国际会议)(CSCWD2004)

作者： Ruofeng Tong Jinxiang Dong Tianyang Dong Ling Zhang Institute of Artificial Intelligence State Key Laboratory of CAD/CGZhejiang UniversityHangzhou310 Department of Economics and Management Zhejiang University of Science and TechnologyHangzhou310023

ISBN: (纸本)0780379411

This paper presents a knowledge-based approachto assembly sequence planning problem. This researchshows that the typical or standard CSBAT (ConnectionSemantics Based Assembly Tree) can be applied to agiven assembly problem. The structure of the KBASP(Knowledge-Based Assembly Sequence PlanningSystem) is proposed, there are three ways to constructplans for a CSBAT: (1) by retrieving the typical base, (2)by retrieving standard base, and (3) by geometryreasoning. Compared with other system based on thereuse philosophy, the approach can generate assemblysequences for each CSBAT directly without the problemof merging plans for different child CSBATs. Byintegrating geometry-based reasoning withknowledge-based reasoning, the computationcomplexity is reduced drastically and the assemblysequences obtained are more feasible and practical.

关键词： assembly planning computational complexity knowledge based systems inference mechanisms knowledge-based assembly sequence planning system standard CSBAT connection semantics based assembly tree assembly problem KBASP typical base retrieval standard base retrieval geometry reasoning knowledge-based reasoning computation complexity

来源：评论

学校读者我要写书评

暂无评论

Globally Optimal Antenna Selection and Power Allocation for Energy Efficiency Maximization in Downlink Distributed Antenna Systems

Globally Optimal Antenna Selection and Power Allocation for ...

引用

IEEE Global Communications Conference

作者： Yuzhou Li Min Sheng Xijun Wang Yan Shi Yan Zhang Information Science Institute State Key Laboratory of ISN Xidian University

ISBN: (纸本)9781479935130

Green communications are becoming an inevitable trend for future wireless network design, meanwhile, as a promising technique, distributed antenna systems (DAS) cater for this evolution. In this paper, we focus on the problem of devising globally optimal antenna selection and power allocation algorithm in downlink DAS to achieve energy efficiency (EE) maximization. We formulate it as a mixed-integer nonlinear programming (MINLP), which maximizes EE subject to rate requirements, transmit power, and antenna selection constraints. By equivalent transformation, an iterative antenna selection and power allocation algorithm is proposed based on nonlinear fractional programming theory, and branch and bound methods. Our algorithm ensures global optimality and thus, it provides an important benchmark for performance evaluation of other heuristic algorithms targeting the same problem. Simulation results show that the computation complexity can be dramatically reduced comparing with exhaustive search, as well as demonstrate that a significant gain can be obtained in terms of EE against the schemes without antenna selection.

关键词： antenna arrays energy conservation integer programming iterative methods nonlinear programming tree searching DAS MINLP antenna selection constraints branch and bound methods computation complexity downlink distributed antenna systems energy efficiency maximization future wireless network design globally optimal antenna selection green communications iterative antenna selection mixed-integer nonlinear programming nonlinear fractional programming theory power allocation algorithm transmit power Antennas Optimized production technology Programming Resource management Upper bound Wireless communication

来源：评论

学校读者我要写书评

暂无评论

STUDY ON MULTISCALE LEAST SQUARES AND APPLICATION IN PARAMETER IDENTIFICATION

STUDY ON MULTISCALE LEAST SQUARES AND APPLICATION IN PARAMET...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： ZHU-LIN ZHENG CHENG-LIN WEN GUANG-JIANG WANG SONG-WEI WANG Henan Institute Of Science and Technology Xinxiang 453003China School of Computer and Information Engineering Henan University Kaifeng475001 China

In various theoretical research and engineering, the long memory processes are widely found and studied in many applications. Maximum likelihood Estimation is usually used to capture the relevant parameters, but it can't be utilized broadly because of the huge burden of computability. In this paper, we firstly use discrete wavelet transform to analyze stochastic processes of time series scale-by-scale, then study the variance and statistical properties of the series over a range of different scales. Subsequently, apply Least Squares Estimation to parameter estimation according to the property that log variance is approximately simple linear equation of log scale, finally a new method named multiscale Least Squares Estimation is put forward. The new algorithm can effectively decrease computation complexity and obtain satisfying estimation precision. This advantage is validated by the data analysis and computer simulation.

关键词： Long Memory Process Multiscale analysis Multiscale Least Squares Estimation computation complexity

来源：评论

学校读者我要写书评

暂无评论

An Implementation of Quarter Pixel Block Motion Estimation Using SIMD

An Implementation of Quarter Pixel Block Motion Estimation U...

引用

2004 International Symposium on Distributed Computing and Applications to Business, Engineering and Science

作者： Xinchen Zhang Ruimin Hu Deren Li Zhongyuan Wang The Key Laboratory of Multimedia and Network Communications Engineering, Hubei Province,Wuhan University Wuhan,Hubei 430072,China

For improving video coding efficiency,sub-pixel motion estimation(ME) is used extensively in the existing video coding *** quarter pixel ME is one of the high complexity tools in H.264/*** this paper,a parallel quarter block motion estimation algorithm that not only accelerates the process of sub-pixel motion estimation but also maintains accuracy as that of the original algorithm is *** Intel P4 CPU,the SIMD(single instruction multiple data) technique is commonly used to provide an execution *** implementation of this algorithm using parallel processing on P4 platform is *** proposed algorithm satisfies in particular the requirements of low-rate real-timed video *** results show that the optimized video encoder is more than 13.5 times faster than the original reference software while keeping the accuracy of the latter approximately.

关键词： Sub-pixel Block Motion Estimation computation complexity Parallel Algorithm SIMD H.264/AVC

来源：评论

学校读者我要写书评

暂无评论

Three goals in designing VLSI architectures for video compression

Three goals in designing VLSI architectures for video compre...

引用

Asia-Pacific Conference on Communications

作者： Danian Gong Yun He State Key Laboratory on Microwave & Digital Communications Electronic Engineering Department Tsinghua University Beijing China

ISBN: (纸本)7563504028

Video compression is characterized by the diversity in algorithms, the complexity of computation and the high throughput rate. The requirement of diversity and high performance in video compression brings forward some important goals in designing the VLSI architecture. In this paper, three very important goals are introduced into the design of VLSI architectures for video compression. In the main part of the paper, why each design goal should be considered, what are the problems in achieving each goal and what techniques can be used to achieve each goal are studied.

关键词： VLSI video coding data compression parallel architectures VLSI architectures design video compression computation complexity algorithm diversity high throughput rate parallel computing scalability programmability

来源：评论

学校读者我要写书评

暂无评论

Safe Sequential Path Planning of Multi-Vehicle Systems via Double-Obstacle Hamilton-Jacobi-Isaacs Variational Inequality

Safe Sequential Path Planning of Multi-Vehicle Systems via D...

引用

European Control Conference

作者： Mo Chen Jaime F. Fisac Shankar Sastry Claire J. Tomlin Department of Electrical Engineering and Computer Sciences University of California

ISBN: (纸本)9781467371605

We consider the problem of planning trajectories for a group of N vehicles, each aiming to reach its own target set while avoiding danger zones of other vehicles. The analysis of problems like this is extremely important practically, especially given the growing interest in utilizing unmanned aircraft systems for civil purposes. The direct solution of this problem by solving a single-obstacle Hamilton-Jacobi-Isaacs (HJI) variational inequality (VI) is numerically intractable due to the exponential scaling of computation complexity with problem dimensionality. Furthermore, the single-obstacle HJI VI cannot directly handle situations in which vehicles do not have a common scheduled arrival time. Instead, we perform sequential path planning by considering vehicles in order of priority, modeling higher-priority vehicles as time-varying obstacles for lower-priority vehicles. To do this, we solve a double-obstacle HJI VI which allows us to obtain the reach-avoid set, defined as the set of states from which a vehicle can reach its target while staying within a time-varying state constraint set. From the solution of the double-obstacle HJI VI, we can also extract the latest start time and the optimal control for each vehicle. This is a first application of the double-obstacle HJI VI which can handle systems with time-varying dynamics, target sets, and state constraint sets, and results in computation complexity that scales linearly, as opposed to exponentially, with the number of vehicles in consideration.

关键词： autonomous aerial vehicles computational complexity multi-robot systems path planning trajectory control variational techniques HJI variational inequality civil purpose computation complexity double-obstacle Hamilton-Jacobi-Isaacs variational inequality multivehicle systems safe sequential path planning trajectory planning unmanned aircraft systems complexity theory Joints Space vehicles Trajectory Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction for HEVC Based on Distortion Variance

Fast Intra Mode Prediction for HEVC Based on Distortion Vari...

引用

International Conference on Circuits, Power and Computing Technologies

作者： L. Balaji V. Logesh Raj R. Raghavendran S. Mathan Raj G. Akash Department of ECE Velammal Institute of Technology

ISBN: (纸本)9781509012787

High Efficiency Video Coding (HEVC) is an ongoing standard, which is an extension of H.264/AVC which is the latest coding standard. In HEVC encoder an exhaustive search method is employed to select the best mode for each macro block which consumes more encoding time. Rate and Distortion tradeoff attained for encoding each macroblock introduces more computation complexity. Although, HEVC has better coding efficiency, in regard to AVC it has more number of macroblock modes to identify the best mode. In this paper, a fast mode intra prediction algorithm to predict the best mode for each macro block based on distortion variance is proposed. The distortion variance finds the integer pixel difference between the current macroblock and the reference macroblock. The experimental result shows that the proposed algorithm achieves better encoding time when compared with HM reference model without a drastic increment in bit rate and PSNR or degradation.

关键词： H.265 Fast mode decision computation complexity PSNR Time Distortion variance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：