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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,723 篇 会议
654 篇 期刊文献
3 篇 学位论文

馆藏范围

5,380 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,503 篇 工学
- 851 篇 电气工程
- 771 篇 计算机科学与技术...
- 331 篇 信息与通信工程
- 238 篇 控制科学与工程
- 162 篇 软件工程
- 127 篇 机械工程
- 95 篇 仪器科学与技术
- 41 篇 电子科学与技术（可...
- 32 篇 交通运输工程
- 21 篇 航空宇航科学与技...
- 13 篇 生物医学工程（可授...
- 11 篇 测绘科学与技术
- 10 篇 土木工程
- 10 篇 网络空间安全
- 7 篇 材料科学与工程（可...
- 4 篇 动力工程及工程热...
- 4 篇 矿业工程
- 4 篇 石油与天然气工程
- 4 篇 核科学与技术
154 篇 理学
- 68 篇 系统科学
- 51 篇 数学
- 17 篇 物理学
- 16 篇 生物学
- 9 篇 统计学（可授理学、...
- 4 篇 地理学
- 4 篇 地球物理学
100 篇 管理学
- 98 篇 管理科学与工程(可...
49 篇 医学
- 45 篇 临床医学
37 篇 文学
- 37 篇 新闻传播学
7 篇 艺术学
- 7 篇 设计学（可授艺术学...
6 篇 农学
2 篇 教育学
1 篇 军事学

主题

5,380 篇 inference algori...
539 篇 computational mo...
414 篇 fuzzy systems
398 篇 algorithm design...
393 篇 bayesian methods
388 篇 fuzzy logic
371 篇 computer science
338 篇 training
336 篇 neural networks
304 篇 approximation al...
284 篇 bayes methods
239 篇 clustering algor...
234 篇 optimization
223 篇 signal processin...
214 篇 data mining
210 篇 accuracy
209 篇 fuzzy sets
206 篇 heuristic algori...
197 篇 prediction algor...
189 篇 data models

机构

15 篇 school of electr...
11 篇 university of ch...
10 篇 school of comput...
10 篇 zhejiang univ co...
9 篇 tsinghua univers...
9 篇 purple mt labs p...
9 篇 national univers...
8 篇 microsoft resear...
8 篇 university of mi...
7 篇 department of co...
7 篇 tianjin univ col...
7 篇 department of el...
7 篇 university of so...
7 篇 department of au...
7 篇 tsinghua univ de...
6 篇 ibm thomas j. wa...
6 篇 nanyang technol ...
6 篇 university of so...
6 篇 department of el...
6 篇 department of co...

作者

8 篇 pushmeet kohli
7 篇 li cheng
7 篇 edward r. doughe...
7 篇 wei li
7 篇 xiaodong wang
7 篇 t.s. huang
7 篇 erik b. sudderth
7 篇 a. taylan cemgil
7 篇 p. baranyi
7 篇 nizar bouguila
6 篇 simon godsill
6 篇 alan s. willsky
6 篇 hui wang
6 篇 wei liu
6 篇 ying wu
6 篇 wang wei
6 篇 s. suresh
6 篇 chen yongxin
6 篇 yang xu
6 篇 luca benini

语言

5,309 篇 英文
59 篇 其他
11 篇 中文
1 篇 西班牙文

检索条件"主题词=Inference algorithms"

共 5380 条记录，以下是4991-5000 订阅

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

详细简洁

排序：

Graph cuts using a Riemannian metric induced by tensor voting

Graph cuts using a Riemannian metric induced by tensor votin...

引用

International Conference on Computer Vision (ICCV)

作者： Hyung Il Koo Nam Ik Cho Department of EECS INMC Seoul National University Seoul South Korea

In this paper, we present a new algorithm that combines the advantages of tensor voting into graph cuts. Tensor voting has been a popular tool for a number of early vision problems since it can use principles of perceptual grouping, which are not well considered in graph cuts. We attempt to encode the power of tensor voting into an energy minimization framework. For this, we assume that the tensor map obtained by tensor voting induces a Riemannian metric in image domain, and the metric is constructed according to the conventional ways of tensor interpretation. Finally, by embedding the induced Riemannian metric into the graph via edge weights, the graph cuts algorithm can have priors considering principles of perceptual grouping. The proposed method can be used in the labeling of occluded regions, object segmentation using only edge information, and boundary regularization.

关键词： Tensile stress Voting Image segmentation Clustering algorithms inference algorithms Labeling Computer vision Extrapolation Application software Object segmentation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy-based Error Correction Mechanism to Improve the Precision of Intelligent Maneuvering Target Tracking

Fuzzy-based Error Correction Mechanism to Improve the Precis...

引用

IEEE International Conference on Information Reuse and Integration (IRI)

作者： Tsung-ying Sun Shang-jeng Tsai Hung-chun Chen Shan-ming Yang Department of Electrical Engineering National Dong Hwa University Hualien Taiwan

This paper proposes a fuzzy-based error correction mechanism (FECM) to improve the precision of an online data-driven fuzzy clustering (ODDFC) used in the maneuvering target tracking and trajectory prediction. In the ODDFC, the observed data are extracted automatically by fuzzy inference mechanism without much computation and training costs. But the improvement performance of ODDFC is slightly due to its parameters limitation and the prediction accuracy can be affected by the trajectory's curvature of moving target. So we propose ODDFC with FECM to solve the problem. In the proposed method, we use fuzzy inference system that has error correction mechanism to reduce the prediction error of ODDFC. ODDFC with FECM can predict maneuvering targets adapt quickly and have better prediction performance than ODDFC. Simulation results show that proposed method can improve the performance of ODDFC

关键词： Error correction Target tracking Trajectory Clustering algorithms Data mining inference mechanisms Iterative algorithms inference algorithms Computational efficiency Accuracy

来源：评论

学校读者我要写书评

暂无评论

Experiments using minimal-length encoding to solve machine learning problems

Experiments using minimal-length encoding to solve machine l...

引用

Data Compression Conference (DCC)

作者： A. Gammerman A. Bellotti Dept. of Comput. Sci. Heriot-Watt Univ. Edinburgh UK Department of Computer Science Heriot-Watt University Edinburgh UK

Describes a system called Emily which was designed to implement the minimal-length encoding principle for induction, and a series of experiments that was carried out with some success by that system. Emily is based on the principle that the formulation of concepts (i.e., theories or explanations) over a set of data can be achieved by the process of minimally encoding that data. Thus, a learning problem can be solved by minimising its descriptions.< >

关键词： Encoding Machine learning Bayesian methods Information theory inference algorithms Complexity theory Computer science Artificial intelligence Mathematics

来源：评论

学校读者我要写书评

暂无评论

Advanced Self-Improving Ramp Metering Algorithm based on Multi-Agent Deep Reinforcement Learning

Advanced Self-Improving Ramp Metering Algorithm based on Mul...

引用

International Conference on Intelligent Transportation

作者： Fuwen Deng Jiandong Jin Yu Shen Yuchuan Du College of Transportation Engineering Tongji University Shanghai China School of Electronics Engineering and Computer Science Peking University Beijing China

We proposed a novel ramp metering algorithm embedding multi-agent deep reinforcement learning (DRL) techniques, based on the data of loop detectors. A multi-agent DRL framework is adopted to generate proper ramp metering scheme for each ramp meter in real time to improve the operation efficiency of urban freeway with less investment. A simulation platform is developed to simplify the implementation and training of the algorithm. A set of simulation experiments - encompassing both single and multi-ramp scenarios with various traffic demand profiles - are conducted. Comparing with the state-of-the-practice ramp metering methods, the simulation results demonstrate that the proposed DRL-based algorithm outperforms in a comprehensive evaluation index considering mainstream speed at bottleneck and queue size on ramp. The method presents robustness, scalability, and the capability of further improvement by online learning during implementation.

关键词： Traffic control Training Detectors inference algorithms Optimization Approximation algorithms Machine learning

来源：评论

学校读者我要写书评

暂无评论

Bottleneck Potentials in Markov Random Fields

Bottleneck Potentials in Markov Random Fields

引用

International Conference on Computer Vision (ICCV)

作者： Ahmed Abbas Paul Swoboda Max Planck Institute for Informatics ZEISS

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

We consider general discrete Markov Random Fields (MRFs) with additional bottleneck potentials which penalize the maximum (instead of the sum) over local potential value taken by the MRF-assignment. Bottleneck potentials or analogous constructions have been considered in (i) combinatorial optimization (e.g. bottleneck shortest path problem, the minimum bottleneck spanning tree problem, bottleneck function minimization in greedoids), (ii) inverse problems with L ∞ -norm regularization, and (iii) valued constraint satisfaction on the (min, max)-pre-semirings. Bottleneck potentials for general discrete MRFs are a natural generalization of the above direction of modeling work to Maximum-A-Posteriori (MAP) inference in MRFs. To this end, we propose MRFs whose objective consists of two parts: terms that factorize according to (i) (min, +), i.e. potentials as in plain MRFs, and (ii) (min, max), i.e. bottleneck potentials. To solve the ensuing inference problem, we propose high-quality relaxations and efficient algorithms for solving them. We empirically show efficacy of our approach on large scale seismic horizon tracking problems.

关键词： Labeling Optimization Markov random fields inference algorithms Heuristic algorithms Inverse problems Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Sequential Pattern Recognition: Naive Bayes Versus Fuzzy Relation Method

Sequential Pattern Recognition: Naive Bayes Versus Fuzzy Rel...

引用

International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce

作者： M. Kurzynski A. Zolnierek Wroclaw University of Technology Wroclaw Poland

In this paper two possibilities of taking into account the dependencies in the sequential pattern recognition task are considered. The first method is naive Bayes attempt adopted to the probabilistic model of sequential decision problem in which, the assumption of Markov dependence in the sequence of recognized patterns is made. The second one is the fuzzy relation approach, in which we omitted such not necessary correct assumptions. Furthermore, both methods were applied to the medical diagnostic task and the results of computer investigations are discussed

关键词： Pattern recognition Medical diagnosis Fuzzy systems Computer networks Medical treatment Diseases Current measurement Mathematical model Context modeling inference algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel soft handoff algorithm for fair network resources distribution

A novel soft handoff algorithm for fair network resources di...

引用

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)

作者： B. AliPanahi M. Karzand Department of Electrical and Computer Engineering University of Tehran Tehran Iran

In this paper, we propose a novel and simple soft hand off algorithm that helps fair distribution of network resources among users. Due to centralized soft handoff mechanism, no further computational complexity is added to the mobile sets. Because we use fuzzy inference system (FIS) in adapting thresholds of our algorithm, it releases the traffic channels at high traffic load for increasing the carried traffic. This paper compares the performance of our algorithms with IS-95A soft handoff algorithm by using following performance indicators: outage probability, new call blocking probability, handoff call blocking probability, expected number of base station in active set, expected number of changes in active set, and network carried traffic. By comparison of all parameters among proposed algorithm and IS-95A, our algorithm tend to have a higher performance than IS-95A soft handoff, especially in new call requests blocking probability and network carried traffic.

关键词： Telecommunication traffic inference algorithms Base stations Multiaccess communication Computational complexity Mobile computing Fuzzy systems Signal generators Cellular networks Maintenance

来源：评论

学校读者我要写书评

暂无评论

Identification of chaotic system using recurrent compensatory neuro-fuzzy systems

Identification of chaotic system using recurrent compensator...

引用

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： Cheng-Hung Chen Chin-Teng Lin Department of Electrical and Control Engineering National Chiao Tung University Hsinchu Taiwan

In this paper, a recurrent compensatory neuro-fuzzy system (RCNFS) is proposed for identification and prediction. The compensatory-based fuzzy reasoning method is using adaptive fuzzy operations of neuro-fuzzy systems that can make the fuzzy logic systems more adaptive and effective. The recurrent network is embedded in the RCNFS by adding feedback connections in the second layer, where the feedback units act as memory elements. Also, an online learning algorithm is proposed to automatically construct the RCNFS. They are created and adapted as online learning proceeds via simultaneous structure and parameter learning. Finally, the RCNFS is applied in several simulations. The simulation results of the dynamic system modeling have shown that 1) the RCNFS model converges quickly; 2) the RCNFS model requires a small number of tuning parameters; 3) the RCNFS model can solve the temporal problems and approximate a dynamic system.

关键词： Chaos Fuzzy neural networks Fuzzy reasoning Fuzzy logic Fuzzy systems Neurofeedback Partitioning algorithms Backpropagation algorithms Adaptive systems inference algorithms

来源：评论

学校读者我要写书评

暂无评论

A Hardware Accelerator of the Convolutional Spike Neural Network Based on STDP Online Learning

A Hardware Accelerator of the Convolutional Spike Neural Net...

引用

China Semiconductor Technology International Conference (CSTIC)

作者： Qinxin Chen Xiao Dong De Ma Xiaolei. Zhu School of Micro-Nano Electronics Zhejiang University Hangzhou China College of computer science and technology Zhejiang University Hangzhou China

ISBN: (数字)9798350362190

ISBN: (纸本)9798350362206

Convolutional Neural Networks (CNNs) excel in object recognition but are computationally intensive and unsuitable for online learning. Spiking Neural Networks (SNNs) [1] have low computational requirements, fast processing, and low power consumption, making them suitable for online learning. This paper proposes a hardware accelerator for a Convolutional Spiking Neural Networks (Conv-SNNs) which combines the strengths of CNNs and SNNs by introducing spiking mechanisms into the convolutional layers. It utilizes Spike Timing Dependent Plasticity (STDP) and Reward-STDP (R-STDP) algorithms for training, achieving 95% accuracy on MNIST dataset. In addition, it also supports the few-shot learning. Implemented on Xilinx's ZCU102 FPGA at a 100MHz clock frequency, the system achieves 0.16s for inference and 0.177s for training per image, 16x faster than CPU. The power consumption is 3.979W, two orders of magnitude lower than CPU.

关键词： Training Power demand Neural networks inference algorithms Central Processing Unit Timing Object recognition

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing in MRI with a Markov random field prior for spatial clustering of subband coefficients

Compressed sensing in MRI with a Markov random field prior f...

引用

European Signal Processing Conference (EUSIPCO)

作者： Marko Panić Jan Aelterman Vladimir Crnojević Aleksandra Pižurica University of Novi Sad BioSense Institute Department Telecommunications and Information Processing Ghent University

Recent work in compressed sensing of magnetic resonance images (CS-MRI) concentrates on encoding structured sparsity in acquisition or in the reconstruction stages. Subband coefficients of typical images obey a certain structure, which can be viewed in terms of fixed groups (like wavelet trees) or statistically (certain configurations are more likely than others). Approaches using wavelet tree-sparsity have already demonstrated excellent performance in MRI. However, the use of statistical models for spatial clustering of the subband coefficients has not been studied well in CS-MRI yet, although the potentials of such an approach have been indicated. In this paper, we design a practical reconstruction algorithm as a variant of the proximal splitting methods, making use of a Markov Random Field prior model for spatial clustering of subband coefficients. The results for different undersampling patterns demonstrate an improved reconstruction performance compared to both standard CS-MRI methods and methods based on wavelet tree sparsity.

关键词： Magnetic resonance imaging Signal processing algorithms Image reconstruction Markov random fields inference algorithms Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：