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

Annual Hawaii International Conference on System Sciences (HICSS)

作者： H. Hlavacs G. Haring A. Kamra M. Bansal Institute for Computer Science and Business Informatics University of Technology Vienna Vienna Austria Department of Computer Science and Engineering Indian Institute of Technology Delhi New Delhi India

ISBN: (纸本)0769514359

Future cellular mobile networks will be limited by the number of channels available in each cell. On the other hand, new broadband applications like video telephony will demand tight quality of service guarantees that must be met by the network at all times. Thus, advanced mechanisms for allocating these channels to incoming calls with different quality of service level will be of utmost importance. In this paper we introduce a new analytical model for cell channel allocation to multiclass traffic. Being based on Markov chains, the new model exploits the multi-class property and reduces the state space dramatically, thus enabling the solution of previously unsolvable problem classes. We additionally describe CECALL, a simulator implementing several different strategies for allocating cell channels to multiclass traffic, handoff pre-reservation and degradation of low-level call classes. The results of the analytical model are used for explaining important simulation results.

关键词： Resource management Telecommunication traffic Traffic control Land mobile radio cellular systems Analytical models Quality of service Cellular networks Telephony Channel allocation State-space methods

来源：评论

学校读者我要写书评

暂无评论

e-management of supply chain: General models taxonomy

引用

Human Systems Management 2002年第2期21卷 95-113页

作者： Chandra, Charu Kumar, Sameer Smirnov, Alexander V. Industrial and Manufacturing Systems Engineering Department College of Engineering and Computer Science University of Michigan - Dearborn 4901 Evergreen Road Dearborn MI 48128-1491 United States Department of Engineering and Technology Management University of St. Thomas Mail #OSS 101 2115 Summit Avenue St. Paul MN 55105-1079 United States St. Petersburg Institute for Informatics and Automation Russian Academy of Sciences 39 14th line St. Petersburg 199178 Russia

The management of Supply Chain Systems is one of the major issues that a firm has to deal with in today's global economy. The purpose of this type of system is to transform incomplete information about the market and available resources into co-ordinated plans for production and replenishment of goods and services in the network formed by co-operating units. One of the goals of Internet-Based Management (e-management) is to facilitate transfer and sharing of data and knowledge in the context of supply chain structures. Knowledge-based modelling tools for supply chain management utilise reusable components and configure knowledge as needed, in order to assist users (agents) in decision-making. This paper discusses a generic development methodology for e-management and conceptual modelling of supply chains. For illustration, applications from the automotive industry have been utilised.

关键词： Industrial management

来源：评论

学校读者我要写书评

暂无评论

Evolutionary self-adaptive multimodel prediction algorithms of the fetal magnetocardiogram

Evolutionary self-adaptive multimodel prediction algorithms ...

引用

International Conference on Digital Signal Processing (DSP)

作者： A.V. Adamopoulos P.A. Anninos S.D. Likothanassis G.N. Beligiannis L.V. Skarlas E.N. Demiris D. Papadopoulos Department of Computer Engineering and Informatics Laboratory of Pattern Recognition University of Patras Patras Greece Department of Medicine Medical Physics Laboratory Democritus University of Thrace Alexandroupolis Greece Computer Technology Institute Patras Greece

A novel technique for the analysis, nonlinear model identification and prediction of the fetal magnetocardiogram (f-MCG) is presented. f-MCGs can be recorded with the use of specific totally non-invasive superconductive quantum interference devices (SQUID). For the analysis and classification of the f-MCG signals we introduce an intelligent method that combines the following well known advanced signal processing techniques: the genetic algorithms (GA), the multimodel partitioning (MMP) theory and the extended Kalman filters (EKF). Simulations illustrate that the proposed method is selecting the correct model structure and identifies the model parameters in a sufficiently small number of iterations and tracks successfully changes in the signal, in real time. The information provided by the proposed analysis is easily interpreted and assessed by gynecologists and consist of the clinical status of the fetus. The proposed algorithm can be parallel implemented and also a VLSI implementation is feasible.

关键词： Prediction algorithms Signal processing algorithms Superconducting magnets Magnetic analysis Signal processing Predictive models Magnetic devices Superconductivity Interference SQUIDs

来源：评论

学校读者我要写书评

暂无评论

NONSINGULAR TERMINAL SLIDING MODE CONTROL OF A CLASS OF NONLINEAR DYNAMICAL SYSTEMS

引用

IFAC Proceedings Volumes 2002年第1期35卷 161-165页

作者： Xinghuo Yu Man Zhihong Yong Feng Zhihong Guan Faculty of Informatics and Communication Central Queensland University Rockhampton QLD 4702 Australia School of Computer Engineering Nanyang Technological University Singapore Department of Electrical Engineering Harbin Institute of Technology Harbin 150006 China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei 430074 China

In this paper, a nonsingular terminal sliding mode concept is introduced for the control of a class of nonlinear dynamical systems. This nonsingular terminal sliding mode control not only enables the £nite time convergence of the system equilibrium, but also eliminates the singularity problem associated with conventional terminal sliding mode control. Simulations are presented to show the effectiveness of the design.

关键词： Sliding modes £nite time nonlinear systems stability

来源：评论

学校读者我要写书评

暂无评论

A rough set approach to measuring information granules

A rough set approach to measuring information granules

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： J.F. Peters Z. Pawlak A. Skowron Department of Electrical and Computer Engineering University of Manitoba Winnipeg MAN Canada Institute of Theoretical and Applied Informatics Polish Academy of Sciences Gliwice Poland Institute of Mathematics Warsaw University of Technology Warsaw Poland

This article introduces an approach to measures of information granules based on rough set theory. Informally, an information granule is a representation of a multiset (or bag) of real-world objects that are somehow indistinguishable, or similar, or which cause the same functionality. Examples of measures of information granules based on the rough set theory are inclusion, closeness, size, and enclosure. All of these measures are based on rough inclusion. This paper is limited to a consideration of measures of inclusion based on a straightforward extension of classical rough membership functions and closeness based on measurement of separation of equivalence classes in a partition of the universe containing information granules. Measurement of sensor-based information granules has been motivated by recent studies of sensor signals. A sensor signal is a non-empty, finite set of sample sensor signal values temporally ordered. Classification of sensor signals requires measurements of sample signal values over subintervals of time. This article introduces a rough set approach to measuring information granule inclusion and closeness.

关键词： Set theory Size measurement Intelligent sensors informatics Mathematics Electric variables measurement Water resources Helicopters Robots Time measurement

来源：评论

学校读者我要写书评

暂无评论

Information dissemination in multihop inter-vehicle networks

Information dissemination in multihop inter-vehicle networks

引用

International Conference on Intelligent Transportation

作者： T. Kosch C. Schwingenschlogl Li Ai BMW Research Department Munich Germany Department of Computer Science applied Informatics Cooperative Systems Group Munich University of Technology Germany Department of Electrical Engineering and Information Technology Institute of Communication Networks Munich University of Technology Germany Department of Electrical Engineering and Information Technology Munich University of Technology Germany

In addition to the integration of vehicles into traditional networks (e.g. access to the Internet via cellular) the Ad-hoc connection of vehicles within a limited area is a technology that promises a lot of innovative and exciting services. This paper starts with the description of some services to motivate Ad-hoc networking in the vehicular environment. It then gives an overview of the current challenges (especially routing protocols) in this field. If the geographic position of the network nodes is known, better performance can be achieved with the utilization of so called geocast routing-algorithms. An overview of geocast-routing is given and shortcomings of the existing protocols for the usage in inter-vehicle Ad-hoc networks are explained. Finally we make a proposal for a vehicle-optimized geocast routing, protocol that is based on AODV and present our prototype implementation.

关键词： Intelligent networks Spread spectrum communication Routing protocols Vehicles Mobile communication Testing IP networks Data communication Wireless LAN Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Real time nonlinear ARMA model structure identification

Real time nonlinear ARMA model structure identification

引用

International Conference on Digital Signal Processing (DSP)

作者： E.N. Demiris S.D. Likothanassis B.G. Konstadopoulou D.G. Karelis Department of Computer Engineering and Informatics University of Patras Patras Greece Computer Technology Institute (C.T.I.) Patras Greece University of Patras Artificial Intelligence Research Center Patras Greece Second Public Financial Department of Parras Hellenic Ministry of Finance Patras Greece Department of Electrical Engineering T.E.I. of Patras Patras Greece

This paper addresses the nonlinear autoregressive moving average (NARMA) identification problem in connection with the choice of the model structure (order) and computation of the time varying system coefficients. We introduce an intelligent method that is based on the reformulation of the problem in the standard state space form and the subsequent implementation of a bank of extended Kalman filters, each fitting a different order model. The problem is reduced then to selecting the true model, using the well known multi-model partitioning theory. Simulations illustrate that the proposed method is selecting the correct model order and identifies the time varying model parameters in real time, while it is insensitive to the noise variations.

关键词： Autoregressive processes Signal processing algorithms Signal processing informatics Artificial intelligence Public finance Time varying systems State-space methods Fitting Statistics

来源：评论

学校读者我要写书评

暂无评论

Run-time management policies for data intensive Web sites

Run-time management policies for data intensive Web sites

引用

1st International Workshop on Web Dynamics, WebDyn 2001, in Conjunction with the 8th International Conference on Database Theory

作者： Bouras, Christos Konidaris, Agisilaos Computer Technology Institute-CTI Kolokotroni 3 26221 Patras Greece Computer Engineering and Informatics Department University of Patras 26500 Rion Patras Greece

Web developers have been concerned with the issues of Web latency and Web data consistency for many years. These issues have become more important in our days since the accurate and imminent dissemination of information is vital to businesses and individuals that rely on the Web. In this paper, we evaluate different run-time management policies against real Web site data. We first define the meaning of data intensive Web sites and categorize them according to their hit patterns. Our research relies on real world Web data collected from various popular Web sites and proxy log files. We propose a Web site run-time management policy that may apply to various real Web site hit patterns and Web data update frequencies.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Bandwidth allocation in WDM tree networks 15

Bandwidth allocation in WDM tree networks

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Kaklamanis, C. Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Rio26500 Greece

ISBN: (纸本)0769509908

We study the problem of allocating optical bandwidth to sets of communication requests in all-optical networks that utilize Wavelength Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter-receiver paths and assigning wavelengths to each path so that no two paths going through the same fiber link use the same wavelength. Optical bandwidth is the number of distinct wavelengths. Since state-of-the-art technology allows for a limited number of wavelengths, the engineering problem to be solved is to establish communication between pairs of nodes so that the total number of wavelengths used is minimized;this is known as the wavelength routing problem. In this paper we survey recent advances in bandwidth allocation in tree-shaped WDM all-optical networks. We present hardness results and lower bounds for the general problem and the special case of symmetric communication. We give the main ideas of deterministic greedy algorithms and study their limitations. We demonstrate how we can achieve optimal and nearly-optimal bandwidth utilization in networks with wavelength converters using simple algorithms. We also present recent results about the use of randomization for wavelength routing. © 2001 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Competitive analysis of on-line randomized call control in cellular networks 15

Competitive analysis of on-line randomized call control in c...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Caragiaannis, I. Kaklamanis, C. Papaioannou, E. Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Rio26500 Greece

ISBN: (纸本)0769509908

In this paper we address an important communication issue arising in cellular (mobile) networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct frequencies. The spectrum of the available frequencies is limited;thus, efficient solutions to the call control problem are essential. The objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the number of users that communicate without signal interference. Using competitive analysis, we study the performance of algorithm p-RANDOM;an intuitive on-line randomized call control algorithm proposed previously for cellular networks. We give upper and lower bounds of its competitive ratio against oblivious adversaries as a function of the parameter p. Optimizing the upper bound function, we prove that there exists a 2.651-competitive randomized call control algorithm. In this way, we significantly improve the best known upper bound on the competitiveness of on-line randomized call control which was 2.934. © 2001 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：