Pub Date : 1992-04-12DOI: 10.1109/SECON.1992.202257
G.H. Massiha, C.T.M. Chen
The excess electrical noise in aluminum and aluminum alloy thin films were measured. The magnitude and frequency exponent for noise spectra of 1/f/sup alpha / were measured as a function of the sample temperature and current density. Two different regions in plots of normalized 1/f/sup alpha / noise magnitude, with alpha between 1.2 and 2.2. versus inverse temperature were observed. The time dependence experiment on excess noise of aluminum showed 1/f/sup alpha /, with alpha larger than 2.2, noise spectra during later stages of the electromigration process.<>
{"title":"Reliability test of interconnections using electrical noise measurement","authors":"G.H. Massiha, C.T.M. Chen","doi":"10.1109/SECON.1992.202257","DOIUrl":"https://doi.org/10.1109/SECON.1992.202257","url":null,"abstract":"The excess electrical noise in aluminum and aluminum alloy thin films were measured. The magnitude and frequency exponent for noise spectra of 1/f/sup alpha / were measured as a function of the sample temperature and current density. Two different regions in plots of normalized 1/f/sup alpha / noise magnitude, with alpha between 1.2 and 2.2. versus inverse temperature were observed. The time dependence experiment on excess noise of aluminum showed 1/f/sup alpha /, with alpha larger than 2.2, noise spectra during later stages of the electromigration process.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115133131","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 : 1992-04-12DOI: 10.1109/SECON.1992.202429
E. Nichols
A sensor was developed which utilized the psychrometric process and produced an output proportional to percent relative humidity compatible with existing industry control devices. The wet- and dry-bulb sensors were comprised of two temperature sensors which had already been used successfully for thermostats for poultry farming control systems. A mechanical timer was utilized to automate the psychrometric process. The wet- and dry-bulb signals were digitized, and the result was used to address a psychrometric table stored in read-only memory (ROM) chips. The output from the ROMs was then converted to an analog signal for display and for use by a control system. The testing of the sensor demonstrated that it would produce the proper output within a tolerance of 1% for a range of several known humidities.<>
{"title":"An automatic psychrometer sensor for poultry farming","authors":"E. Nichols","doi":"10.1109/SECON.1992.202429","DOIUrl":"https://doi.org/10.1109/SECON.1992.202429","url":null,"abstract":"A sensor was developed which utilized the psychrometric process and produced an output proportional to percent relative humidity compatible with existing industry control devices. The wet- and dry-bulb sensors were comprised of two temperature sensors which had already been used successfully for thermostats for poultry farming control systems. A mechanical timer was utilized to automate the psychrometric process. The wet- and dry-bulb signals were digitized, and the result was used to address a psychrometric table stored in read-only memory (ROM) chips. The output from the ROMs was then converted to an analog signal for display and for use by a control system. The testing of the sensor demonstrated that it would produce the proper output within a tolerance of 1% for a range of several known humidities.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133670986","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 : 1992-04-12DOI: 10.1109/SECON.1992.202404
J. Reynaud, P. Pillay
The authors examine the modeling of induction motors including saturation of the magnetic core. The motor's magnetizing inductances are modeled by nonlinear functions of their exciting currents. The well-known D-Q axis model is used, and a stationary reference frame is chosen. Simulation was done by using PSpice. Results are presented for both saturated and unsaturated operation.<>
{"title":"Modeling of saturation effects in the magnetizing branch of an induction motor using PSpice","authors":"J. Reynaud, P. Pillay","doi":"10.1109/SECON.1992.202404","DOIUrl":"https://doi.org/10.1109/SECON.1992.202404","url":null,"abstract":"The authors examine the modeling of induction motors including saturation of the magnetic core. The motor's magnetizing inductances are modeled by nonlinear functions of their exciting currents. The well-known D-Q axis model is used, and a stationary reference frame is chosen. Simulation was done by using PSpice. Results are presented for both saturated and unsaturated operation.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133982686","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 : 1992-04-12DOI: 10.1109/SECON.1992.202435
A. S. Parrish
Software testing cannot guarantee that a program is at least correct with respect to the inputs over which the program was tested. This is a problem when testing concurrent programs, or could also be due to the possibility of a mistake in evaluating the results of a test of a sequential program. It is shown that, even if such evaluation mistakes are eliminated, testing still cannot normally guarantee program correctness, even with respect to a single input, given most programming language implementations. Reasonably unrestrictive conditions on the language implementation are proposed to resolve this problem.<>
{"title":"Obtaining maximum confidence from unrevealing tests (software testing)","authors":"A. S. Parrish","doi":"10.1109/SECON.1992.202435","DOIUrl":"https://doi.org/10.1109/SECON.1992.202435","url":null,"abstract":"Software testing cannot guarantee that a program is at least correct with respect to the inputs over which the program was tested. This is a problem when testing concurrent programs, or could also be due to the possibility of a mistake in evaluating the results of a test of a sequential program. It is shown that, even if such evaluation mistakes are eliminated, testing still cannot normally guarantee program correctness, even with respect to a single input, given most programming language implementations. Reasonably unrestrictive conditions on the language implementation are proposed to resolve this problem.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134474022","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 : 1992-04-12DOI: 10.1109/SECON.1992.202324
P. Looges, S. Olariu
Investigates the class of indifference graphs that models the notion of indifference relation arising in social sciences and management. The authors examine algorithmic properties of indifference graphs. Recently it has been shown that indifference graphs are characterized by a very special ordering on their sets of vertices. It is shown that this linear order can be exploited in a natural way to obtain optimal greedy algorithms for a number of computational problems on indifference graphs, including finding a shortest path between two vertices, computing a maximum matching, the center, and a Hamiltonian path.<>
{"title":"Optimal greedy algorithms for indifference graphs","authors":"P. Looges, S. Olariu","doi":"10.1109/SECON.1992.202324","DOIUrl":"https://doi.org/10.1109/SECON.1992.202324","url":null,"abstract":"Investigates the class of indifference graphs that models the notion of indifference relation arising in social sciences and management. The authors examine algorithmic properties of indifference graphs. Recently it has been shown that indifference graphs are characterized by a very special ordering on their sets of vertices. It is shown that this linear order can be exploited in a natural way to obtain optimal greedy algorithms for a number of computational problems on indifference graphs, including finding a shortest path between two vertices, computing a maximum matching, the center, and a Hamiltonian path.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115606392","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 : 1992-04-12DOI: 10.1109/SECON.1992.202315
A.S. Nelms, F.N. Cornett, J. McDearman, E. Morgan
Automated biomonitoring has evolved into a useful method for water quality assessment. A novel biomonitoring system was designed and built. The main objective of the system was to provide the facilities necessary to apply advanced signal processing techniques to the analysis of bioelectric signals. The system has been shown to provide excellent results. A description of the system is given, along with the results.<>
{"title":"BeRM: bioelectric response monitor","authors":"A.S. Nelms, F.N. Cornett, J. McDearman, E. Morgan","doi":"10.1109/SECON.1992.202315","DOIUrl":"https://doi.org/10.1109/SECON.1992.202315","url":null,"abstract":"Automated biomonitoring has evolved into a useful method for water quality assessment. A novel biomonitoring system was designed and built. The main objective of the system was to provide the facilities necessary to apply advanced signal processing techniques to the analysis of bioelectric signals. The system has been shown to provide excellent results. A description of the system is given, along with the results.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"16 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113936178","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 : 1992-04-12DOI: 10.1109/SECON.1992.202271
J. Macdonald, J. Johannes
The authors present dynamic load shedding mechanisms that support multi-grain parallelism in distributed embedded systems. An approach is presented to provide overload detection and load reconfiguration mechanisms within concurrent languages. The approach makes it possible to have adaptive resource control constructs dynamically reconfigure application parameters based on the overload condition. This capability allows for more complex resource control policies that utilize information about the actual application being performed. A set of resource control components is provided within a language runtime environment that supports load balancing in multi-grain distributed embedded systems. Overload resource requirements can be managed effectively within the concurrent language runtime environment.<>
{"title":"Dynamic load shedding mechanisms for overloads in distributed embedded systems","authors":"J. Macdonald, J. Johannes","doi":"10.1109/SECON.1992.202271","DOIUrl":"https://doi.org/10.1109/SECON.1992.202271","url":null,"abstract":"The authors present dynamic load shedding mechanisms that support multi-grain parallelism in distributed embedded systems. An approach is presented to provide overload detection and load reconfiguration mechanisms within concurrent languages. The approach makes it possible to have adaptive resource control constructs dynamically reconfigure application parameters based on the overload condition. This capability allows for more complex resource control policies that utilize information about the actual application being performed. A set of resource control components is provided within a language runtime environment that supports load balancing in multi-grain distributed embedded systems. Overload resource requirements can be managed effectively within the concurrent language runtime environment.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115898061","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 : 1992-04-12DOI: 10.1109/SECON.1992.202438
M. Fashoro, O. Hájek
The authors present various notions of controllability of any point p in R/sup n/, for linear systems with admissible controls in a compact set U containing the origin. They prove the equivalency of some of these notions and characterize the sets of controllable points for the system. They also prove that a necessary condition for p to be a local constrained controllable point of a linear system is that Ap in U. Thus, it is possible to characterize the set of local controllable points for the system. C, the set of complete constrained controllable points of the system. is shown to be a convex nonvoid and symmetric neighborhood of the origin. C is also a connected set since its interior is the union of closed trajectories through the origin. The set C as the intersection of the reachable and attainable set for any point p in R/sup n/ is completely characterized. Thus, the size and shape of C is invariant of the choice of p. The shape of C is related to the location of the spectrum of the system in the complex plane.<>
{"title":"Controllability notions: equivalency and sets of controllable points","authors":"M. Fashoro, O. Hájek","doi":"10.1109/SECON.1992.202438","DOIUrl":"https://doi.org/10.1109/SECON.1992.202438","url":null,"abstract":"The authors present various notions of controllability of any point p in R/sup n/, for linear systems with admissible controls in a compact set U containing the origin. They prove the equivalency of some of these notions and characterize the sets of controllable points for the system. They also prove that a necessary condition for p to be a local constrained controllable point of a linear system is that Ap in U. Thus, it is possible to characterize the set of local controllable points for the system. C, the set of complete constrained controllable points of the system. is shown to be a convex nonvoid and symmetric neighborhood of the origin. C is also a connected set since its interior is the union of closed trajectories through the origin. The set C as the intersection of the reachable and attainable set for any point p in R/sup n/ is completely characterized. Thus, the size and shape of C is invariant of the choice of p. The shape of C is related to the location of the spectrum of the system in the complex plane.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124449863","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 : 1992-04-12DOI: 10.1109/SECON.1992.202287
K. Henson-Mack, H.C. Chen, D.C. Wester
CLAUDE is a hybrid expert system for differential diagnosis that combines a rule-based and probabilistic system, integrating their independent opinions with a neural network. CLAUDE's application was to classify 17 central auditory diagnostic areas by analyzing a client's case history. Two network structures were examined, one connecting only those nodes applying to the same class within a diagnostic area, and the other fully connected. CLAUDE performed much better than either a rule-based system or a probabilistic system and made correct judgments when neither system could provide a diagnosis. Furthermore, it was able to classify 75% correctly, even in the presence of incomplete data. Thus, two individual systems using different criteria and balanced by a neural network provided more accurate results than either a probabilistic or a rule-based system alone.<>
{"title":"Integrating probabilistic and rule-based systems for clinical differential diagnosis","authors":"K. Henson-Mack, H.C. Chen, D.C. Wester","doi":"10.1109/SECON.1992.202287","DOIUrl":"https://doi.org/10.1109/SECON.1992.202287","url":null,"abstract":"CLAUDE is a hybrid expert system for differential diagnosis that combines a rule-based and probabilistic system, integrating their independent opinions with a neural network. CLAUDE's application was to classify 17 central auditory diagnostic areas by analyzing a client's case history. Two network structures were examined, one connecting only those nodes applying to the same class within a diagnostic area, and the other fully connected. CLAUDE performed much better than either a rule-based system or a probabilistic system and made correct judgments when neither system could provide a diagnosis. Furthermore, it was able to classify 75% correctly, even in the presence of incomplete data. Thus, two individual systems using different criteria and balanced by a neural network provided more accurate results than either a probabilistic or a rule-based system alone.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124495197","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 : 1992-04-12DOI: 10.1109/SECON.1992.202272
S. Al-Arian, M.B. Gumusel
A fault-masking technique for both arithmetic and logical operations in an arithmetic logic unit (ALU) is proposed. The technique, which is basically time redundant, takes advantage of both time and hardware redundancy concepts. The method with which error correction is accomplished resembles that of triplication of hardware. Time redundancy is then used to complete the computation and obtain the final result on the same hardware. For example, a 12-b addition operation can be realized by using each of three 4-b adder modules three times in parallel. During each partial calculation, the error correction is accomplished by taking the majority gate of the results from the three 4-b adder blocks. The operation of an N-bit full-adder is shown as an example to describe the basis of the hardware partition in time redundancy (HPTR) technique.<>
{"title":"HPTR: Hardware partition in time redundancy technique for fault tolerance","authors":"S. Al-Arian, M.B. Gumusel","doi":"10.1109/SECON.1992.202272","DOIUrl":"https://doi.org/10.1109/SECON.1992.202272","url":null,"abstract":"A fault-masking technique for both arithmetic and logical operations in an arithmetic logic unit (ALU) is proposed. The technique, which is basically time redundant, takes advantage of both time and hardware redundancy concepts. The method with which error correction is accomplished resembles that of triplication of hardware. Time redundancy is then used to complete the computation and obtain the final result on the same hardware. For example, a 12-b addition operation can be realized by using each of three 4-b adder modules three times in parallel. During each partial calculation, the error correction is accomplished by taking the majority gate of the results from the three 4-b adder blocks. The operation of an N-bit full-adder is shown as an example to describe the basis of the hardware partition in time redundancy (HPTR) technique.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125324793","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
扫码关注我们
求助内容：
应助结果提醒方式：