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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

121 篇 会议
87 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

77 篇 工学
- 32 篇 计算机科学与技术...
- 22 篇 软件工程
- 16 篇 控制科学与工程
- 9 篇 机械工程
- 9 篇 信息与通信工程
- 5 篇 交通运输工程
- 5 篇 航空宇航科学与技...
- 3 篇 仪器科学与技术
- 3 篇 电气工程
- 3 篇 电子科学与技术（可...
- 3 篇 建筑学
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 冶金工程
- 1 篇 环境科学与工程（可...
29 篇 理学
- 17 篇 数学
- 11 篇 系统科学
- 8 篇 统计学（可授理学、...
- 2 篇 物理学
- 2 篇 化学
- 1 篇 地理学
- 1 篇 生物学
20 篇 管理学
- 19 篇 管理科学与工程(可...
- 6 篇 工商管理
4 篇 法学
- 4 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 医学

主题

9 篇 feature extracti...
9 篇 machine learning
9 篇 training
8 篇 cameras
7 篇 computational mo...
7 篇 control design
7 篇 estimation
6 篇 robust control
6 篇 collision avoida...
6 篇 software
6 篇 sensors
5 篇 vehicle dynamics
5 篇 reinforcement le...
5 篇 roads
5 篇 three-dimensiona...
5 篇 observers
5 篇 optimization
5 篇 aircraft
5 篇 uav
5 篇 laser radar

机构

11 篇 institute for co...
8 篇 institute for co...
8 篇 s lor&#x00e1
8 篇 tv&#x00f6
5 篇 nd research netw...
5 篇 faculty of infor...
5 篇 institute for co...
5 篇 institute for co...
4 篇 institute for co...
4 篇 institute for co...
4 篇 department of co...
4 篇 institute for co...
4 篇 systems and cont...
3 篇 budapest hungary
3 篇 fraunhofer austr...
3 篇 budapest univers...
3 篇 faculty of infor...
3 篇 aerospace and en...
3 篇 epic innolabs no...
3 篇 department of au...

作者

25 篇 péter gáspár
16 篇 balázs németh
14 篇 peter bauer
10 篇 júlia bergmann
9 篇 dániel fényes
9 篇 tamás hegedűs
9 篇 dávid gyulai
8 篇 tamas zsedrovits
8 篇 akos zarandy
7 篇 zoltán szabó
7 篇 balint vanek
6 篇 antal hiba
5 篇 ter g&#x00e1
5 篇 viola gallina
5 篇 jozsef bokor
5 篇 józsef bokor
5 篇 tamas sziranyi
5 篇 daniel marx
5 篇 p&#x00e9
5 篇 csáji balázs csa...

语言

204 篇 英文
3 篇 中文
2 篇 其他

检索条件"机构=SZTAKI: Institute for Computer Science and Control"

共 209 条记录，以下是171-180 订阅

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

详细简洁

排序：

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels 15

Characterizing the easy-to-find subgraphs from the viewpoint...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Bart M. P. Jansen Daniel Marx University of Bergen Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI)

ISBN: (纸本)9781510813311

We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertexdisjoint subgraphs isomorphic to H. For every graph class F, let F-Subgraph Test and F-Packing be the special cases of the two problems where H is restricted to be in F. Our goal is to study which classes F make the two problems tractable in one of the following senses: 1. (randomized) polynomial-time solvable, 2. admits a polynomial (many-one) kernel (that is, has a polynomial-time preprocessing procedure that creates an equivalent instance whose size is polynomially bounded by the size of the solution), or 3. admits a polynomial Turing kernel (that is, has an adaptive polynomial-time procedure that reduces the problem to a polynomial number of instances, each of which has size bounded polynomially by the size of the solution). To obtain a more robust setting, we restrict our attention to hereditary classes F. It is known that if every component of every graph in F has at most two vertices, then F-Packing is polynomialtime solvable, and NP-hard otherwise. We identify a simple combinatorial property (every component of every graph in F either has bounded size or is a bipartite graph with one of the sides having bounded size) such that if a hereditary class F has this property, then F-Packing admits a polynomial kernel, and has no polynomial (many-one) kernel otherwise, unless the polynomial hierarchy collapses. Furthermore, if F does not have this property, then F-Packing is either WK[1]-hard, W[1]-hard, or Long Path-hard, giving evidence that it does not admit polynomial Turing kernels either. For F-Subgraph Test, we show that if every graph of a hereditary class F satisfies the property that it is possible to delete a bounded number of vertices such that every remaining component has size at most two, then F-Subgraph Test is solvable in randomi

关键词： Fluorine (F) Seeds Turing Polynomial Kernel Hydrogen Soluble Bipartite graph Bounded Comment Polynomial time

来源：评论

学校读者我要写书评

暂无评论

Text Classification Kernels for Quality Prediction over the C3 Data Set

Text Classification Kernels for Quality Prediction over the ...

引用

Proceedings of the 24th International Conference on World Wide Web

作者： Balint Daroczy David Siklois Robert Palovics Andras A. Benczur Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA SZTAKI) Budapest Hungary

ISBN: (纸本)9781450334730

We compare machine learning methods to predict quality aspects of the C3 dataset collected as a part of the Reconcile project. We give methods for automatically assessing the credibility, presentation, knowledge, intention and completeness by extending the attributes in the C3 dataset by the page textual content. We use Gradient Boosted Trees and recommender methods over the evaluator, site, evaluation triplets and their metadata and combine with text classifiers. In our experiments best results can be reached by the theoretically justified normalized SVM kernel. The normalization can be derived by using the Fisher information matrix of the text content. As the main contribution, we describe the theory of the Fisher matrix and show that SVM may be particularly suitable for difficult text classification tasks.

关键词： kernel methods information retrieval document classification

来源：评论

学校读者我要写书评

暂无评论

Parameterizing the Permanent: genus, apices, minors, evaluation mod 2~k

Parameterizing the Permanent: genus, apices, minors, evaluat...

引用

IEEE Annual Symposium on Foundations of computer science

作者： Radu Curticapean Mingji Xia Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences

ISBN: (纸本)9781467381925

We identify and study relevant structural parameters for the problem PerfMatch of counting perfect matchings in a given input graph G. These generalize the well-known tractable planar case, and they include the genus of G, its apex number (the minimum number of vertices whose removal renders G planar), and its Hadwiger number (the size of a largest clique minor). To study these parameters, we first introduce the notion of combined matchgates, a general technique that bridges parameterized counting problems and the theory of so-called Holants and matchgates: Using combined matchgates, we can simulate certain non-existing gadgets F as linear combinations of t = O(1) existing gadgets. If a graph G features k occurrences of F, we can then reduce G to t~k graphs that feature only existing gadgets, thus enabling parameterized reductions. As applications of this technique, we simplify known 4~gn~(O(1)) time algorithms for PerfMatch on graphs of genus g. Orthogonally to this, we show #W[1]-hardness of the permanent on k-apex graphs, implying its #W[1]-hardness under the Hadwiger number. Additionally, we rule out n~(o(k/log k)) time algorithms under the counting exponential-time hypothesis #ETH. Finally, we use combined matchgates to prove {direct+}W[1]-hardness of evaluating the permanent modulo 2~k, complementing an O(n~(4k-3)) time algorithm by Valiant and answering an open question of Bjorklund. We also obtain a lower bound of n~(Ω(k/log k)) under the parity version {direct+}ETH of the exponential-time hypothesis.

关键词： Permanent Perfect matchings Parameterized counting complexity Genus Apex number Graph minors Hadwiger number Modular counting complexity Matchgates

来源：评论

学校读者我要写书评

暂无评论

Computation of a lower bound for the induced ℒ2 norm of LPV systems

Computation of a lower bound for the induced ℒ2 norm of LPV...

引用

American control Conference (ACC)

作者： Tamas Peni Peter Seiler Control Laboratory of Institute for Computer Science and Control (MTA-SZTAKI) Budapest Hungary Aerospace and Engineering Mechanics Department University of Minnesota

Determining the induced ℒ 2 norm of a linear, parameter-varying (LPV) system is an integral part of many analysis and robust control design procedures. In general, this norm cannot be determined explicitly. Most prior work has focused on efficiently computing upper bounds for the induced ℒ 2 norm. This paper presents a complementary algorithm to compute lower bounds for this norm. The proposed approach is based on restricting the parameter trajectory to be a periodic signal. This restriction enables the use of recent results for exact calculation of the ℒ 2 norm for a periodic time varying system. The proposed lower bound algorithm has two benefits. First, the lower bound complements standard upper bound techniques. Specifically, a small gap between the bounds indicates that further computation, e.g. upper bounds with more complex Lyapunov functions, is unnecessary. Second, the lower bound algorithm returns a worst-case parameter trajectory for the LPV system that can be further analyzed to provide insight into the system performance. Numerical examples are provided to demonstrate the applicability of the proposed approach.

关键词： Trajectory Upper bound Optimization Processor scheduling Standards Linear systems Differential equations

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Based Session Drop Prediction in LTE Networks and its SON Aspects

Machine Learning Based Session Drop Prediction in LTE Networ...

引用

IEEE Vehicular Technology Conference

作者： Balint Daroczy Peter Vaderna Andras Benczur Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI) Ericsson Research Management & Operation of Complex Systems

ISBN: (纸本)9781479980895

Abnormal bearer session release (i.e. bearer session drop) in cellular telecommunication networks may seriously impact the quality of experience of mobile users. The latest mobile technologies enable high granularity real-time reporting of all conditions of individual sessions, which gives rise to use data analytics methods to process and monetize this data for network optimization. One such example for analytics is Machine Learning (ML) to predict session drops well before the end of session. In this paper a novel ML method is presented that is able to predict session drops with higher accuracy than using traditional models. The method is applied and tested on live LTE data offline. The high accuracy predictor can be part of a SON function in order to eliminate the session drops or mitigate their effects.

关键词： Session drop Machine Learning Self-Organizing Network (SON)

来源：评论

学校读者我要写书评

暂无评论

Direction selective vector field convolution for contour detection

Direction selective vector field convolution for contour det...

引用

作者： Manno-Kovacs, Andrea Institute for Computer Science and Control MTA SZTAKI Budapest Hungary

ISBN: (纸本)9781479957514

Active contour methods are widely used for efficient contour detection. This paper proposes a novel contribution for the Harris based Vector Field Convolution (HVFC) method, using the orientation information of feature points in the image by analyzing the gradient information in the small neighborhood. Based on the orientation information, relevant edges are emphasized and an improved edge map is used in the iterative process. The main advantage of the introduced Directional HVFC (DHVFC) method is the ability of exploiting orientation information for increased contour detection accuracy even in case of high curvature boundaries and strong background clutter. The quantitative and qualitative evaluation and comparison with other state-of-the-art methods show that the additional directional information increases the detection performance. © 2014 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for distant aircraft detection

A novel algorithm for distant aircraft detection

引用

International Conference on Unmanned Aircraft Systems (ICUAS)

作者： Akos Zarandy Tamas Zsedrovits Borbala Pencz Mate Nameth Balint Vanek Hungarian Academy of Sciences (MTA SZTAKI) Institute for Computer Science and Control Budapest Hungary Faculty of Information Technology and Bionics Pazmany Peter Catholic University Budapest Hungary

ISBN: (纸本)9781479960118

In this paper a novel algorithm for distant aircraft detection for visual sense-and-avoid for UAV is presented. The algorithm uses local edge density to partition the frame into two types of regions. The first type is the unstructured or homogeneous part like sky region and the second part where there is a structured background, like high contrast clouds or terrain regions. The airplanes are detected on the two types of regions with different strategies. The algorithm was planned to run in an embedded environment with low power consumption, thus it can be run onboard of a small or mid-size UAV. First steps towards the GPU implementation on the nVidia Jeston TK1 development board are done and also presented in the paper.

关键词： Aircraft Collision avoidance Sensors Aircraft navigation Air traffic control Radar Cameras

来源：评论

学校读者我要写书评

暂无评论

Distant aircraft detection in sense-and-avoid on kilo-processor architectures

Distant aircraft detection in sense-and-avoid on kilo-proces...

引用

European Conference on Circuit Theory and Design, ECCTD

作者： Tamas Zsedrovits Akos Zarandy Borbala Pencz Antal Hiba Mate Nameth Balint Vanek Faculty of Information Technology and Bionics Pazmany Peter Catholic University Budapest Hungary Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA SZTAKI) Budapest Hungary

In this paper an algorithm for distant aircraft detection for visual sense-and-avoid for UAV is presented. The algorithm uses local edge density to partition the frame into two types of regions. The first type is the unstructured or homogeneous part like sky region and the second part where there is a structured background, like high contrast clouds or terrain regions. The airplanes are detected on the two types of regions with different strategies. The algorithm was planned to run in an embedded environment with low power consumption, thus it can be run onboard of a small or mid-size UAV. First steps towards the GPU implementation on the nVidia Jeston TK1 development board are done and also presented in the paper.

关键词： Aircraft Image edge detection Cameras Collision avoidance Aircraft navigation Graphics processing units Air traffic control

来源：评论

学校读者我要写书评

暂无评论

Analysis of Large Scale Parameter-Varying Systems by Using Scaled Diagonal Dominance

Analysis of Large Scale Parameter-Varying Systems by Using S...

引用

European control Conference

作者： Tamas Peni Harald Pfifer Systems and Control Laboratory of Institute for Computer Science and Control (MTA-SZTAKI) Aerospace and Engineering Mechanics Department University of Minnesota

ISBN: (纸本)9781467371605

It has been recognized recently that semidefinite optimization problems (SDP) can be cast into second order cone programs (SOCP) by replacing the positive definiteness constraints with stronger, scaled diagonal dominance (SDD) conditions. Since the scalability of SOCP solvers is much better than that of the SDPs, the new formulation allows solving large dimensional problems more efficiently. However, scaled diagonal dominant matrices form only a subset of the positive definite matrices. Hence, the new problem formulation results in more conservative solutions. This paper analyses the efficiency and conservativeness of the SDD formulation on two particular problems: the stability analysis and induced L_2 gain computation for linear parameter-varying systems. In the paper some important features of the SDD formulation are revealed and numerical examples are provided to demonstrate the efficiency of the approach.

关键词： Symmetric matrices Stability analysis Linear systems Linear matrix inequalities Matrix converters Matrix decomposition Nickel

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of camera rotation estimation algorithms for UAS sense and avoid

Performance analysis of camera rotation estimation algorithm...

引用

Workshop on Research, Education and Development of Unmanned Aerial Systems (RED-UAS)

作者： Tamas Zsedrovits Peter Bauer Mate Nemeth Borbala Jani Matyasne Pencz Akos Zarandy Balint Vanek Jozsef Bokor Faculty of Information Technology and Bionics Pázmány Péter Catholic University Budapest Hungary Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA SZTAKI) Budapest Hungary Magyar Tudomanyos Akademia Budapest Budapest HU

Several camera rotation estimator algorithms are tested in simulations and on real flight videos in this paper. The aim of the investigation is to show the strengths and weaknesses of these algorithms in the aircraft attitude estimation task. The work is part of a research project where a low cost UAV is developed which can be integrated into the national airspace. Two main issues are addressed with these measurements, one is the sense-and-avoid capability of the aircraft and the other is sensor redundancy. Both parts can benefit from a good attitude estimate. Thus, it is important to use the appropriate algorithm for the camera rotation estimation. Simulation results show that many times even the simplest algorithm can perform at an acceptable level of precision for the sensor fusion.

关键词： Cameras Algorithm design and analysis Estimation Aircraft Spatial resolution Atmospheric modeling Videos

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：