{"title":"TDNN based speaker identification","authors":"G. L. Berger, J. Gowdy","doi":"10.1109/SSST.1993.522810","DOIUrl":"https://doi.org/10.1109/SSST.1993.522810","url":null,"abstract":"A spatio-temporal network the time delay neural network (TDNN) is considered. Because the TDNN is time-shift invariant, input patterns do not need to be aligned. Also, the TDNN uses temporal information in its mapping process. Experimental results show that a TDNN-based speaker identification outperforms a weighted-distance-measure-based speaker identification system that does not use temporal information.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust position tracking control for rigid-link flexible-joint robots","authors":"S. C. Martindale, M. Bridges, D. Dawson","doi":"10.1109/SSST.1993.522802","DOIUrl":"https://doi.org/10.1109/SSST.1993.522802","url":null,"abstract":"The robust tracking controller for rigid-link flexible-joint (RLFJ) robots presented by D. M. Dawson et al. (1991) is redesigned. The controller exploits aspects of the dynamic model to provide a global uniform ultimately bounded (GUUB) stability result despite the presence of parametric uncertainty, joint flexibility, and mechanical actuator dynamics. The controller delivers the GUUB result for both the position and the velocity error. The redesign enables the final ball in which the link tracking error resides to be arbitrarily shrunk and the exponential rate at which the error approaches that ball to be increased by adjustment of the control gains.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116454516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Applications of GA-based optimization of neural network connection topology","authors":"E. Smuda, K. Krishnakumar","doi":"10.1109/SSST.1993.522797","DOIUrl":"https://doi.org/10.1109/SSST.1993.522797","url":null,"abstract":"A genetic algorithm (GA) is used to explore the connection space of an artificial neural network (ANN) with the objective of finding a sparsely connected network that yields the same accuracy as a fully connected network. Such sparsity is desired as it improves the generalization capabilities of the mapping. The ANN with the GA-chosen set of connections is then trained using a supervised mode of learning known as backpropagation error. Using this technique, three different applications are analyzed.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"13 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131042017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A reliability and economic evaluation of a transmission system-I: Using frequency and duration of failure method","authors":"A. Shaban, A. Go","doi":"10.1109/SSST.1993.522749","DOIUrl":"https://doi.org/10.1109/SSST.1993.522749","url":null,"abstract":"The reliability of a transmission system model consisting of transmission lines, transformers, and circuit breakers is calculated from sample data using the frequency and duration method. The model is modified by adding another transmission line and a transformer to study the effect on reliability. A significant decrease in system down time is found when a transformer is added in parallel with the two existing ones, whereas adding another transmission line produces only a minimal decrease. A study has been conducted to determine whether it is economically feasible to add another transformer to increase the model system's reliability and decrease its down time. During a twenty-year period, it was found that the savings of energy, and the dollars associated with it, exceeds the costs of the additional transformer.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Assessing real-valued transform algorithms for fast convolution in electric power quality calculations","authors":"K. Olejniczak, L. S. Prabhu, D. L. Andrews","doi":"10.1109/SSST.1993.522753","DOIUrl":"https://doi.org/10.1109/SSST.1993.522753","url":null,"abstract":"It is argued that real- versus complex-valued trigonometric transform algorithms may deserve increased awareness in systems analysis in general, and application to nonsinusoidal waveform propagation in electric power systems in particular, due to their favorable convolution property when linear, time-invariant systems are studied. The performance of the three real-valued trigonometric transforms is assessed based on timing study results. The importance of instructions other than the multiplicative and additive complexities, namely those instructions involved in data transfer operations (e.g. loads and stores), is pointed out.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123328969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An approach to three-dimensional object recognition using a hybrid Hopfield network","authors":"T. D. Brooks, J.H. Kim","doi":"10.1109/SSST.1993.522839","DOIUrl":"https://doi.org/10.1109/SSST.1993.522839","url":null,"abstract":"A hybrid Hopfield network previously used to solve two-dimensional occluded object recognition problems is adapted to the three-dimensional problem. It is assumed that feature extraction has yielded a set of vertices for the model and a set of vertices for the input object. From these vertices local and relational features are obtained for use in a hybrid Hopfield network graph-matching algorithm used to realize three-dimensional single-input object recognition.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A local area network on a shoe string","authors":"D. Teague, A. Barbir","doi":"10.1109/SSST.1993.522842","DOIUrl":"https://doi.org/10.1109/SSST.1993.522842","url":null,"abstract":"The design and implementation of a local area network for the Department of Mathematics and Computer Science at Western Carolina University are presented. This was part of a project to establish one of many local area networks which will eventually be connected by a campus backbone. The various design stages and work details that should be addressed before installing a local area network are discussed. A schematic design of the layout of the network is included.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133749226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel computing array algorithm for GLC matrix calculations","authors":"C. T. Ng","doi":"10.1109/SSST.1993.522824","DOIUrl":"https://doi.org/10.1109/SSST.1993.522824","url":null,"abstract":"The gray-level co-occurrence (GLC) method, a texture analysis algorithm in which GLC matrices are computed on subregions of an image, is considered. The large number of calculations required to find the matrices for an image of any practical size precludes use of the GLC method in real-time systems. The author defines the GLC matrix and shows that the computation of all GLC matrices for an image has time complexity O(N/sup 4/) for an image of size N /spl times/ N when conventional methods are used. A parallel computing array for use in calculating GLC matrices is presented, and an associated GLC matrix calculation is explained. The algorithm is shown to have time complexity O(N/sup 2/) for large N.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129209963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparative analysis of image compression techniques","authors":"D. J. Jackson, S.J. Hannah","doi":"10.1109/SSST.1993.522833","DOIUrl":"https://doi.org/10.1109/SSST.1993.522833","url":null,"abstract":"Data compression as it is applicable to image processing is addressed. The relative effectiveness of several image compression strategies is analyzed. This study covers data compression algorithms, file format schemes, and fractal image compression. An overview of the popular LZW compression algorithm and its subsequent variations is also given. Several common image file formats are surveyed, highlighting the differing approaches to image compression. Fractal compression is examined in depth to reveal how an interactive approach to image compression is implemented. The performance of these techniques is compared for a variety of landscape images, considering such parameters as data reduction ratios and information loss.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127285939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constrained multivariable control of a diaphragm-type chlorine/caustic electrolyzers using dynamic matrix control","authors":"M. Nikravesh, A. Farell, T. Stanford, C.T. Lee","doi":"10.1109/SSST.1993.522784","DOIUrl":"https://doi.org/10.1109/SSST.1993.522784","url":null,"abstract":"A multivariable linear dynamic matrix control (DMC) strategy is implemented for a highly nonlinear, electrochemical process with significant dead time. The goal is for the control system to improve energy efficiency by returning the process to the desired operating point or to within control limits in an optimal manner. A comparison of the DMC strategy to traditional control strategies shows improved controller performance with DMC.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115316868","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}