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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,294 篇 会议
1 篇 期刊文献

馆藏范围

1,295 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

100 篇 工学
- 34 篇 仪器科学与技术
- 26 篇 电子科学与技术（可...
- 24 篇 信息与通信工程
- 15 篇 电气工程
- 13 篇 计算机科学与技术...
- 8 篇 控制科学与工程
- 6 篇 软件工程
- 4 篇 机械工程
- 3 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
10 篇 理学
- 10 篇 系统科学
6 篇 管理学
- 6 篇 管理科学与工程(可...
2 篇 文学
- 2 篇 新闻传播学
1 篇 医学
- 1 篇 公共卫生与预防医...

主题

146 篇 informatics
82 篇 control systems
79 篇 automation
76 篇 telecommunicatio...
71 篇 mathematical mod...
68 篇 testing
67 篇 bandwidth
67 篇 laboratories
66 篇 humans
61 篇 environmental ec...
58 篇 traffic control
57 篇 frequency
56 篇 information syst...
53 篇 power generation...
52 篇 costs
52 篇 protocols
48 篇 electronic mail
47 篇 voltage
47 篇 optical fiber ne...
46 篇 mobile communica...

机构

148 篇 budapest univers...
89 篇 department of el...
87 篇 department of au...
76 篇 department of me...
74 篇 department of te...
68 篇 budapest univers...
60 篇 department of te...
49 篇 department of co...
30 篇 department of te...
30 篇 computer and aut...
30 篇 department of el...
28 篇 department of br...
20 篇 department of co...
19 篇 department of me...
19 篇 department of au...
18 篇 department of te...
16 篇 department of el...
12 篇 department of el...
11 篇 high-speed netwo...
11 篇 department of br...

作者

27 篇 tibor berceli
25 篇 i. nagy
22 篇 tibor cinkler
22 篇 p. baranyi
20 篇 t. cinkler
18 篇 peter baranyi
18 篇 l.t. koczy
18 篇 t. berceli
17 篇 zsolt illyefalvi...
17 篇 peter korondi
16 篇 s. imre
15 篇 a.r. varkonyi-ko...
15 篇 p. korondi
14 篇 janos bito
13 篇 a. poppe
13 篇 d. tikk
13 篇 eszter udvary
13 篇 hassan charaf
13 篇 istvan nagy
13 篇 m. rencz

语言

1,274 篇 英文
21 篇 中文

检索条件"机构=Budapest University슠of슠Technology슠and슠Economics"

共 1295 条记录，以下是1051-1060 订阅

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

详细简洁

排序：

Superframe formation algorithms in 802.15.3 networks

Superframe formation algorithms in 802.15.3 networks

引用

IEEE Conference on Wireless Communications and Networking

作者： A. Torok L. Vajda Kyu-Jung Youn Sun-Do June Department of Telecommunications and Media Informatics Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Wireless PAN Technology Project Office Korea Electronics and Technology Institute Seoul South Korea

The IEEE 802.15.3 wireless standard aims to achieve high performance and scalability by using a hybrid, time-slotted MAC protocol with variable length superframes. The design of a proper superframe formation algorithm is not trivial. This can be attributed to some limitations in the possibilities of superframe resizing. Based on our findings, we propose a novel superframe formation algorithm, which avoids the pitfalls of current algorithms. A comprehensive performance analysis with various performance metrics and different types of traffic is presented in the paper. The proposed algorithm is a low complexity solution that supports power-saving and proper treatment of CBR traffic, while it provides higher channel utilization, higher error tolerance and stability.

关键词： Intelligent networks Access protocols Algorithm design and analysis Media Access Protocol Wireless application protocol Data communication Performance analysis Quality of service Heuristic algorithms Bluetooth

来源：评论

学校读者我要写书评

暂无评论

A novel shared segment protection method for guaranteed recovery time

A novel shared segment protection method for guaranteed reco...

引用

International Conference on Broadband Networks (BroadNets)

作者： J. Tapolcai P.-H. Ho D. Verchere T. Cinkler Department of Telecommunications and Media Informatics Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Department of Electrical and Computer Engineering University of Waterloo Canada Alcatel Marcoussis France

Shared segment protection (SSP), compared to shared path protection (SPP) or shared link protection (SLP), provides an optimal protection configuration, since SSP can increase the number of connections sharing the same protection segments and can reduce the restoration time in case of single link failure. This paper provides a thorough study on SSP under the GMPLS-based recovery framework, where an effective survivable routing algorithm for SSP is proposed, called shared segment protection (SSP) algorithm. The main advantage of the SSP algorithm is to reduce the high computation complexity in solving the ILP formulation first introduced in P-H. Ho et al., (2004). With an efficient iterative approach the design space is significantly reduced by excluding all the links that result intolerably long routes. The tradeoff between the price (i.e., cost representing the amount of resources, and the blocking probability) and the restoration time is extensively studied by simulations on three networks with highly dynamic traffic. It is demonstrated that the SSP algorithm can be a powerful solution in the GMPLS-based recovery with a stringent delay upper bound for achieving high availability and restorability of the transport services. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP.

关键词： Protection Iterative algorithms Space power stations Routing Iterative methods Costs Telecommunication traffic Traffic control Delay Upper bound

来源：评论

学校读者我要写书评

暂无评论

On Scheduling and Power Control in Multi-Cell Coordinated Clusters

On Scheduling and Power Control in Multi-Cell Coordinated Cl...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Norbert Reider Andras Racz Gabor Fodor Department of Telecommunications and Media Informatics Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Ericsson Research Limited Budapest Hungary Ericsson Research Limited Stockholm Sweden

Recently, tight network coordination in cellular systems has been demonstrated to improve the spectrum efficiency by means of signal processing methods. However, the performance of signal processing based multi-cell coordination is sensitive to backhaul delays, channel estimation errors and imperfections in fast link control. In this paper we consider tight network coordination for fast radio resource management (RRM) including packet scheduling, power control and modulation and coding scheme selection. We use a system level simulator to analyze the uplink performance of a multi-cell coordinated system that is built around a fast backhaul transport infrastructure for the purpose of enabling coordinated RRM rather than coordinated signal processing. We find that coordinated RRM alone can provide significant performance gains, up to 50% for cell edge and cell capacity as compared to traditional single-cell configurations and that multi-cell fast power control and modulation and coding scheme selection can significantly improve the accuracy of link adaptation in terms of signal-to-interference-and-noise (SINR) distribution, while imposing lower demands on the capacities of backhaul links compared to coordinated signal processing. Therefore RRM coordination can be an efficient complement to coordinated signal processing in multi-cell coordinated clusters.

关键词： Power control Signal processing Modulation coding Cellular networks Delay estimation Channel estimation Error correction Resource management Scheduling algorithm Analytical models

来源：评论

学校读者我要写书评

暂无评论

On uninorms with strict underlying t-norm and t-conorm

On uninorms with strict underlying t-norm and t-conorm

引用

International Symposium on Intelligent Systems and Informatics (SISY)

作者： Janos Fodor Bernard De Baets Institute of Intelligent Engineering Systems Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Department of Applied Mathematics Biometrics and Process Control Ghent University Ghent Belgium

In this paper we study uninorms with given strict underlying t-norm and t-conorm. Such uninorms are the only candidates for being represented by (additive) generator functions. We prove that representability depends exclusively on the value of the uninorm at a single point in the ldquoremainingrdquo open part of the unit square. The uninorm turns out to be representable if and only if this single value is strictly between the two bounds min and max. If this single value equals to one of the bounds then all values are equal to the same bound at any point in that ldquoremainingrdquo part.

关键词： Intelligent systems Systems engineering and theory Biometrics Process control Diagnostic expert systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Dynamic Availability-Aware Survivable Routing Architecture with Partial Restorability

A Novel Dynamic Availability-Aware Survivable Routing Archit...

引用

Biennial Symposium on Communications, QBSC

作者： Pin-Han Ho J. Tapolcai A. Haque S. Shen T. Cinkler M. Desroches Department of Electrical and Computer Engineering University of Waterloo Canada Department of Telecommunication and Media Informatics Budapest University슠of슠Technology슠and슠Economics Hungary Bell Canada Limited Hamilton Canada

This paper introduces a novel dynamic availability-aware survivable routing architecture in the modern communication networks, which aims to provide much finer design granularity by having a partially restorative protection path for a working path. Simulation is conducted to verify the proposed scheme on a special case where a single protection path is equipped to each working path, where an integer linear program (ILP) is formulated and solved for the highlighted problem. A number of legacy schemes that focus on achieving 100% restorability in a specific failure scenario, such as no protection, shared path protection (SPP), 1+1 protection, and dual-failure protection, are also taken in the simulation for comparison. In the case study, we have seen merits in the proposed architecture which can significantly reduce the required redundancy in the effort of achieving a specific availability constraint for each connection request

关键词： Routing Protection Availability Computer architecture Bandwidth Cost function Constraint optimization Computer networks Telecommunication computing Design engineering

来源：评论

学校读者我要写书评

暂无评论

An SVD based modification of the Adaptive Inverse Dynamics Controller

An SVD based modification of the Adaptive Inverse Dynamics C...

引用

International Symposium on Applied Computational Intelligence and Informatics ( SACI)

作者： J.K. Tar J.F. Bito I.J. Rudas S. Preitl Radu-Emil Precup Institute of Intelligent Engineering Systems Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Department of Automation and Applied Informatics Polytechnic University of Milan Timisoara Romania

The most popular classical adaptive robot control methods as the Adaptive Inverse Dynamics Control or the Slotine-Li Adaptive Robot Controller are constructed on the basis of exact knowledge on the form of the equations of motion, and on the application of Lyapunov's 2 nd Method. This generic technique makes it possible to guarantee the stability of the controlled system using only simple estimations without having any detailed knowledge on its motion that is a great advantage. However, in the application of this elegant technique the main problem is the proper construction of the Lyapunov function. Formal elegance usually has the price of limitations in the applicable trajectory tracking policy and in the presence of a huge number of the constant control parameters set in the commencement of the controller's operation. In the here presented approach the Adaptive Inverse Dynamics control is simplified by evading the use of the Lyapunov function and the inversion of the actual estimated inertia matrix by utilizing the information encoded in the equations of motion in a quite different manner. The advantage is the limitation in the number of the fixed control parameters, and possibility for faster parameter tuning due to the evasion of the most critical step of the original method, i.e. the inversion of the actual estimation of the inertia matrix the singularity of which can interrupt and stop the whole control process. The modified control is also illustrated by numerical examples calculated via simulation for a simple Classical Mechanical System as a paradigm.

关键词： Programmable control Adaptive control Motion control Robot control Equations Motion estimation Lyapunov method Process control Stability Control systems

来源：评论

学校读者我要写书评

暂无评论

A meta-heuristic approach for non-bifurcated dedicated protection in WDM optical networks

A meta-heuristic approach for non-bifurcated dedicated prote...

引用

International Workshop on Design of Reliable Communication Networks (DRCN)

作者： Péter Soproni Péter Babarczi János Tapolcai Tibor Cinkler Pin-Han Ho Department of Telecommunications and Media Informatics Budapest University슠of슠Technology슠and슠Economics Hungary Department of Electrical and Computer Engineering University of Waterloo Canada

Survivable routing serves as an important issue in core optical mesh networks. Operators are mainly interested in the protection of single link failures and a set of multiple link failures with high failure probability. In order to consider failure dependencies among links, Shared Risk Link Groups (SRLG) are defined in the network. Against a given set of SRLG failures the connection needs to be resilient to fulfill the required quality of service (QoS) level. Currently, 1+1 dedicated path protection is reported to be the most widely deployed network resilience mechanism because it offers instantaneous recovery from network failures. However, 1+1 protection in most cases unable to provide SRLG-disjoint paths, thus, it is not resilient against all SRLG failures under consideration. In this paper, a novel Bacterial Evolutionary Algorithm for the Integer (or non-bifurcated) Generalized Dedicated Protection (IGDP) is introduced to protect each SRLG in the operator's list. The proposed evolutionary algorithm aims to minimize the amount of reserved spare bandwidth. As a result, the solution is resilient against all failures in the SRLG list while the simplicity of 1+1 protection in signaling and switching is maintained. Extensive simulation is conducted to compare our evolutionary approach with previously reported optimal and heuristic solutions for the IGDP problem, by which its merits are further demonstrated.

关键词： Microorganisms Routing Cloning Topology Network topology Bandwidth Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Estimates on the packet loss ratio via queue tail probabilities

Estimates on the packet loss ratio via queue tail probabilit...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： A. Gyorgy T. Borsos Department of Computer Science and Information Theory Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Traffic Analysis and Network Performance Laboratory Ericsson Limited Budapest Hungary

We consider the connection between the packet loss ratio (PLR) in a switch with a finite buffer of size L and the tail distribution of the corresponding infinite buffer queue Q. In the literature the PLR is often approximated with the tail probability P(Q > L), and in practice the latter is often a good conservative estimate on the PLR. Therefore, efforts have mainly focused on finding bounds and asymptotic expressions concerning the tail probabilities of the infinite queue. However, our first result shows that the ratio PLR/P(Q > L) can be arbitrary, in particular the PLR can be larger than the tail probability. We also determine an upper bound on this ratio yielding an upper bound on the PLR using the tail distribution of the infinite queue. The bound is fairly tight for certain traffic patterns. In many situations it clearly improves the estimation with the tail probability, and it is rarely significantly larger than the estimate P(Q > L), while it is an upper bound. On the other hand, if the PLR is much smaller than P(Q > L), then our bound is usually loose. For this case a practically good approximation on their ratio is proposed.

关键词： Tail Traffic control Upper bound Quality of service Probability distribution Telecommunication traffic Switches Computer science Information theory Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Piecewise linear parameter varying mathematical model of a Hybrid Solar Vehicle

Piecewise linear parameter varying mathematical model of a H...

引用

IEEE Symposium on Intelligent Vehicle

作者： Zsuzsa Preitl Balazs Kulcsar Jozsef Bokor Department of Control and Transport Automation Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary

The paper presents a mathematical model for a series architecture hybrid solar vehicle, based on previous versions. A quasi piecewise linear parameter varying (qPWLPV) model was built, both in continuous and in discrete time. The advantage of the new modeling approach lies in a better handling of nonlinearities and answering model related analytical questions. Controllability and stability of the switching system was studied. The model was tested throughout open loop simulations, it can further be used for developing control strategies for energy optimization.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Supervised training algorithms for B-spline neural networks and fuzzy systems

Supervised training algorithms for B-spline neural networks ...

引用

Conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： A.E. Ruano C. Cabrita J.V. Oliveira D. Tikk L.T. Koczy Department of Electronic Engineering and Computing Unit of Exact Science University of Algarve Faro Portugal Department of Telecommunications and Telematics Budapest University슠of슠Technology슠and슠Economics Budapest Hungary

Complete supervised training algorithms for B-spline neural networks and fuzzy rule-based systems are discussed. By introducing the relationships between B-spline neural networks and Mamdani (satisfying certain assumptions) fuzzy model, training algorithms developed initially for neural networks can be adapted to fuzzy systems. The standard training criterion is reformulated, by separating the linear and nonlinear parameters. By employing this reformulated criterion with the Levenberg-Marquardt algorithm, a new training method, offering a fast rate of convergence is obtained. It is also shown that the standard error-back propagation algorithm, the most common training method for this class of systems, exhibits a very poor performance.

关键词： Spline Neural networks Fuzzy systems Multi-layer neural network Fuzzy neural networks Jacobian matrices Knowledge based systems Convergence Multilayer perceptrons Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共130页 << < 102 103 104 105 106 107 108 109 110 111 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：