{"title":"Anechoic chamber testing enters into a new era using fiber-optic technology: unique issues and experiences","authors":"M. A. Mohd, C.E. Steadman, K. Render","doi":"10.1109/SECON.1994.324338","DOIUrl":"https://doi.org/10.1109/SECON.1994.324338","url":null,"abstract":"This paper introduces the anechoic chamber as a vital electromagnetic interference (EMI) and electromagnetic compatibility (EMC) test facility. To overcome the shortcomings of coaxial cables for EMI measurements fiber-optic network designs relating to an anechoic chamber are also considered. Furthermore, this paper discusses some of the unique issues and experiences associated with using the fiber-optic technology for data transfer in an anechoic chamber environment.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125789971","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}
{"title":"A fixed point implementation of the backpropagation learning algorithm","authors":"R.K. Presley, R. Haggard","doi":"10.1109/SECON.1994.324283","DOIUrl":"https://doi.org/10.1109/SECON.1994.324283","url":null,"abstract":"In hardware implementations of digital artificial neural networks, the amount of logic that can be utilized is limited. Due to this limitation, learning algorithms that are to be executed in hardware must be implemented using fixed point arithmetic. Adapting the backpropagation learning algorithm to a fixed point arithmetic system requires many approximations, scaling techniques and the use of lookup tables. These methods are explained. The convergence results for a test example using fixed point, floating point and hardware implementations of the backpropagation algorithm are presented.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265385","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}
{"title":"Throughput improvement through dynamic load balance","authors":"H.B. More, Jie Wu","doi":"10.1109/SECON.1994.324331","DOIUrl":"https://doi.org/10.1109/SECON.1994.324331","url":null,"abstract":"Dynamic load balance improves the performance of a multiprocessor system by reallocating tasks such that all the processors are evenly loaded. Problems in several areas qualify for dynamic load balance. The paper studies the performance of load balancing while solving a branch and bound problem using hypercubes. If the hypercube has link faults, special measures need to be taken to balance the load. An algorithm for load balancing in the presence of link faults is described. Performance improvement obtained with the help of load balancing using the link-fault-tolerant algorithm is observed through simulation.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129696722","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}
{"title":"A neural network-based text independent voice recognition system","authors":"K. Kuah, M. Bodruzzaman, S. Zein-Sabatto","doi":"10.1109/SECON.1994.324282","DOIUrl":"https://doi.org/10.1109/SECON.1994.324282","url":null,"abstract":"A text-independent voice recognition experiment was conducted using an artificial neural network. The speech data were collected from three different speakers uttering thirteen different words. Each word was repeated ten times. The speech data were then pre-processed for signal conditioning. A total of 12 feature parameters were obtained from Cepstral coefficients via a linear predictive coding (LPC). These feature parameters then served as inputs to the neural network for speaker classification. A standard two-layer feedforward neural network was trained to identify different feature sets associated with the corresponding speakers. The network was tested for the remaining unseen words in text-independent mode. The results were very promising with a voice recognition accuracy of more than 90%. The success rate could be increased by adding more utterances from each speaker.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128904744","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}
{"title":"Performance of a frequency hop spread spectrum multiple access radio network in a factory environment","authors":"A. Orichi, D. Koch","doi":"10.1109/SECON.1994.324315","DOIUrl":"https://doi.org/10.1109/SECON.1994.324315","url":null,"abstract":"Wireless indoor networks which can provide terminal portability to any node in the network, promise to reduce significantly the expense and troubles of wiring and rewiring associated with wired networks. Since wireless systems operate on bandlimited channels and have to adjust to the constant fluctuations of the indoor environment (i.e., multipath and intermittent fading), any viable wireless technology should be able to accommodate those constraints. A very attractive wireless technology for indoor networks is spread spectrum because of its ability to mitigate multipath fading and incorporate multiple access for bandwidth efficient sharing. A simulated model for a noncoherent FH/BFSK spread spectrum multiple access indoor network in a factory environment is developed. The system is evaluated based on the bit error rate (BER) performance for various chip rates, data rates, and number of hopping frequencies for a given signal to noise plus interference density ratio and the results are compared to theoretical upper and lower bounds.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117288414","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}
{"title":"An approach to independent joint adaptive control for the TUMA I","authors":"Y.D. Fuentes, E. Barbieri","doi":"10.1109/SECON.1994.324325","DOIUrl":"https://doi.org/10.1109/SECON.1994.324325","url":null,"abstract":"The design of an independent joint adaptive controller for the robotic manipulator TUMA I is outlined in this paper. The TUMA I is a four-degree-of-freedom planar redundant arm built as a testbed at Tulane University. The development of an adaptive independent joint control for a robotic manipulator is outlined when the mathematical model parameters of the manipulator system may not be available and an alternative to the well-known computed torque adaptive control approach can be found useful. The controller design presented is based on heuristic adaptive control methods for servomechanisms using the Diophantine equation as the designing principle.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127229070","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}
{"title":"Learning control applied to feedforward compensator tuning","authors":"Doyoung Jeon","doi":"10.1109/SECON.1994.324360","DOIUrl":"https://doi.org/10.1109/SECON.1994.324360","url":null,"abstract":"When a robot performs the same task repeatedly, a learning controller can enhance the performance of the system significantly. The function of the learning controller is to update the feedforward compensator which cancels the dynamics of robot manipulators and friction of each joints. The feedforward compensator especially plays an important role in the contact force control of robot manipulators with a rigid workpiece. In this paper, the learning algorithm which guarantees the asymptotic stability is studied and used to refine the feedforward compensator. Experiments with a two degree of freedom direct drive robot confirms the effectiveness of the algorithm.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126719109","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}
{"title":"Stationary and cyclostationary random process models","authors":"B. J. Skinner, F. Ingels, J. P. Donohoe","doi":"10.1109/SECON.1994.324356","DOIUrl":"https://doi.org/10.1109/SECON.1994.324356","url":null,"abstract":"Cyclostationary random process modeling is an area of signal processing that has been the subject of numerous journal papers. W.A. Gardner (1988) devoted half of a book to cyclic spectral analysis. Cyclostationarity, however, has not received very much attention at regional conferences in the recent past, which implies that it is not being utilized by many practising engineers. Therefore, this paper reviews both stationary and cyclostationary random process models. It will be seen that cyclostationary models are more complete than stationary random process models for many manmade signals. Since these signals are best modeled as cyclostationary random processes, signal processors that exploit cyclostationarity can, in principle, have performance superior to traditional processors that utilize only stationary statistical models.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116980492","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}
{"title":"Accelerating conversations for fault-tolerant concurrent software","authors":"Lixin Gao, E. Fernández","doi":"10.1109/SECON.1994.324330","DOIUrl":"https://doi.org/10.1109/SECON.1994.324330","url":null,"abstract":"Concurrency adds an additional dimension to the problem of developing fault-tolerant software. One of the fundamental approaches for this purpose is the 'conversation'. However, the need for synchronization at the exit from a conversation has a negative effect on performance. The scheme proposed in this paper accelerates conversations by using a special process-a recovery metaprogram (RMP)-which is executed on a separate layer of abstraction-the recovery layer. The RMP, by having access to the history of all interprocess communications, can allow a process that passes its acceptance test to proceed conditionally. If the conditional or any of the other processes does not pass its acceptance test, the conversation must recover and any interactions of the conditional process must be erased. Also, processes which have not reached their acceptance tests can trigger recovery immediately, without waiting for the other processes to get to their individual acceptance tests. This paper presents an architecture and a set of algorithms to implement these ideas.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114269888","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}
{"title":"A genetic algorithm-based approach to economic dispatch of power systems","authors":"H. Ma, A. El-Keib, Robert E. Smith","doi":"10.1109/SECON.1994.324300","DOIUrl":"https://doi.org/10.1109/SECON.1994.324300","url":null,"abstract":"In view of the Clean Air Act (CAA) of 1990, the economic dispatch problem considering the compensating generation plan provided in the Act is nonlinear, ill-structured and multimodal. This paper presents a genetic algorithm (GA) based approach to solve this problem. Test results show that the genetic algorithm-based approach produces significantly better solutions compared against those obtained using the standard economic dispatch approach. It also proves the robustness of this algorithm in solving this type of optimization problem.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114683800","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}