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

IEEE SoutheastCon, 2004. Proceedings.最新文献

筛选
英文 中文
Class D Switching Power Amplifiers: Theory, Design, and Performance D类开关功率放大器:理论、设计和性能
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287908
M. Bloechl, M. Bataineh, D. Harrell
{"title":"Class D Switching Power Amplifiers: Theory, Design, and Performance","authors":"M. Bloechl, M. Bataineh, D. Harrell","doi":"10.1109/SECON.2004.1287908","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287908","url":null,"abstract":"Switching, or class D, amplifiers represent a source of untapped potential for efficient, high power amplification. They are mostly suited for mobile and portable applications. In an effort to better understand these amplifiers, this project examines the theory, design, and performance of these circuits. As a result, it was determined that Class D amplifiers are not as difficult to design and build as commonly believed. The output sound quality of a well-designed class D audio amplifier is comparable to many high fidelity conventional sound systems. D class amps typically have 90-95% efficiency at rated power compared to conventional audio amps, which have 65-70% efficiency ratings. Most importantly, these benefits are available in a smaller, more cost-effective package due to the switching amplifier¿s high efficiency and capability for integration.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639664","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}
引用次数: 20
Deadly Sins of Technical Documentation 技术文档的致命之罪
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287934
T. Rivera, A. Tate, S. Will
{"title":"Deadly Sins of Technical Documentation","authors":"T. Rivera, A. Tate, S. Will","doi":"10.1109/SECON.2004.1287934","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287934","url":null,"abstract":"During the latter-half of 2003, the authors embarked on a project aimed at establishing objective answers to a seemingly ethereal but straightforward question: by what criteria can you tell you have produced a high-quality document? In the process of their research, the authors discovered there were consistent patterns of clear and obvious errors to be avoided when producing technical documentation; this paper is an effort to share their conclusions. While their particular area of interest is technical documentation within the realm of software engineering, their findings have broader applicability.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127507020","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}
引用次数: 4
An Algorithm for Swarm-based Color Image Segmentation 一种基于群体的彩色图像分割算法
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287902
Charles E. White, G. Tagliarini, S. Narayan
{"title":"An Algorithm for Swarm-based Color Image Segmentation","authors":"Charles E. White, G. Tagliarini, S. Narayan","doi":"10.1109/SECON.2004.1287902","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287902","url":null,"abstract":"Segmentation of nontrivial color images is one of the most difficult tasks in digital image processing. This paper presents a novel color image segmentation algorithm, which uses a biologically inspired paradigm known as swarm intelligence, to segment images based on color similarity. The swarm algorithm employed uses image pixel data and a corresponding segment map to form a context in which stigmergy can occur. The emergent property of the algorithm is that connected segments of similar pixels are found and may later be referenced. We demonstrate the algorithm by applying it to the task of segmenting digital images of butterflies for the purpose of automatic classification.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125416513","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}
引用次数: 18
Animated Agents: Motivational Consequences 动画代理:动机后果
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287905
J. Ventura, M. Ventura
{"title":"Animated Agents: Motivational Consequences","authors":"J. Ventura, M. Ventura","doi":"10.1109/SECON.2004.1287905","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287905","url":null,"abstract":"This study identifies animated agents that communicate effectively with learners in a multimedia learning environment. It is based on the social interaction of engineering students with a variety of animated agents that have features and gestures that range from bird-like to human-like. A range of agents with similar non-verbal cues presented engineering principles to students. Then, an evaluation of the students¿ perception of the animated agents, along with learning gains, provided measures for this discussion. New technology has provided the educational community with a variety of animated agents that are compatible with mainstream educational software. In many educational settings, animated agents readily integrate into Microsoft PowerPoint and Web-based instructional programs. Moreover, animated agents have proven to be effective in a variety of educational environments and learning domains. This study focuses on the use of animated agents to teach circuit analysis.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122417578","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
Finding Family Relationship in Hospital Database Using Intelligent Agent 利用智能代理在医院数据库中查找家庭关系
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287917
M. Swain, Young-Gyun Kim
{"title":"Finding Family Relationship in Hospital Database Using Intelligent Agent","authors":"M. Swain, Young-Gyun Kim","doi":"10.1109/SECON.2004.1287917","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287917","url":null,"abstract":"For the last few decades almost all hospitals have been keeping patient data in computerized database systems. One of the current problems in hospital databases is finding family hierarchy. Finding such family relationships by human operators is possible, but it can be a tedious and time consuming task when the database is extremely large. This study focuses on the appropriate data mining techniques that can be used in support of an intelligent agent in a hypothetical hospital database. A model for evaluating the genetic relationship in hospital databases with uncertainty using Hugin API will be discussed.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128498731","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
An Adaptive Noise Canceller Using Error Nonlinearities in the LMS Adaptation 基于误差非线性的LMS自适应消噪方法
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287943
Z. Ramadan, A. Poularikas
{"title":"An Adaptive Noise Canceller Using Error Nonlinearities in the LMS Adaptation","authors":"Z. Ramadan, A. Poularikas","doi":"10.1109/SECON.2004.1287943","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287943","url":null,"abstract":"This paper introduces a new adaptive noise canceller (ANC) using a modified least mean-square (LMS) algorithm that applies nonlinearities to the error signal in the LMS update equation. The proposed algorithm for ANCs can be viewed as a variable step-size LMS algorithm, in which the step-size is inversely proportional to the square norm of the error vector which has an increasing length. With an appropriate choice of the dimensionless adaptation constant step-size, a trade-off between speed of convergence and misadjustment can be achieved. The proposed algorithm is simulated using different noise power levels for both stationary and nonstationary noise environments. Simulation results, carried out using a real speech, clearly demonstrate the superiority of the proposed algorithm over many other algorithms in achieving small values of steady-state excess mean-square error with high rates of convergence in stationary as well as nonstationary noise environments.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128605071","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}
引用次数: 17
Utilization of Cellular Automata in the DNA Signal Search Problem 细胞自动机在DNA信号搜索问题中的应用
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287938
S. Providence
{"title":"Utilization of Cellular Automata in the DNA Signal Search Problem","authors":"S. Providence","doi":"10.1109/SECON.2004.1287938","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287938","url":null,"abstract":"Time-varying cellular automata (TV CA) are a form of cellular automata (CA) where the transition functions vary over time or are time de- pendent. The DNA signal search problem (DSSP) is a well-known problem in bio-informatics. Es- sentially it is the problem of searching for patterns in biological sequences. Two classical approaches utilize computation theory to exploit the power of deterministic ßnite automata (DFA). A third approach uses a ßltering technique. CA is novel in DSSP. We view a CA as an ag- gregate of NFAs or cells where the NFA transitions are modißed to account for neighboring cell states. There is a large body of literature on CA and large body of literature on NFA in DSSP. In this paper we extend the classical approach and explain the us- age of a TV CA in DSSP.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125651192","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
Mobile IP throughput studies on a wireless LAN 无线局域网中移动IP吞吐量的研究
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287922
A. K. Parmeswaran, Ravi Sankar
{"title":"Mobile IP throughput studies on a wireless LAN","authors":"A. K. Parmeswaran, Ravi Sankar","doi":"10.1109/SECON.2004.1287922","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287922","url":null,"abstract":"The evolution of TCP has been primarily geared to support wired networks. With the increased usage and popularity of wireless networks, it is prudent to examine the effect of these modifications on wireless data transfers. This project studies the effect of some of the different flavors of TCP on the throughput of FTP data to a Mobile node. The Mobile IP protocol is the mobility mechanism used in this simulation. The NS2 simulator is programmed to use a wired-cum-wireless network topology. Many variants of TCP are used for the simulation and the data transferred and signaling traffic generated are recorded. Two base stations act as agents for the mobile node. It was shown that delayed acknowledgments offered the best throughput in the simulation whereas the Vegas implementation of rep exhibited the least.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132539787","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 Methodology to Characterize Kernel Level Rootkit Exploits that Overwrite the System Call Table 描述覆盖系统调用表的内核级Rootkit漏洞的方法
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287894
J. Levine, J. Grizzard, P. Hutto, H. Owen
{"title":"A Methodology to Characterize Kernel Level Rootkit Exploits that Overwrite the System Call Table","authors":"J. Levine, J. Grizzard, P. Hutto, H. Owen","doi":"10.1109/SECON.2004.1287894","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287894","url":null,"abstract":"A cracker who gains access to a computer system will normally install some method, for use at a later time that allows the cracker to come back onto the system with root privilege. One method that a cracker may use is the installation of a rootkit on the compromised system. A kernel level rootkit will modify the underlying kernel of the installed operating system. The kernel controls everything that happens on a computer. We are developing a standardized methodology to characterize rootkits. The ability to characterize rootkits will provide system administrators, researchers, and security personnel with the information necessary in order to take the best possible recovery actions. This may also help to detect and fingerprint additional instances and prevent further security instances involving rootkits. We propose new methods for characterizing kernel level rootkits. These methods may also be used in the detection of kernel rootkits.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134044644","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}
引用次数: 15
A Temporal Relational and Object Relational Database Design Technique 时间关系和对象关系数据库设计技术
IEEE SoutheastCon, 2004. Proceedings. Pub Date : 2004-03-26 DOI: 10.1109/SECON.2004.1287898
P. Pornphol, S. Chittayasothorn
{"title":"A Temporal Relational and Object Relational Database Design Technique","authors":"P. Pornphol, S. Chittayasothorn","doi":"10.1109/SECON.2004.1287898","DOIUrl":"https://doi.org/10.1109/SECON.2004.1287898","url":null,"abstract":"The NIAM (Nijssen’s Information Analysis Methodology) conceptual schema model was originated in the 1970s and later became more popular under a new name ORM (Object Role Model). It is a fact-based conceptual schema model that can be represented by graphical diagrams or described by a formal natural language. Since all relationship types are elementary, they cannot be further decomposed. This property enables the ORM conceptual schema diagram to be transformed into 5NF relational database schemas. This paper presents temporal database application development using TORM, a temporal extension to the ORM conceptual schema model. The notions of valid time and life span are introduced to the entity type and fact type concepts. An implementation of a TORM conceptual schema on relational and object relational database schemas are also presented.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134154935","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}
引用次数: 4
下一页 尾页
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学术官方微信