Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)最新文献

筛选
英文 中文
Undedicated based mobile architecture for cellular data transfers 用于蜂窝数据传输的非专用移动架构
V. Pandiarajan, L. L. Joiner
{"title":"Undedicated based mobile architecture for cellular data transfers","authors":"V. Pandiarajan, L. L. Joiner","doi":"10.1109/SECON.2000.845419","DOIUrl":"https://doi.org/10.1109/SECON.2000.845419","url":null,"abstract":"A mobile system that can handle high bandwidth consuming data efficiently without a large investment in infrastructure is the need of the hour. This paper proposes a new architecture extending the existing cellular system with the commercial airline network to achieve this end. The broad functionality of the system architecture is explained.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117044881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Navigational task-planning of distributed cooperative robotic vehicles 分布式协作机器人车辆导航任务规划
Mohammad Mansour, Amir Shirkhodaie
{"title":"Navigational task-planning of distributed cooperative robotic vehicles","authors":"Mohammad Mansour, Amir Shirkhodaie","doi":"10.1109/SECON.2000.845570","DOIUrl":"https://doi.org/10.1109/SECON.2000.845570","url":null,"abstract":"Real time obstacle avoidance is one of the intelligent tasks for intelligent mobile robots. Mobile robots should possess the ability to act autonomously in the presence of uncertainty and to adjust their action based on sensed information. They also should be capable of accepting high level mission oriented commands, integrate several kinds of data, including task specification, able to handle information about their own state and the state of the environment too, and be capable of reasoning under uncertainty without human intervention. The proposed technique is a behavior-based approach that blends subset navigational behaviors such as reflexive, potential field and wall following techniques. We discuss each approach separately and present a technique for adaptive navigational behavior switching that is conditional based on the availability of sensory information locally and globally. Our navigation control strategies are developed fully in the FMCell environment. We present some simulation results from FMCell software.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"855 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128648184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A trust region-based approach to the solution of nonlinear circuits 基于信任域的非线性电路求解方法
W. Homsup, N. Homsup
{"title":"A trust region-based approach to the solution of nonlinear circuits","authors":"W. Homsup, N. Homsup","doi":"10.1109/SECON.2000.845575","DOIUrl":"https://doi.org/10.1109/SECON.2000.845575","url":null,"abstract":"Problem in DC nonlinear circuits and steady state solutions demonstrate slow convergence using Newton-Raphson (NR) methods. This paper presents a technique for dealing with the convergence problems that the NR methods encounter. This technique is simple and practical for finding the solution of nonlinear circuits. It is based on a trust region concept and a hyperplane as used in the predictor-corrector algorithm. The proposed algorithm can avoid the \"reversion\" phenomenon of the curve-tracing problem. Issues related to the implementation of the algorithm are analyzed and discussed. This algorithm is then compared to the NR based solver currently used in some circuit simulators. Using various examples, the comparisons show that this method can find the global solution of equations and avoid the divergence behavior encounter in the NR methods.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128046976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A relativistic windowed Fourier transform 一个相对性的加窗傅里叶变换
M. R. Karim, S. Ali, M. Bodruzzaman
{"title":"A relativistic windowed Fourier transform","authors":"M. R. Karim, S. Ali, M. Bodruzzaman","doi":"10.1109/SECON.2000.845572","DOIUrl":"https://doi.org/10.1109/SECON.2000.845572","url":null,"abstract":"Drawing upon some earlier work on coherent states of the Poincare' group in l-space and l-time dimensions, we use these states to define a relativistic windowed Fourier transform, as relativistic extension of the usual windowed Fourier transform. We discretize the resulting transform and obtain conditions under which the discretized transform can be used to reconstruct arbitrary square integrable functions. We present some numerical and graphical exercises to illustrate the theory, as well as to compare the relativistic windowed Fourier transform with the orthodox windowed Fourier transform.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Neural network-based codebook search for image compression 基于神经网络的码本搜索图像压缩
M. Bodruzzaman, R. Gupta, M. R. Karim, S. Bodruzzaman
{"title":"Neural network-based codebook search for image compression","authors":"M. Bodruzzaman, R. Gupta, M. R. Karim, S. Bodruzzaman","doi":"10.1109/SECON.2000.845604","DOIUrl":"https://doi.org/10.1109/SECON.2000.845604","url":null,"abstract":"This paper presents an efficient and fast encoding of still images using the feedforward neural network technique for codebook search. The image to be coded is first clustered into a small subset of neighboring images and then the neural network-based encoder is used to find the best matching code sequences in the codebook. This subset is then used as a candidate set and an exhaustive search is then performed within this subset to find an optimal code sequence which minimizes the perceptual error between coded and decoded images. In this work, a generic codebook is developed using non-causal differential pulse coded modulation (DPCM) with residual mean removal and vector quantization using Linde, Buzo and Gray (1980) method. The codebook is analyzed to identify a pattern in the codebook. This pattern is used to train a neural network to obtain the approximate index of the pattern in the codebook. Then, an extensive search is done around this approximate position identified by the neural network to obtain the nearest neighbor of the pattern. Since the candidate set is usually much smaller that the whole code book, there is a substantial saving in codebook search time for coding an image as compared to the traditional method using full codebook search by the LBG algorithm.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132422263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computer aided routing for complex programmable logic device manufacturing test development 复杂可编程逻辑器件制造的计算机辅助布线测试开发
N.J. Vocke, C. Stroud, J. Heath, W.R. Orso, K. Chhor
{"title":"Computer aided routing for complex programmable logic device manufacturing test development","authors":"N.J. Vocke, C. Stroud, J. Heath, W.R. Orso, K. Chhor","doi":"10.1109/SECON.2000.845463","DOIUrl":"https://doi.org/10.1109/SECON.2000.845463","url":null,"abstract":"We describe a computer aided design (CAD) tool developed to facilitate manufacturing test development for complex programmable logic devices (CPLDs). The CAD tool specifically supports manual and semi-automatic routing for the Cypress Delta 39 K series CPLD for the purpose of manufacturing testing of the programmable interconnect network within the device as well as all programmable logic functions. Two routing algorithms were developed and proved to work correctly with the best one chosen based on complexity analysis. The resultant router CAD tool supports all CPLDs in the Delta 39 K series family and produces the configuration bits necessary to program or configure the CPLD for the extensive tests that must be applied to ensure that the manufactured CPLDs are defect-free. The router has also been used extensively in the verification portion of the design process of the Delta 39 K series CPLDs. While the router is specific to a particular CPLD, the basic approach, including features and algorithms, is applicable to any CPLD or FPGA where programmable routing resources must be specified to accurately test the device and provide design verification.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130469501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Absorbing Markov Chain solution for Possion's equation Possion方程的吸收马尔可夫链解
Keming Gu, M. Sadiku
{"title":"Absorbing Markov Chain solution for Possion's equation","authors":"Keming Gu, M. Sadiku","doi":"10.1109/SECON.2000.845580","DOIUrl":"https://doi.org/10.1109/SECON.2000.845580","url":null,"abstract":"The Markov chain method for solving Laplace's equation with Dirichlet boundary condition has been discussed in a few papers. This paper presents an absorbing Markov chain method to solve Possion's equation with Dirichlet boundary condition. In the Markov chain, the fundamental matrix N defines the transient relationships for a randomly walking particle from state s/sub j/ passing through state s/sub i/ before it reaches the absorbing state. From the fundamental matrix N and the probability matrix R from non-absorbing states to absorbing states, the contributions of boundary points and interior points to the potential of internal points are defined. The absorbing Markov chain method overcomes a major disadvantage of classic Monte Carlo methods that they are only capable of calculating the potential at a single point at a time unlike other numerical methods such as finite difference and finite element methods which provide simultaneously the solution at all the grid nodes. This paper presents an example to show the accuracy of the absorbing Markov chains solution.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134371031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Sensor based terrain guidance of distributed cooperative mobile robots 基于传感器的分布式协同移动机器人地形导引
S. Aderogba, A. Shirkhodaie
{"title":"Sensor based terrain guidance of distributed cooperative mobile robots","authors":"S. Aderogba, A. Shirkhodaie","doi":"10.1109/SECON.2000.845567","DOIUrl":"https://doi.org/10.1109/SECON.2000.845567","url":null,"abstract":"Navigation in outdoor terrain is difficult due to lack of easily and uniquely identifiable landmarks. This problem is further complicated for a system with multiple robots navigating a common terrain. The paper describes a field-capable system for navigation, obstacle avoidance, simulated visual training of mobile robots, group world perception modeling using visual feedback from multiple robots, and fusion of sonar range data with vision information for the purpose of terrain learning. A neural network approach is proposed for fusion of the robots visual feedback. In this approach, each mobile robot is presumed to be equipped with one camera and sonar sensor. In the proposed technique, self-localization of the robots and localization of obstacles are performed based on the visual and sonar feedback from the neural network. Computer simulation of the technique is done with FMCell simulation software an interactive graphical simulation environment. Results of simulation runs illustrating the capabilities of this technique are provided. The technique provides a better and simplified approach for visual servoing of a multi-agent system.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127408082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fuzzy motion planning using the Takagi-Sugeno method 基于Takagi-Sugeno方法的模糊运动规划
K. Walker, A. Esterline
{"title":"Fuzzy motion planning using the Takagi-Sugeno method","authors":"K. Walker, A. Esterline","doi":"10.1109/SECON.2000.845425","DOIUrl":"https://doi.org/10.1109/SECON.2000.845425","url":null,"abstract":"The goal of this project is to examine an agent's environment in order to maximize its path planning strategy. Presented is the application of fuzzy logic concepts to the area of robot motion planning. Specifically, the approximate cell decomposition strategy is utilized because it includes some similar characteristics found in fuzzy systems. Notably, the use of linguistic variables, membership functions, and fuzzy spatial logic are topics which provide a basis in examining the usefulness of applying fuzzy logic to the area of motion planning.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115798746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Effects of misalignment on pixel averaging when scaling templates and images before scanning 扫描前缩放模板和图像时对像素平均的影响
G. O'Brien, G. Cook
{"title":"Effects of misalignment on pixel averaging when scaling templates and images before scanning","authors":"G. O'Brien, G. Cook","doi":"10.1109/SECON.2000.845601","DOIUrl":"https://doi.org/10.1109/SECON.2000.845601","url":null,"abstract":"Discusses the effect of pixel misalignment when dealing with templates and scenes which have been scaled down in size. One situation where this may occur is when templates or training vectors arise from images acquired at one range, and the image under question has been acquired at a multiple of this range. Here one could scale the template accordingly before beginning to scan the scene. Another application is where the template and scene are at the same range, but their dimensions are so great as to make the scanning process overly burdensome computationally. Here one could scale both the template and scene by the same factor before scanning to reduce the number of computations. The results of this coarse-resolution scan would then give starting points and neighborhoods for finer-resolution scans. For either of these applications, if there is pixel misalignment of the scene compared to the template, then an error is introduced and the measure of closeness of match is degraded. This is caused by the fact that the boundaries over which the pixel averaging is performed may be different for the scene than for the template. The impact of such misalignment is investigated here. An analytical expression for this effect is obtained and a means is presented for evaluating it based on the template alone, without knowledge of the scene to be scanned. Simulations are performed to test the methodology.","PeriodicalId":206022,"journal":{"name":"Proceedings of the IEEE SoutheastCon 2000. 'Preparing for The New Millennium' (Cat. No.00CH37105)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121967277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信