Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673330
R. Sebastien, Osman Abdalla Abaker Mohammed
This research work is targeted toward developing a system for visually investigating the behavior of electromagnetic fields inside the electrical machines used in the energy conversion laboratory. The proposed system is a modification of an existing one that is based upon two-dimensional finite element solutions of the laboratory machinery interconnected with three program modules to achieve an overall real-time analysis solution of these machines, while hands-on experimentation is in progress. The ultimate goal is to create a mechanism that would enhance the student's understanding of electromagnetic fields and their use in calculating performance parameters as well as operational concepts pertaining to the practical study of electrical machines.
{"title":"A real-time electromagnetic field analysis system for the energy conversion laboratory","authors":"R. Sebastien, Osman Abdalla Abaker Mohammed","doi":"10.1109/SECON.1998.673330","DOIUrl":"https://doi.org/10.1109/SECON.1998.673330","url":null,"abstract":"This research work is targeted toward developing a system for visually investigating the behavior of electromagnetic fields inside the electrical machines used in the energy conversion laboratory. The proposed system is a modification of an existing one that is based upon two-dimensional finite element solutions of the laboratory machinery interconnected with three program modules to achieve an overall real-time analysis solution of these machines, while hands-on experimentation is in progress. The ultimate goal is to create a mechanism that would enhance the student's understanding of electromagnetic fields and their use in calculating performance parameters as well as operational concepts pertaining to the practical study of electrical machines.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866789","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673279
S. Dick, D. Rundus
All programming languages permit the storage of data in a computer's memory and provide mechanisms for that data to be accessed and manipulated. Data types are implemented in a different manner by each individual programming language. Given some degree of abstraction, however, comparisons can be made between the implementations of a data type in different languages. This paper examines the character string data type, which is used to store alphanumeric data. The method by which the Ada language implements character strings is evaluated and a library package to improve Ada character string manipulation is developed. A user trial of this library package showed that approximately 70% of the programmers in the trial considered the new library package to be an improvement over the standard Ada string type. Detailed results of this trial are presented.
{"title":"Cstrings: a new string abstract data type for Ada83","authors":"S. Dick, D. Rundus","doi":"10.1109/SECON.1998.673279","DOIUrl":"https://doi.org/10.1109/SECON.1998.673279","url":null,"abstract":"All programming languages permit the storage of data in a computer's memory and provide mechanisms for that data to be accessed and manipulated. Data types are implemented in a different manner by each individual programming language. Given some degree of abstraction, however, comparisons can be made between the implementations of a data type in different languages. This paper examines the character string data type, which is used to store alphanumeric data. The method by which the Ada language implements character strings is evaluated and a library package to improve Ada character string manipulation is developed. A user trial of this library package showed that approximately 70% of the programmers in the trial considered the new library package to be an improvement over the standard Ada string type. Detailed results of this trial are presented.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134448814","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673277
K. J. Cronin, D. G. Linton
A key aspect of effective software development is the ability to quantify and predict software product quality. Software quality is the degree to which software possesses desired attributes, including portability, reliability, testability and maintainability. Insofar as software with high change traffic affects its maintainability and reliability, a model which produces a change-traffic predictor metric may be useful. The information such a model would provide could be used to help estimate the development cost and effort. Resources could be better allocated to those areas where additional attention may be required. Software changes normally occur due to new requirements or errors in the software, and so a change-traffic metric is not necessarily a good proxy for errors. Users should define their thresholds and ranges of acceptability. This paper identifies metrics collected from embedded Ada software that had a correlation with the change traffic of that software. Using multiple linear regression analysis and sample data from up to 287 embedded Ada software modules, change prediction models yielded values for the average absolute difference between predicted and actual changes per module of less than 3, and an adjusted-R/sup 2/ value of 0.57 for the full sample.
{"title":"A change prediction model for embedded software applications","authors":"K. J. Cronin, D. G. Linton","doi":"10.1109/SECON.1998.673277","DOIUrl":"https://doi.org/10.1109/SECON.1998.673277","url":null,"abstract":"A key aspect of effective software development is the ability to quantify and predict software product quality. Software quality is the degree to which software possesses desired attributes, including portability, reliability, testability and maintainability. Insofar as software with high change traffic affects its maintainability and reliability, a model which produces a change-traffic predictor metric may be useful. The information such a model would provide could be used to help estimate the development cost and effort. Resources could be better allocated to those areas where additional attention may be required. Software changes normally occur due to new requirements or errors in the software, and so a change-traffic metric is not necessarily a good proxy for errors. Users should define their thresholds and ranges of acceptability. This paper identifies metrics collected from embedded Ada software that had a correlation with the change traffic of that software. Using multiple linear regression analysis and sample data from up to 287 embedded Ada software modules, change prediction models yielded values for the average absolute difference between predicted and actual changes per module of less than 3, and an adjusted-R/sup 2/ value of 0.57 for the full sample.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116355262","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673294
S. Nagarajan, R. Sankar
In linear predictive coding (LPC) analysis, the linear predictors are computed using the classical Levinson-Durbin algorithm. But the Levinson-Durbin algorithm is a processing bottleneck as it involves the addition of inner products in the calculation of the reflection coefficients. This paper develops and reports on modifications to the algorithm used in various speech processing and coding applications for efficient implementations.
{"title":"Efficient implementation of linear predictive coding algorithms","authors":"S. Nagarajan, R. Sankar","doi":"10.1109/SECON.1998.673294","DOIUrl":"https://doi.org/10.1109/SECON.1998.673294","url":null,"abstract":"In linear predictive coding (LPC) analysis, the linear predictors are computed using the classical Levinson-Durbin algorithm. But the Levinson-Durbin algorithm is a processing bottleneck as it involves the addition of inner products in the calculation of the reflection coefficients. This paper develops and reports on modifications to the algorithm used in various speech processing and coding applications for efficient implementations.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115429891","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673342
G.G. McEachron
The Ku-band SeaWinds scatterometer, developed for NASA's Jet Propulsion Laboratory, is part of the Earth Observing System which will measure global environmental changes. Scheduled for launch on the Japanese Advanced Earth Observing Satellite (ADEOS) in the year 2000, the instrument measures wind data over the Earth's ice-free oceans every day. The development of the 110 watt peak power radar involved many design trade-offs including the temperature performance. A passive thermal control system, providing a narrow band temperature response in all orbit environments, was necessary to maintain stable radar calibration over a three-year operating life. This paper describes the evolution of the thermal control system design and test validation for the scatterometer electronics subassembly (SES).
{"title":"SeaWinds scatterometer instrument thermal control system","authors":"G.G. McEachron","doi":"10.1109/SECON.1998.673342","DOIUrl":"https://doi.org/10.1109/SECON.1998.673342","url":null,"abstract":"The Ku-band SeaWinds scatterometer, developed for NASA's Jet Propulsion Laboratory, is part of the Earth Observing System which will measure global environmental changes. Scheduled for launch on the Japanese Advanced Earth Observing Satellite (ADEOS) in the year 2000, the instrument measures wind data over the Earth's ice-free oceans every day. The development of the 110 watt peak power radar involved many design trade-offs including the temperature performance. A passive thermal control system, providing a narrow band temperature response in all orbit environments, was necessary to maintain stable radar calibration over a three-year operating life. This paper describes the evolution of the thermal control system design and test validation for the scatterometer electronics subassembly (SES).","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123770960","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673379
J. A. Wicks, J. Armstrong
Due to the great complexity of VHDL models that are created today, the amount of CPU time required to simulate these models and the amount of labor required to develop these models have become critical issues. The amount of CPU time required to simulate a model can be directly influenced by the efficient use of VHDL concepts in creating the model. Research in the determination of what VHDL concepts and modeling styles are most efficient will be discussed in this paper. The development of tests that can be run on VHDL models to reveal the efficiency of the code in the form of a numerical efficiency rating will also be discussed.
{"title":"Efficiency ratings for VHDL behavioral models","authors":"J. A. Wicks, J. Armstrong","doi":"10.1109/SECON.1998.673379","DOIUrl":"https://doi.org/10.1109/SECON.1998.673379","url":null,"abstract":"Due to the great complexity of VHDL models that are created today, the amount of CPU time required to simulate these models and the amount of labor required to develop these models have become critical issues. The amount of CPU time required to simulate a model can be directly influenced by the efficient use of VHDL concepts in creating the model. Research in the determination of what VHDL concepts and modeling styles are most efficient will be discussed in this paper. The development of tests that can be run on VHDL models to reveal the efficiency of the code in the form of a numerical efficiency rating will also be discussed.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128284312","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673312
P. Golla, E. C. Lin
Conventional scalar architectures such as the superscalar or multiscalar architectures execute from a single stream, while a multithreaded architecture executes from multiple streams at a time. Several aggressive branch predictors have been proposed with high prediction accuracies but none of them can provide 100% accuracy. We show that multithreaded architecture is a better candidate for utilizing speculative execution than scalar architectures. Generally the branch prediction performance degradation is compounded for larger window sizes on scalar architectures, while for a multithreaded architecture, by increasing the number of executing threads, we could sustain a higher performance for a large aggregated speculative window size. Hence, heavier workloads may increase performance and utilization for multithreaded architectures. We present analytical and simulation results to support our argument.
{"title":"Limitation of branch predictors: a case for multithreaded architectures","authors":"P. Golla, E. C. Lin","doi":"10.1109/SECON.1998.673312","DOIUrl":"https://doi.org/10.1109/SECON.1998.673312","url":null,"abstract":"Conventional scalar architectures such as the superscalar or multiscalar architectures execute from a single stream, while a multithreaded architecture executes from multiple streams at a time. Several aggressive branch predictors have been proposed with high prediction accuracies but none of them can provide 100% accuracy. We show that multithreaded architecture is a better candidate for utilizing speculative execution than scalar architectures. Generally the branch prediction performance degradation is compounded for larger window sizes on scalar architectures, while for a multithreaded architecture, by increasing the number of executing threads, we could sustain a higher performance for a large aggregated speculative window size. Hence, heavier workloads may increase performance and utilization for multithreaded architectures. We present analytical and simulation results to support our argument.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335720","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673280
Israel E Chen-Jimenez, A. Kornecki, Janusz Zalewski
This paper presents a new method to evaluate software safety using rough set theory. The data about the software product and process are collected via a questionnaire. The result is the direct assessment of the software safety in terms of a single coefficient, whose goodness is then analyzed using rough sets. An automatic tool for the Windows platform has been developed to help in the interactive analysis. Results from a real experiment of software safety evaluation are discussed.
{"title":"Software safety analysis using rough sets","authors":"Israel E Chen-Jimenez, A. Kornecki, Janusz Zalewski","doi":"10.1109/SECON.1998.673280","DOIUrl":"https://doi.org/10.1109/SECON.1998.673280","url":null,"abstract":"This paper presents a new method to evaluate software safety using rough set theory. The data about the software product and process are collected via a questionnaire. The result is the direct assessment of the software safety in terms of a single coefficient, whose goodness is then analyzed using rough sets. An automatic tool for the Windows platform has been developed to help in the interactive analysis. Results from a real experiment of software safety evaluation are discussed.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132602953","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673288
M. Kovač
Volume of data acquired during measurements is usually very large in size. In this paper we present compact, yet efficient, data compression algorithm that can be used to significantly reduce storage and telecommunication costs for the above-mentioned applications. The algorithm is lossless, based on the statistical information and can achieve a compression ratio of up to 14:1 on raw binary data. The algorithm has been successfully implemented to compress data from alternative fuel vehicles and photovoltaic systems.
{"title":"Efficient data compression algorithm for data loggers, measurement equipment and remote data analysis applications","authors":"M. Kovač","doi":"10.1109/SECON.1998.673288","DOIUrl":"https://doi.org/10.1109/SECON.1998.673288","url":null,"abstract":"Volume of data acquired during measurements is usually very large in size. In this paper we present compact, yet efficient, data compression algorithm that can be used to significantly reduce storage and telecommunication costs for the above-mentioned applications. The algorithm is lossless, based on the statistical information and can achieve a compression ratio of up to 14:1 on raw binary data. The algorithm has been successfully implemented to compress data from alternative fuel vehicles and photovoltaic systems.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131022085","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}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673348
E. Wheeler, J. L. Boone
An investigation employing nuclear transmutation to probe the effects of copper doping in ZnSe is presented. Three experimental observations are reported in this investigation. With the first, as-grown ZnSe is irradiated with thermal neutrons which results, after thermal annealing, in the incorporation of Cu/sub Zn/ centers. Results are consistent with isolated Cu/sub Zn/ being involved in the copper-red and copper-green emissions in ZnSe but not in the I/sub 1//sup d/ excitonic emission. Next are annealing experiments of as-grown wafers of ZnSe which are thermally annealed in a zinc-rich atmosphere. After annealing, the wafers show a remarkable reduction in the I/sub 1//sup d/ emission. Finally, we report observations of homoepitaxial layers of ZnSe grown from elemental zinc and selenium. In these experiments, we have seen that the I/sub 1//sup d/ can be greatly reduced, often eliminated, by growing the layers in a zinc-rich atmosphere. All three observations are consistent with the I/sub 1//sup d/ emission being associated with V/sub Zn/ but not with Cu/sub Zn/ centers,.
{"title":"The origin of the I/sub 1//sup d/ excitonic emission in ZnSe","authors":"E. Wheeler, J. L. Boone","doi":"10.1109/SECON.1998.673348","DOIUrl":"https://doi.org/10.1109/SECON.1998.673348","url":null,"abstract":"An investigation employing nuclear transmutation to probe the effects of copper doping in ZnSe is presented. Three experimental observations are reported in this investigation. With the first, as-grown ZnSe is irradiated with thermal neutrons which results, after thermal annealing, in the incorporation of Cu/sub Zn/ centers. Results are consistent with isolated Cu/sub Zn/ being involved in the copper-red and copper-green emissions in ZnSe but not in the I/sub 1//sup d/ excitonic emission. Next are annealing experiments of as-grown wafers of ZnSe which are thermally annealed in a zinc-rich atmosphere. After annealing, the wafers show a remarkable reduction in the I/sub 1//sup d/ emission. Finally, we report observations of homoepitaxial layers of ZnSe grown from elemental zinc and selenium. In these experiments, we have seen that the I/sub 1//sup d/ can be greatly reduced, often eliminated, by growing the layers in a zinc-rich atmosphere. All three observations are consistent with the I/sub 1//sup d/ emission being associated with V/sub Zn/ but not with Cu/sub Zn/ centers,.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134357663","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：