Pub Date : 1990-03-11DOI: 10.1109/SSST.1990.138163
S. Rai
Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B/sub n/), the author presents a method to obtain the total number of spanning trees in B/sub n/ and hence an approximate measure for network reliability.<>
{"title":"On hypercube reliability","authors":"S. Rai","doi":"10.1109/SSST.1990.138163","DOIUrl":"https://doi.org/10.1109/SSST.1990.138163","url":null,"abstract":"Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B/sub n/), the author presents a method to obtain the total number of spanning trees in B/sub n/ and hence an approximate measure for network reliability.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"670 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132366768","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 : 1990-03-11DOI: 10.1109/SSST.1990.138118
B. Abbott, C. Biegl, R. Souder, T. Bapty, J. Sztipanovits
The Multigraph programming environment provides a very-high-level programmer interface for the development of parallel and real-time processing systems. It is specifically targeted for large systems wishing to integrate a knowledge-based synthesis technique with standard numerical techniques. The result is a graphical editing environment where the user models the structure of the desired computation. Subsequently, symbolic techniques are used to translate this model to a large-grain data-flow graph. A description is given of the concepts and use the Multigraph programming environment on a tightly coupled parallel processing platform, the INMOS transputer.<>
{"title":"Graphical programming for the transputer","authors":"B. Abbott, C. Biegl, R. Souder, T. Bapty, J. Sztipanovits","doi":"10.1109/SSST.1990.138118","DOIUrl":"https://doi.org/10.1109/SSST.1990.138118","url":null,"abstract":"The Multigraph programming environment provides a very-high-level programmer interface for the development of parallel and real-time processing systems. It is specifically targeted for large systems wishing to integrate a knowledge-based synthesis technique with standard numerical techniques. The result is a graphical editing environment where the user models the structure of the desired computation. Subsequently, symbolic techniques are used to translate this model to a large-grain data-flow graph. A description is given of the concepts and use the Multigraph programming environment on a tightly coupled parallel processing platform, the INMOS transputer.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131711694","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 : 1990-03-11DOI: 10.1109/SSST.1990.138233
B.W. Boyte, P. Rajan, J. Tsui
The authors propose an autocorrelation-based method for determining the autoregressive parameters of a signal containing sinusoids. This method does not use the zero-lag autocorrelation value of the signal and is thus immune to the error caused by an additive white noise present in the signal. The autoregressive parameters are then used to determine the frequencies of the sinusoids. The method requires only 2p autocorrelation values, where p is the number of sinusoids. Thus, this method finds applications where the number of autocorrelations to be calculated is to be a minimum. A comparison of the method with other methods shows that over some frequency range the method has the lowest error. A disadvantage of the method is that the signal should be sampled at a rate at least four times the highest frequency in the signal if sampled data are used to estimate the autocorrelation values.<>
{"title":"A new autoregressive estimator for the estimation of the frequencies of a sinusoidal process corrupted with noise","authors":"B.W. Boyte, P. Rajan, J. Tsui","doi":"10.1109/SSST.1990.138233","DOIUrl":"https://doi.org/10.1109/SSST.1990.138233","url":null,"abstract":"The authors propose an autocorrelation-based method for determining the autoregressive parameters of a signal containing sinusoids. This method does not use the zero-lag autocorrelation value of the signal and is thus immune to the error caused by an additive white noise present in the signal. The autoregressive parameters are then used to determine the frequencies of the sinusoids. The method requires only 2p autocorrelation values, where p is the number of sinusoids. Thus, this method finds applications where the number of autocorrelations to be calculated is to be a minimum. A comparison of the method with other methods shows that over some frequency range the method has the lowest error. A disadvantage of the method is that the signal should be sampled at a rate at least four times the highest frequency in the signal if sampled data are used to estimate the autocorrelation values.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165582","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 : 1990-03-11DOI: 10.1109/SSST.1990.138219
K. Daneshvar, S.G. Middleton
An analysis of a graded tapered glass waveguide is presented. A technique for constructing the waveguide is described. An applied electric field is varied along the length of the waveguide while the temperature is raised. As a result, the extent of diffusion of silver ion in the glass is larger at high electric field regions. This method should produce a graded index tapered slab waveguide whose depth varies along the length of the waveguide. Simple relations for angular dispersion and losses for such a coupler are presented.<>
{"title":"Propagation characteristics and losses in graded tapered slab optimal coupler","authors":"K. Daneshvar, S.G. Middleton","doi":"10.1109/SSST.1990.138219","DOIUrl":"https://doi.org/10.1109/SSST.1990.138219","url":null,"abstract":"An analysis of a graded tapered glass waveguide is presented. A technique for constructing the waveguide is described. An applied electric field is varied along the length of the waveguide while the temperature is raised. As a result, the extent of diffusion of silver ion in the glass is larger at high electric field regions. This method should produce a graded index tapered slab waveguide whose depth varies along the length of the waveguide. Simple relations for angular dispersion and losses for such a coupler are presented.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904868","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 : 1990-03-11DOI: 10.1109/SSST.1990.138178
Su Zhu
Consideration is given to the space of transfer matrices with entries in the quotient field of H-infinity, in which the gap metric is defined. The largest robust stability radius of a transfer matrix is defined as the radius of the largest ball centered at the transfer matrix which can be stabilized by a single controller. There are two schemes presented for designing finite dimensional stabilizing controllers by means of the largest robust stability radius. Both schemes guarantee that the finite dimensional controllers stabilize the original infinite dimensional system. Moreover, the closed-loop response can be estimated.<>
{"title":"Finite dimensional controller design via the largest robust stability radius","authors":"Su Zhu","doi":"10.1109/SSST.1990.138178","DOIUrl":"https://doi.org/10.1109/SSST.1990.138178","url":null,"abstract":"Consideration is given to the space of transfer matrices with entries in the quotient field of H-infinity, in which the gap metric is defined. The largest robust stability radius of a transfer matrix is defined as the radius of the largest ball centered at the transfer matrix which can be stabilized by a single controller. There are two schemes presented for designing finite dimensional stabilizing controllers by means of the largest robust stability radius. Both schemes guarantee that the finite dimensional controllers stabilize the original infinite dimensional system. Moreover, the closed-loop response can be estimated.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115349919","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 : 1990-03-11DOI: 10.1109/SSST.1990.138133
R. Scharstein
Two numerical solutions are given for an integrodifferential equation governing the electric field in the aperture of a parallel-plate, waveguide-loaded, slot antenna excited by an obliquely incident plane wave. Resultant aperture field distributions obtained via Galerkin's method with a basis of edge-condition weighted Chebyshev polynomials are compared with the results from pulse expansion with point matching. Efficient algorithms are obtained for the elements of the reduced matrix equations for both moment methods.<>
{"title":"Plane wave excitation of the parallel plate-loaded slot antenna","authors":"R. Scharstein","doi":"10.1109/SSST.1990.138133","DOIUrl":"https://doi.org/10.1109/SSST.1990.138133","url":null,"abstract":"Two numerical solutions are given for an integrodifferential equation governing the electric field in the aperture of a parallel-plate, waveguide-loaded, slot antenna excited by an obliquely incident plane wave. Resultant aperture field distributions obtained via Galerkin's method with a basis of edge-condition weighted Chebyshev polynomials are compared with the results from pulse expansion with point matching. Efficient algorithms are obtained for the elements of the reduced matrix equations for both moment methods.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115434146","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 : 1990-03-11DOI: 10.1109/SSST.1990.138153
H.I. Abodaka, S. Miri
An algorithm for speed-trajectory control of three-phase squirrel-cage induction motors by means of stator voltage control is presented. The dynamic behavior of the induction motor is described by a set of first-order nonlinear differential equations. The stator voltage and the electromagnetic torque are related by a recursion formula. A nonlinear method for controlling the induction motor so that it follows an interpolated speed-trajectory is discussed. To achieve an acceptable control performance, the control law is utilized, together with the recurrence relation, to compute a nonlinear feedback controller. The method consists of first parameterizing the path in the configuration space and then, given a path, using control theory to determine a trajectory subject to torque constraints.<>
{"title":"Dynamic control of induction motor motion via stator voltage variations","authors":"H.I. Abodaka, S. Miri","doi":"10.1109/SSST.1990.138153","DOIUrl":"https://doi.org/10.1109/SSST.1990.138153","url":null,"abstract":"An algorithm for speed-trajectory control of three-phase squirrel-cage induction motors by means of stator voltage control is presented. The dynamic behavior of the induction motor is described by a set of first-order nonlinear differential equations. The stator voltage and the electromagnetic torque are related by a recursion formula. A nonlinear method for controlling the induction motor so that it follows an interpolated speed-trajectory is discussed. To achieve an acceptable control performance, the control law is utilized, together with the recurrence relation, to compute a nonlinear feedback controller. The method consists of first parameterizing the path in the configuration space and then, given a path, using control theory to determine a trajectory subject to torque constraints.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811000","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 : 1990-03-11DOI: 10.1109/SSST.1990.138226
T. Hanson, J. Essman
The complexity of calculating the weights for an adaptive antenna array is reduced. The advantages of cascaded adaptive arrays are discussed. General formulas for the cascade optimum cascade weights, SINR (signal-to-interference-noise ratio), and gain are developed. These formulas are applied to a five-element array treated as two-, three-, and four-element subarrays. The following are advantages of a cascade approach: (1) processor complexity is lowered, and a time-division-multiplexed (TDM) processor is possible; (2) only one subarray needs to be adapted per stage; and (3) the number of inputs in each subarray is limited, and therefore higher complexity algorithms are possible.<>
{"title":"Cascade array structures","authors":"T. Hanson, J. Essman","doi":"10.1109/SSST.1990.138226","DOIUrl":"https://doi.org/10.1109/SSST.1990.138226","url":null,"abstract":"The complexity of calculating the weights for an adaptive antenna array is reduced. The advantages of cascaded adaptive arrays are discussed. General formulas for the cascade optimum cascade weights, SINR (signal-to-interference-noise ratio), and gain are developed. These formulas are applied to a five-element array treated as two-, three-, and four-element subarrays. The following are advantages of a cascade approach: (1) processor complexity is lowered, and a time-division-multiplexed (TDM) processor is possible; (2) only one subarray needs to be adapted per stage; and (3) the number of inputs in each subarray is limited, and therefore higher complexity algorithms are possible.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080521","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 : 1990-03-11DOI: 10.1109/SSST.1990.138223
A. Misra, B. Abbott, J. Sztipanovits
Techniques for optimizing the utilization of underlying computer resources with respect to a dynamic signal-processing system executing on them are discussed. An example system is used to illustrate these techniques: a structurally adaptive solution to the sonar problem, the direction-of-arrival finding problem, was implemented under the Multigraph architecture. The signal processing system runs in a distributed, parallel environment, the Multigraph execution environment. Above the executing real-time signal-processing system, a controller guides and coordinates overall goals (e.g. tracking). It also manages the available system resources, taking into account the memory and time requirements of the signal-processing algorithms and their priorities. Further, a user interface allows priorities and various operating parameters of the system to be changed dynamically.<>
{"title":"Performance optimization in signal processing systems","authors":"A. Misra, B. Abbott, J. Sztipanovits","doi":"10.1109/SSST.1990.138223","DOIUrl":"https://doi.org/10.1109/SSST.1990.138223","url":null,"abstract":"Techniques for optimizing the utilization of underlying computer resources with respect to a dynamic signal-processing system executing on them are discussed. An example system is used to illustrate these techniques: a structurally adaptive solution to the sonar problem, the direction-of-arrival finding problem, was implemented under the Multigraph architecture. The signal processing system runs in a distributed, parallel environment, the Multigraph execution environment. Above the executing real-time signal-processing system, a controller guides and coordinates overall goals (e.g. tracking). It also manages the available system resources, taking into account the memory and time requirements of the signal-processing algorithms and their priorities. Further, a user interface allows priorities and various operating parameters of the system to be changed dynamically.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125891552","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 : 1990-03-11DOI: 10.1109/SSST.1990.138130
S. Louza, N. Audeh
Field scattering by a rough surface has been of interest because of its applications in radar and communications. One method of expressing the surface shape is statistical. In this work the rough surfaces consist of piecewise-linear segments or facets having random slopes and variable horizontal projections. Such surfaces are described by the Markov chain, and the surface heights correspond to the states in the stochastic matrix. A number of Gaussian surfaces with the same statistical properties as those of the Markov surfaces are generated. Thus there are two sets of rough surfaces, one described by the Markov chain and the other following Gaussian distribution. By means of ray tracing, the horizontally polarized fields scattered by these surfaces are calculated and compared.<>
{"title":"Scattering of horizontally polarized electromagnetic fields by random surfaces","authors":"S. Louza, N. Audeh","doi":"10.1109/SSST.1990.138130","DOIUrl":"https://doi.org/10.1109/SSST.1990.138130","url":null,"abstract":"Field scattering by a rough surface has been of interest because of its applications in radar and communications. One method of expressing the surface shape is statistical. In this work the rough surfaces consist of piecewise-linear segments or facets having random slopes and variable horizontal projections. Such surfaces are described by the Markov chain, and the surface heights correspond to the states in the stochastic matrix. A number of Gaussian surfaces with the same statistical properties as those of the Markov surfaces are generated. Thus there are two sets of rough surfaces, one described by the Markov chain and the other following Gaussian distribution. By means of ray tracing, the horizontally polarized fields scattered by these surfaces are calculated and compared.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126767139","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
扫码关注我们
求助内容：
应助结果提醒方式：