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

On the Electron Transient Response in a 50 nm MOSFET by Ensemble Monte Carlo Simulation in Presence of the Smoothed Potential Algorithm

引用

Journal of Computational Electronics 2002年第1-2期1卷 251-255页

作者： Formicone, Gabriele Saraniti, Marco Ferry, David K. Motorola Inc. 2100 East Elliot Road TempeAZ85284 United States Electrical and Computer Engineering Department Illinois Institute of Technology ChicagoIL60616 United States Department of Electrical Engineering and Center for Solid State Electronics Research Arizona State University TempeAZ85287 United States

The inclusion of a smoothed potential algorithm within the Ensemble Monte Carlo method (EMC) to account for quantization effects in the inversion layer of a silicon n-MOSFET has been discussed by several authors. Most of the data reported deal with steady state terminal current, transconductance, and capacitance. Within this approach, the electric field acting on each particle is computed from the smoothed potential, which introduces a potential barrier underneath the gate region that pushes the carriers away from the interface, thus accounting for space quantization effects. However, in the EMC method, the electric field at the interface is also used to compute the displacement charge/current during the transient regime. In the implementation of the smoothed potential algorithm, care must be taken when computing this component of the total gate charge. We distinguish between two differently computed electric fields, one from the smoothed potential used for the charge transport and the other one computed from the real potential, as obtained from the solution of Poisson's equation, and used for the displacement charge. We propose this procedure in order to properly include space quantization effects, and at the same time avoid the inaccuracy introduced by the smoothed potential in the displacement charge. © 2002, Kluwer academic Publishers.

关键词： Electric fields

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Integrating GIS, GPS and GSM technologies for the effective management of ambulances

引用

computers, Environment and Urban Systems 2001年第3期25卷 267-278页

作者： Derekenaris, G. Garofalakis, J. Makris, C. Prentzas, J. Sioutas, S. Tsakalidis, A. Department of Computer Engineering and Informatics School of Engineering University of Patras 26500 Rion Patras Greece Computer Technology Institute Research Unit 5 PO Box 1122 26110 Patras Greece

In this paper, we describe a system offering a solution to the problem of ambulance management and emergency incident handling in the prefecture of Attica in Greece. It is based on the integration of geographic information system (GIS), global positioning system (GPS) and global system for mobile communication (GSM) technologies. The design of the system was the result of a project funded by the Greek Secretariat of research and technology. A significant operation for the handling of emergency incidents is the routing of ambulances to incident sites and then to the closest appropriate hospitals. The response time of a real-time system like ours to such queries is of vital significance. By using efficient data structures for the implementation of the graph representing the road network, the time performance of the shortest-path algorithm can be enhanced. Incorporating the efficient algorithm within the GIS will increase our system's viability. © 2001 Elsevier Science Ltd. All rights reserved.

关键词： computer applications

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Coupon collectors, q-binomial coefficients and the unsatisfiability threshold 7th

Coupon collectors, q-binomial coefficients and the unsatisfi...

引用

7th Italian Conference on Theoretical computer Science, ICTCS 2001

作者： Kaporis, Alexis C. Kirousis, Lefteris M. Stamatiou, Yannis C. Vamvakari, Malvina Zito, Michele University of Patras Department of Computer Engineering and Informatics Patras Rio26500 Greece Computer Technology Institute Kolokotroni 3 Patras26321 Greece Department of Computer Science University of Liverpool United Kingdom

ISBN: (纸本)9783540454465

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the (experimentally observed) abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to the actual threshold value. An upper bound of 4.506 was announced by Dubois et al. in 1999 but, to the best of our knowledge, no complete proof has been made available from the authors yet. We consider the problem of bounding the threshold value from above using methods that, we believe, are of interest on their own right. More specifically, we explain how the method of local maximum satisfying truth assignments can be combined withresu lts for coupon collector’s probabilities in order to achieve an upper bound for the unsatisfiability threshold less than 4.571. Thus, we improve over the best, with an available complete proof, previous upper bound, which was 4.596. In order to obtain this value, we also establish a bound on the q-binomial coefficients (a generalization of the binomial coefficients) which may be of independent interest. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

An experimental study of basic communication protocols in ad-hoc mobile networks 1

引用

5th International Workshop on Algorithm engineering, WAE 2001

作者： Chatzigiannakis, Ioannis Nikoletseas, Sotiris Paspallis, Nearchos Spirakis, Paul Zaroliagis, Christos Computer Technology Institute P.O. Box 1122 Patras26110 Greece Department of Computer Engineering and Informatics University of Patras Patras26500 Greece

ISBN: (数字)9783540446880

ISBN: (纸本)3540425004

We investigate basic communication protocols in ad-hoc mobile networks. We follow the semi-compulsory approach according to which a small part of the mobile users, the support Σ, that moves in a predetermined way is used as an intermediate pool for receiving and delivering messages. Under this approach, we present a new semi-compulsory protocol called the runners in which the members of Σ perform concurrent and continuous random walks and exchange any information given to them by senders when they meet. We also conduct a comparative experimental study of the runners protocol with another existing semicompulsory protocol, called the snake, in which the members of Σ move in a coordinated way and always remain pairwise adjacent. The experimental evaluation has been carried out in a new generic framework that we developed to implement protocols for mobile computing. Our experiments showed that for both protocols only a small support is required for efficient communication, and that the runners protocol outperforms the snake protocol in almost all types of inputs we considered. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

The unsatisfiability threshold revisited

引用

Electronic Notes in Discrete Mathematics 2001年 9卷 81-95页

作者： Kaporis, Alexis C. Kirousis, Lefteris M. Stamatiou, Yannis C. Vamvakari, Malvina Zito, Michele University of Patras Department of Computer Engineering and Informatics University Campus GR-265 04 Patras Greece Computer Technology Institute GR-262 21 Patras 61 Riga Feraiou Str. Greece Department of Computer Science University of Liverpool United Kingdom

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the experimentally observed abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to the actual threshold value. In this paper, we consider the problem of bounding the threshold value from above using methods that, we believe, are of interest on their own right. More specifically, we show how the method of local maximum satisfying truth assignments can be combined with results for the occupancy problem in random allocation schemes of balls into bins in order to achieve an upper bound for the unsatisfiability threshold less than 4.571. Thus we improve over the best, with an available complete proof, previous upper bound, which was 4.596. In order to obtain this value, we also establish a bound on the q-binomial coefficients (a generalization of the binomial coefficients) which, we believe, is of independent interest.

关键词： Complexity Phase transition Probabilistic analysis Satisfiability

来源：评论

学校读者我要写书评

暂无评论

Online DSP education: DSP for practicing engineers

Online DSP education: DSP for practicing engineers

引用

2001 ASEE Annual Conference and Exposition: Peppers, Papers, Pueblos and Professors

作者： Jackson, Joel R. Barnwell, Thomas P. Schafer, Ronald W. Williams, Douglas B. Hayes III, Monson H. Anderson, David V. Georgia Institute of Technology Department of Computer Engineering Georgia Tech Reg. Eng. Program Georgia Tech Acoustics Research Department Bell Laboratories Sch. of Elec. and Comp. Engineering Georgia Institute of Technology

This paper discusses a new approach to DSP education for practicing engineers. At Georgia Tech we have embarked on a program to merge the comprehensive nature of traditional university courses with the accessibility of network-based training to make graduate and continuing education courses accessible to both traditional students and practicing engineers in remote locations. Many of the practical problems of Internet-based courses have been addressed by using a hybrid course organization and delivery mechanism that combines the flexibility and control of a course delivered from a dentral server with the high media quality of locally delivered high-bandwidth video and audio. In addition to adapting the delivery method, we have worked with both academic faculty and industry representatives to modify existing course materials and develop special-purpose materials to fit the revised requirements of remote delivery to an audience of nontraditional students. Multiple faculty members participated in creating lecture materials to provide a unique perspective on DSP education. The course is comprised of three interconnected tracks: DSP system theory, real-time implementation principles, and laboratory exercises. The theory and real-time principles are presented in short lecture modules like the one shown below, while the laboratory exercises are performed using a DSP development board attached to the student's local computer. The use of a physical development board allows more realistic laboratory exercises to be performed than would a network-based simulation tool. Student interaction, instructor feedback, and course organization are provided through the web interface. The student interaction and hands-on aspects of the course more closely approximate a university experience rather than a typical asynchronous web-based training course.

关键词： engineering education

来源：评论

学校读者我要写书评

暂无评论

On distributed information retrieval in virtual enterprises

On distributed information retrieval in virtual enterprises

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： K. Giotopoulos B. Vassiliadis N. Bogonikolos A. Tsakalidis S. Likothanassis Computer Technology Institute Patras Greece Department of Computer Engineering and Informatics University of Patras Patras Greece ZEUS Consulting S.A Patras Greece

A new emerging area of research and technological development, set forward by the requirements of today's progressive industries, is the paradigm of virtual organisations. A meta-data repository is the logical place for uniformly retaining and managing corporate knowledge within or across different members of such organisations. Many meta-data architectures are not optimized for information retrieval purposes. Taking into consideration the existence of different data types and attributes, many problems arise when we try to successfully merge search results from heterogeneous sources. Motivated by these observations, this paper investigates a new architecture that can support multiple meta-data abstractions and that is readily extensible. Modularity and extensibility are the design emphases.

关键词： Information retrieval Virtual enterprises Information management Knowledge management informatics research and development management technology management Management information systems Information analysis Information technology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：