发布求助
文献互助 智能选刊 最新文献

Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)最新文献

筛选
英文 中文
MOS controlled thyristor turn-off modeling results MOS控制晶闸管关断建模结果
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766143
A. Radun, Jing Li
{"title":"MOS controlled thyristor turn-off modeling results","authors":"A. Radun, Jing Li","doi":"10.1109/SECON.1999.766143","DOIUrl":"https://doi.org/10.1109/SECON.1999.766143","url":null,"abstract":"The MOS Controlled Thyristor (MCT) is presently under development. It has been observed that the MCT's maximum controllable current depends on its gate voltage rise time. Research, using a detailed computer model of a single MCT cell, has been conducted to understand the origin of this phenomenon. It is found that the MCT cell's turn off transient is substantially different when it is turned off driven from a voltage source as compared to when it is driven from a current source. An MCT cell turning off driven from a voltage source models the situation of a single MCT cell turning off in parallel with many other MCT cells since a change in one cell's current cannot change the voltage across itself. This voltage is determined by the combined effect of the many other cells. The voltage source turn off results explains the MCT's maximum controllable current dependence on gate voltage rise time. These results also lead to the proposal that the interaction of many parallel MCT cells can be modeled using just two cells in parallel. The two cells should have very unequal current ratings. The higher current rated cell creates the voltage source for the lower current rated cell being studied.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117268182","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
Fast search algorithms for continuous speech recognition 连续语音识别的快速搜索算法
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766086
J. Zhao, J. Hamaker, N. Deshmukh, A. Ganapathiraju, J. Picone
{"title":"Fast search algorithms for continuous speech recognition","authors":"J. Zhao, J. Hamaker, N. Deshmukh, A. Ganapathiraju, J. Picone","doi":"10.1109/SECON.1999.766086","DOIUrl":"https://doi.org/10.1109/SECON.1999.766086","url":null,"abstract":"The most important component of a state-of-the-art speech recognition system is the decoder, or search engine. Given this importance, it is no surprise that many algorithms have been devised which attempt to increase the efficiency of the search process while maintaining the quality of the recognition hypotheses. In this paper, we present a Viterbi decoder which uses a two-pass fast-match search to efficiently prune away unlikely parts of the search space. This system is compared to a state-of-the-art Viterbi decoder with beam pruning in evaluations on the OGI Alphadigits Corpus. Experimentation reveals that the Viterbi decoder after a first pass fast-match produces a more efficient search when compared to a Viterbi decoder with beam pruning. However, there is significant overhead associated with the first pass of the fast-match search.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123335688","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
Electromagnetic analysis of axi-symmetric structures 轴对称结构的电磁分析
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766121
V. Rodriguez-Pereyra, A. Elsherbeni, C.E. Smith
{"title":"Electromagnetic analysis of axi-symmetric structures","authors":"V. Rodriguez-Pereyra, A. Elsherbeni, C.E. Smith","doi":"10.1109/SECON.1999.766121","DOIUrl":"https://doi.org/10.1109/SECON.1999.766121","url":null,"abstract":"Various types of antennas and transmission media for electromagnetic waves (coax cable, waveguides, etc.) exhibit symmetry around an axis of rotation and hence called bodies of revolution. By analytically extracting the known periodic behavior of the fields in the azimuth, the fields everywhere may be found by solving Maxwell's equations in a single two dimension plane. This body of revolution (BOR) approach has been used in the past with other numerical techniques for solving electromagnetic problems. Although the use of BOR approach with the finite difference time domain (FDTD) technique has already been reported, this paper presents an advanced integration of the FDTD-BOR with the perfectly matched layer absorbing boundary condition. This implementation significantly reduces the undesired reflection of outgoing waves due to the mesh truncation for a wide range of frequencies. Good agreement with published computed and measured data are obtained with the developed FDTD-BOR-PML technique for dielectric resonators and microstrip antennas. The developed algorithm is used for the analysis and design of new types of axi-symmetric antennas for personal wireless communications.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123344930","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
Computation of effective permittivity of a 2-D periodic structure by T-matrix algorithm 用t矩阵算法计算二维周期结构的有效介电常数
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766150
Feng Wu, K. Whites
{"title":"Computation of effective permittivity of a 2-D periodic structure by T-matrix algorithm","authors":"Feng Wu, K. Whites","doi":"10.1109/SECON.1999.766150","DOIUrl":"https://doi.org/10.1109/SECON.1999.766150","url":null,"abstract":"We consider the scattering of a plane wave from a finite collection of two-dimensional dielectric scatterers that are arranged periodically in free space. The T-matrix algorithm is applied to solve for the scattered field. The effective permittivity of the collection is then computed using a minimization technique. Comparisons with the Polder-Van Santen (1946) mixing formula are made.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132411865","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
Performance of channel assignment strategies in cellular systems 蜂窝系统中信道分配策略的性能
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766144
S. Azad, R. Sankar
{"title":"Performance of channel assignment strategies in cellular systems","authors":"S. Azad, R. Sankar","doi":"10.1109/SECON.1999.766144","DOIUrl":"https://doi.org/10.1109/SECON.1999.766144","url":null,"abstract":"A new algorithm for channel assignment in cellular radio communications is proposed. The algorithm uses flexible fixed channel assignment that enables heavily loaded cells having all their nominal channels busy to borrow channels from other lightly loaded cells within the cluster provided they meet the reuse constraints. The cell in the cluster that has the least number of channels in use at that instant is allocated the highest priority to lend a channel. To minimize the traffic carried on borrowed channels we use different call switching strategies at the time of call departure. The main idea is to first return a channel borrowed from a cell that has the least number of nominal channels available to use at the instance of call departure. Simulation study of the algorithm is carried out. The results show that the proposed priority-based channel borrowing algorithm performs well under both uniform and non-uniform traffic distributions.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132538460","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}
引用次数: 5
Approximating state sets using circumscribing polyhedron with fewer facets 用少面外缘多面体逼近状态集
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766080
Hian-Suan Chew, L. Holloway
{"title":"Approximating state sets using circumscribing polyhedron with fewer facets","authors":"Hian-Suan Chew, L. Holloway","doi":"10.1109/SECON.1999.766080","DOIUrl":"https://doi.org/10.1109/SECON.1999.766080","url":null,"abstract":"A polyhedron can be described using a set of linear constraints that bound the polyhedron. This paper considers the problem of approximating a polyhedron with a circumscribing polyhedron with fewer constraints. We discuss three methods to find such a circumscribing polyhedra, and compare the resulting approximation errors using sets of randomly generated polyhedra. The work is motivated by the problem of approximating state estimate sets for a class of uncertain dynamic systems.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131675690","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
Why machines prefer intelligent reasoning from all users? Amartya Sen: because they belong to the human functioning spaces 为什么机器更喜欢所有用户的智能推理?Amartya Sen:因为它们属于人类的功能空间
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766118
A. Das, N. Vonada
{"title":"Why machines prefer intelligent reasoning from all users? Amartya Sen: because they belong to the human functioning spaces","authors":"A. Das, N. Vonada","doi":"10.1109/SECON.1999.766118","DOIUrl":"https://doi.org/10.1109/SECON.1999.766118","url":null,"abstract":"A machine's functionings and people's capability to use the machine are merged into a common platform tied with A. Sen's (1995) basic principle of social welfare science. This principle says that a person's well-being depends on his or her capability to function in a given environment. This capability is earned by the person as a set of interrelated functionings. With this principle, it is argued that a machine's operation and credibility can be understood with intelligent reasoning. This intelligence does not require much of the machine's knowledge; instead, it requires awareness of the human functioning space and the capability set earned in this functioning space.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076233","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
Extending ESPRIT algorithm by using virtual array and Moore-Penrose general inverse techniques 利用虚拟阵列和Moore-Penrose一般逆技术对ESPRIT算法进行了扩展
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766147
Shu Wang, Xi-Lang Zhou
{"title":"Extending ESPRIT algorithm by using virtual array and Moore-Penrose general inverse techniques","authors":"Shu Wang, Xi-Lang Zhou","doi":"10.1109/SECON.1999.766147","DOIUrl":"https://doi.org/10.1109/SECON.1999.766147","url":null,"abstract":"High-resolution signal parameter estimation is frequently studied in many signal processing applications. In this paper, we present a new high-resolution direction and frequency simultaneous estimation algorithm, which extends the ESPRIT algorithm by using the Moore-Penrose general inverse and virtual array techniques. By using this new algorithm, the parameter pair (/spl theta//sub i/,f/sub i/) of each source can be easily obtained and automatically combined from the eigenvectors and eigenvalues. The proposed approach is simple and direct, and does not require a search procedure. It can even work well with only two sensors, no matter how many sources it is detecting. Computer simulation results are also presented to demonstrate the performance of the proposed approach.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131414713","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
Performance evaluation of the latest high speed LAN adapters: 100 Mbps token ring; Gbps Ethernet 最新高速局域网适配器性能评估:100mbps令牌环;Gbps以太网
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766100
A. Rindos, M. Loeb, Y. Hirasawa, S. Woolet, A. Zaghloul
{"title":"Performance evaluation of the latest high speed LAN adapters: 100 Mbps token ring; Gbps Ethernet","authors":"A. Rindos, M. Loeb, Y. Hirasawa, S. Woolet, A. Zaghloul","doi":"10.1109/SECON.1999.766100","DOIUrl":"https://doi.org/10.1109/SECON.1999.766100","url":null,"abstract":"We present TCP/IP throughputs and processor utilizations (both send and receive) obtained for the latest high speed LAN adapter technologies-100 Mbps token ring (with 100 Mbps Ethernet discussed, for comparison) and Gbps (Gigabit) Ethernet-for Microsoft Windows operating systems. Included is a discussion of the factors that influence observed performance, as well as methods for noninvasively measuring and tuning them.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"113 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114011662","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
Interactive multimedia on the World Wide Web 万维网上的交互式多媒体
Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300) Pub Date : 1999-03-25 DOI: 10.1109/SECON.1999.766103
S. Wunnava, T. Williams
{"title":"Interactive multimedia on the World Wide Web","authors":"S. Wunnava, T. Williams","doi":"10.1109/SECON.1999.766103","DOIUrl":"https://doi.org/10.1109/SECON.1999.766103","url":null,"abstract":"Multimedia on the World Wide Web refers to not only the text-based transfers, but in addition involves audio, and video. When a client makes a request to the server using the conventional HTTP (HyperText Transfer Protocol), the server responds by sending the requested document and terminates the established logical connection between the client and the server. The server does not maintain the status of any earlier logical connections made with the clients. However, for interactive multimedia applications involving audio, video, and messaging, a stateless protocol such as the HTTP is rather insufficient. Other plug in modules, and additional protocols are needed. Very helpful for the interactive multimedia applications is a working knowledge of the CGI (common gateway interface), Java and Java applets along with the event handling, threading and Java script procedures. For the three dimensional images, VRML (virtual reality modeling language) and the associated software modules are very useful. In this article, the authors would present and analyze the above mentioned tools needed to really accomplish interactive multimedia applications on the Web.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122389479","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书