Pub Date : 1996-03-31DOI: 10.1109/SSST.1996.493489
W. Porter, W. Liu
In this study we present a design for hierarchical modular classifiers. The design features an algorithm which selects a set of exemplars. Using these exemplars the classification problem is decomposed into a family of disjoint subproblems. A classification module is trained for each subproblem. The collection of classification modules and a rule book for their use then comprise the resultant design.
{"title":"Designing large scale classifiers","authors":"W. Porter, W. Liu","doi":"10.1109/SSST.1996.493489","DOIUrl":"https://doi.org/10.1109/SSST.1996.493489","url":null,"abstract":"In this study we present a design for hierarchical modular classifiers. The design features an algorithm which selects a set of exemplars. Using these exemplars the classification problem is decomposed into a family of disjoint subproblems. A classification module is trained for each subproblem. The collection of classification modules and a rule book for their use then comprise the resultant design.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123048212","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 : 1996-03-31DOI: 10.1109/SSST.1996.493499
G.A. Salim, M. Choudhry, K. Ellithy
This paper presents a method for designing a dynamic compensator based on artificial neural networks (ANN). The ANN is trained to give the proper compensator parameters (X, Tz) so as to always assign certain eigenvalues to desired locations in the output feedback system. The eigenvalues of concern are those associated with the angle /spl delta/ and speed /spl omega/. These eigenvalues are to be assigned to the specified locations under variations in several system parameters [static nonlinear load parameters A/sub p/ and A/sub q/, transmission line reactance, x/sub e/, and generated real power, P/sub G/]. The exact and ANN's results of compensator's parameters are plotted. In addition speed response is provided for the compensated and uncompensated systems. Results show that the ANN can be used on line once the off line training is performed to determine the compensator data so as to maintain the desired response of the system under variations in system parameters.
提出了一种基于人工神经网络(ANN)的动态补偿器设计方法。训练人工神经网络给出适当的补偿器参数(X, Tz)，以便始终将某些特征值分配到输出反馈系统中的期望位置。所关注的特征值是与角度/spl delta/和速度/spl omega/相关的特征值。这些特征值将在几个系统参数[静态非线性负载参数A/sub p/和A/sub q/，传输线电抗x/sub e/和产生的实际功率p/ sub G/]变化的情况下分配给指定的位置。绘制了补偿器参数的精确结果和人工神经网络结果。此外，还提供了补偿和未补偿系统的速度响应。结果表明，只要进行离线训练，就可以在线使用人工神经网络来确定补偿器数据，从而在系统参数变化时保持系统的期望响应。
{"title":"Dynamic compensator design for HV AC power system using artificial neural networks","authors":"G.A. Salim, M. Choudhry, K. Ellithy","doi":"10.1109/SSST.1996.493499","DOIUrl":"https://doi.org/10.1109/SSST.1996.493499","url":null,"abstract":"This paper presents a method for designing a dynamic compensator based on artificial neural networks (ANN). The ANN is trained to give the proper compensator parameters (X, Tz) so as to always assign certain eigenvalues to desired locations in the output feedback system. The eigenvalues of concern are those associated with the angle /spl delta/ and speed /spl omega/. These eigenvalues are to be assigned to the specified locations under variations in several system parameters [static nonlinear load parameters A/sub p/ and A/sub q/, transmission line reactance, x/sub e/, and generated real power, P/sub G/]. The exact and ANN's results of compensator's parameters are plotted. In addition speed response is provided for the compensated and uncompensated systems. Results show that the ANN can be used on line once the off line training is performed to determine the compensator data so as to maintain the desired response of the system under variations in system parameters.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122384817","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 : 1996-03-31DOI: 10.1109/SSST.1996.493487
F. Daoud
The problems of developing collaborative systems are compounded by the strong inter-relationship between these systems and the activities of the organisation in which they exist. In this paper, we present a multi-agent system for multimedia conference control. Agents are useful for control as well for cooperative applications, but here we treat only the control aspects. We use semantic rules to guide this cooperative control.
{"title":"Extended transactional control of cooperative systems","authors":"F. Daoud","doi":"10.1109/SSST.1996.493487","DOIUrl":"https://doi.org/10.1109/SSST.1996.493487","url":null,"abstract":"The problems of developing collaborative systems are compounded by the strong inter-relationship between these systems and the activities of the organisation in which they exist. In this paper, we present a multi-agent system for multimedia conference control. Agents are useful for control as well for cooperative applications, but here we treat only the control aspects. We use semantic rules to guide this cooperative control.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123031805","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 : 1996-03-31DOI: 10.1109/SSST.1996.493495
M. Abdel-Haleem, C.D. Johnson
In the conventional method of discrete-time control, the control-input is held constant across each sampling interval; i.e., "zero-order hold" type control. In this paper a previously introduced generalization of the conventional discrete-time control method, in which the control is allowed to vary with time (open-loop fashion) across each sampling interval is considered and applied to the optimal linear quadratic regulator (LQR) problem. This generalization of discrete-time control, called "discrete-continuous control", leads to significant performance improvements compared to conventional discrete-time control. An important special case of discrete-continuous control where control variations are constrained to be linear-in-time across each sampling-interval, is examined in detail and a new general LQR theory is developed for that special case. These latter results are illustrated by a worked numerical example with simulation plots that clearly demonstrate the LQR performance improvements obtained by (linear-in-time) discrete-continuous control.
{"title":"Optimal discrete-continuous control for the linear-quadratic regulator problem","authors":"M. Abdel-Haleem, C.D. Johnson","doi":"10.1109/SSST.1996.493495","DOIUrl":"https://doi.org/10.1109/SSST.1996.493495","url":null,"abstract":"In the conventional method of discrete-time control, the control-input is held constant across each sampling interval; i.e., \"zero-order hold\" type control. In this paper a previously introduced generalization of the conventional discrete-time control method, in which the control is allowed to vary with time (open-loop fashion) across each sampling interval is considered and applied to the optimal linear quadratic regulator (LQR) problem. This generalization of discrete-time control, called \"discrete-continuous control\", leads to significant performance improvements compared to conventional discrete-time control. An important special case of discrete-continuous control where control variations are constrained to be linear-in-time across each sampling-interval, is examined in detail and a new general LQR theory is developed for that special case. These latter results are illustrated by a worked numerical example with simulation plots that clearly demonstrate the LQR performance improvements obtained by (linear-in-time) discrete-continuous control.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128592932","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 : 1996-03-31DOI: 10.1109/SSST.1996.493537
T. Wang, R. Haggard
Presents a software environment for system level estimation and partitioning (SLEP). The software is developed based on the structural analysis estimation method and the adaptive weight partitioning algorithm, which were previously proposed by the authors. The application of the SLEP program to rapid prototyping systems is also discussed. Examples of estimation and partitioning of VHDL designs in the SLEP environment are presented. Through these experimental examples, the effectiveness and efficiency of the SLEP system are illustrated.
{"title":"SLEP-system level estimation and partitioning: a software environment for rapid prototyping","authors":"T. Wang, R. Haggard","doi":"10.1109/SSST.1996.493537","DOIUrl":"https://doi.org/10.1109/SSST.1996.493537","url":null,"abstract":"Presents a software environment for system level estimation and partitioning (SLEP). The software is developed based on the structural analysis estimation method and the adaptive weight partitioning algorithm, which were previously proposed by the authors. The application of the SLEP program to rapid prototyping systems is also discussed. Examples of estimation and partitioning of VHDL designs in the SLEP environment are presented. Through these experimental examples, the effectiveness and efficiency of the SLEP system are illustrated.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301670","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 : 1996-03-31DOI: 10.1109/SSST.1996.493513
J.E. Gray, G. Foster
For tracking systems with a uniform data rate and stationary measurement noise, non-manoeuvring targets can be accurately tracked with a steady-state Kalman filter. The steady-state Kalman filter, which can be viewed as equivalent to an alpha-beta filter, has been widely applied to many different systems. A means of selecting the filter coefficients was proposed by Kalata (1984) using Kalman filter considerations. An alternative method based on noise reduction ratios is presented in this paper. Using a design criteria with the Kalata relation, optimal filter coefficients can be selected for specific applications. This method generalizes current methods for selecting the filter coefficients.
{"title":"Filter coefficient selection using design criteria","authors":"J.E. Gray, G. Foster","doi":"10.1109/SSST.1996.493513","DOIUrl":"https://doi.org/10.1109/SSST.1996.493513","url":null,"abstract":"For tracking systems with a uniform data rate and stationary measurement noise, non-manoeuvring targets can be accurately tracked with a steady-state Kalman filter. The steady-state Kalman filter, which can be viewed as equivalent to an alpha-beta filter, has been widely applied to many different systems. A means of selecting the filter coefficients was proposed by Kalata (1984) using Kalman filter considerations. An alternative method based on noise reduction ratios is presented in this paper. Using a design criteria with the Kalata relation, optimal filter coefficients can be selected for specific applications. This method generalizes current methods for selecting the filter coefficients.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126251337","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 : 1996-03-31DOI: 10.1109/SSST.1996.493468
J. Bredeson, D.A. Pillai
Finds the efficiency of ATM networks in transporting TCP/IP traffic. Different kinds of protocols and compression techniques are used for these calculations. RFC 1483 is used to map IP packets into AAL-SDUs. Efficiency with respect to different packer sizes and payloads are also calculated.
{"title":"Efficiency of ATM networks in transporting TCP/IP traffic","authors":"J. Bredeson, D.A. Pillai","doi":"10.1109/SSST.1996.493468","DOIUrl":"https://doi.org/10.1109/SSST.1996.493468","url":null,"abstract":"Finds the efficiency of ATM networks in transporting TCP/IP traffic. Different kinds of protocols and compression techniques are used for these calculations. RFC 1483 is used to map IP packets into AAL-SDUs. Efficiency with respect to different packer sizes and payloads are also calculated.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133874374","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 : 1996-03-31DOI: 10.1109/SSST.1996.493541
Bin Gong, S. Zheng
The Fibonacci cube network was proposed recently as an alternative to the hypercube network. In this paper, we consider the problems of simulating tree and X-tree structures by the Fibonacci cube. Such problems can be characterized as network embedding. There is a big gap between the hypercube and the Fibonacci cube with respect to the availability of routing and embedding results. We present near-optimal embedding results, which show that the Fibonacci cube can simulate trees and X-trees almost as efficiently as the hypercube, even though the Fibonacci cube is a network much sparser than the hypercube.
{"title":"Near-optimal embeddings of trees into Fibonacci cubes","authors":"Bin Gong, S. Zheng","doi":"10.1109/SSST.1996.493541","DOIUrl":"https://doi.org/10.1109/SSST.1996.493541","url":null,"abstract":"The Fibonacci cube network was proposed recently as an alternative to the hypercube network. In this paper, we consider the problems of simulating tree and X-tree structures by the Fibonacci cube. Such problems can be characterized as network embedding. There is a big gap between the hypercube and the Fibonacci cube with respect to the availability of routing and embedding results. We present near-optimal embedding results, which show that the Fibonacci cube can simulate trees and X-trees almost as efficiently as the hypercube, even though the Fibonacci cube is a network much sparser than the hypercube.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124582738","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 : 1996-03-31DOI: 10.1109/SSST.1996.493485
Kcp Wang, Xuyang Li
The existing photo logging systems used by the highway agencies are limited in accessibility and usability in the areas of providing engineers information on traffic accidents, design improvement and highway pavement management. For example, traditional computer databases are routinely used for variety of engineering work. But it is impossible to simultaneously examine highway visual frames and analyze related traditional engineering data sets, such as as-built information. The analog nature of the systems also presents difficulties in integrating the visual information with other types of data. This paper presents a distributed multimedia based highway information system (MMHIS). The implementation of a MMHIS involves technologies in digital video and CODEC, and high speed network transmission. This paper discusses the applicability of asynchronous transfer mode (ATM) for digital video transmission over networks. In addition, information relating to the system design and implementation are also presented.
{"title":"ATM networking environment for a multimedia based highway information system","authors":"Kcp Wang, Xuyang Li","doi":"10.1109/SSST.1996.493485","DOIUrl":"https://doi.org/10.1109/SSST.1996.493485","url":null,"abstract":"The existing photo logging systems used by the highway agencies are limited in accessibility and usability in the areas of providing engineers information on traffic accidents, design improvement and highway pavement management. For example, traditional computer databases are routinely used for variety of engineering work. But it is impossible to simultaneously examine highway visual frames and analyze related traditional engineering data sets, such as as-built information. The analog nature of the systems also presents difficulties in integrating the visual information with other types of data. This paper presents a distributed multimedia based highway information system (MMHIS). The implementation of a MMHIS involves technologies in digital video and CODEC, and high speed network transmission. This paper discusses the applicability of asynchronous transfer mode (ATM) for digital video transmission over networks. In addition, information relating to the system design and implementation are also presented.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117311758","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 : 1996-03-31DOI: 10.1109/SSST.1996.493480
L.A. Harrison, R. Gordon
In this paper the use of wavelet-like basis functions in the finite element analysis of one dimensional problems in which a Dirichlet boundary condition is specified at one boundary and a Neumann boundary condition is specified at the other, is presented. Construction of these types of basis functions for the mixed type boundary conditions is discussed. The condition numbers of the resulting matrices, along with the number of steps required for convergence of the conjugate gradient solution are presented. For comparison, results obtained from a finite element algorithm employing traditional basis functions are also presented.
{"title":"Finite element analysis of boundary value problems using wavelet-like basis functions","authors":"L.A. Harrison, R. Gordon","doi":"10.1109/SSST.1996.493480","DOIUrl":"https://doi.org/10.1109/SSST.1996.493480","url":null,"abstract":"In this paper the use of wavelet-like basis functions in the finite element analysis of one dimensional problems in which a Dirichlet boundary condition is specified at one boundary and a Neumann boundary condition is specified at the other, is presented. Construction of these types of basis functions for the mixed type boundary conditions is discussed. The condition numbers of the resulting matrices, along with the number of steps required for convergence of the conjugate gradient solution are presented. For comparison, results obtained from a finite element algorithm employing traditional basis functions are also presented.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116402841","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
扫码关注我们
求助内容：
应助结果提醒方式：