{"title":"A heuristic approach to the computation of 3D-ray trajectories in step index optical fibers","authors":"Athanasios Nassopoulos, R. Pieper","doi":"10.1109/SSST.1993.522766","DOIUrl":"https://doi.org/10.1109/SSST.1993.522766","url":null,"abstract":"Three-dimensional-ray trajectories in an optical fiber are derived using a simple correspondence principle. The ray trajectories are linked to the mode number of the exact waveguide solutions. The analysis and simulations presented are in terms of dimensionless parameters needed to characterize the optical fiber. Specifically, this includes the V-parameter, the core index of refraction, and the numerical aperture. The curves for allowed radial and azimuthal mode numbers are presented in terms of dimensions that are normalized by the core radius. The approach is extensible to graded-index fibers.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"25 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":"130258373","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":"Hybrid adaptive tracking control of rigid-link electrically driven robots actuated by switched reluctance motors","authors":"M. Leviner, D. Dawson","doi":"10.1109/SSST.1993.522741","DOIUrl":"https://doi.org/10.1109/SSST.1993.522741","url":null,"abstract":"The controller is hybrid in the sense that an adaptive controller is used to compensate for parametric uncertainties within the nonlinear model of the manipulator while an adaptive robust controller corrects for the typically ignored electrical actuator dynamics. That is, in spite of parametric uncertainty throughout the entire electromechanical system dynamics and additive bounded electrical disturbances, it is still possible to ensure a global uniform asymptotic stability (GUAS) result for the link position tracking error.","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":"127251697","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":"Total least squares and constrained least squares applied to frequency domain system identification","authors":"W.R. Young, D. Irwin","doi":"10.1109/SSST.1993.522787","DOIUrl":"https://doi.org/10.1109/SSST.1993.522787","url":null,"abstract":"Total-least-squares and constrained-least-squares methods are applied to the Transfer Function Determination Code (TFDC). TFDC is a frequency domain system identification code for determining the SISO input-output transfer function of a system from experimentally derived frequency response data. TFDC is modified to implement a total-least-squares solution, to employ a solution to the combined least-squares/total-least-squares problem, and to apply constrained least squares to ensure quadrantal symmetry of the poles and zeros. Results of applying each method to an example system are presented and compared.","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":"127829003","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":"Speaker-independent voiced-stop-consonant recognition using a block-windowed neural network architecture","authors":"B.D. Bryant, J. Gowdy","doi":"10.1109/SSST.1993.522811","DOIUrl":"https://doi.org/10.1109/SSST.1993.522811","url":null,"abstract":"The authors study several of the more well-known connectionist models, and how they address the time and frequency variability of the multispeaker, voiced-stop-consonant recognition task. Among the network architectures reviewed or tested for were the self-organizing feature maps (SOFM) architecture, various derivatives of this architecture, the time-delay neural network (TDNN) architecture, various derivatives of this architecture, and two frequency-and-time-shift-invariant architectures, frequency-shift-invariant TDNN, and the block-windowed neural network (FTDNN and BWNN). Voiced-stop speech was extracted from up to four dialect regions of the TIMIT continuous speech corpus for subsequent preprocessing and training and testing of network instances. Various feature representations were tested for their robustness in representing the voiced-stop consonants.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"28 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":"126274911","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":"Stream-interleaved pipelined RISC processor design for SIMD and MIMD system development","authors":"Tim Killeen, M. Çelenk","doi":"10.1109/SSST.1993.522821","DOIUrl":"https://doi.org/10.1109/SSST.1993.522821","url":null,"abstract":"Architectures exploiting time and space parallelism can be used to increase performance. Reduced instruction set computers (RISC) enhance performance of a single instruction stream through a simple load/store architecture. Data dependencies are eliminated by introducing NOP instructions in the stream. A longer pipeline increases the proportion of NOPs. These gaps may be used to interleave multiple instruction streams. A typical parallel organization based on message passing via main memory undermines the efficiency of a load/store architecture. The authors propose a method of sharing internal registers between instruction streams, forming a building block for efficient SIMD and MIMD systems.","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":"128139925","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":"Economic analysis and evaluation of transformer and induction motor losses costs using PC software","authors":"M. Shwehdi, A. Hye, M. Quasem","doi":"10.1109/SSST.1993.522743","DOIUrl":"https://doi.org/10.1109/SSST.1993.522743","url":null,"abstract":"The authors describe an interactive software package for economically analyzing the costs of losses and initial investment over the life of both a transformer and an induction motor while having a significant positive impact in power engineering education. The interactive nature of this software makes such studies effective and easy to use. With the support of a PC, it can be a useful teaching tool for power system studies. The software is completely menu-driven, and contains appropriate help commands and instructions which enable it to be used without additional documentation.","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":"116885053","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":"Genetic algorithm composes music","authors":"K. Ricanek, A. Homaifar, G. Lebby","doi":"10.1109/SSST.1993.522775","DOIUrl":"https://doi.org/10.1109/SSST.1993.522775","url":null,"abstract":"Genetic algorithms (GAs) and thematic bridging are applied to composition. Thematic bridging allows for the specification of thematic material (frequency, duration, and amplitude) to the GA. The GA controls a dynamic operation set that dictates the placement and arrangement of the thematic material.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"16 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":"124330557","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":"Parallel processing in the networks of workstations","authors":"Yang Wang, M. Celenk","doi":"10.1109/SSST.1993.522819","DOIUrl":"https://doi.org/10.1109/SSST.1993.522819","url":null,"abstract":"A model and statistical algorithms for utilizing networks of workstations as distributed parallel computing systems are described. Each workstation in this model consists of two processors: one for computation and one for communication. The advantages of this model are that the workstations can assign the intensive load balancing and the communication jobs to the communication processor and the code execution (including compiling and linking) jobs to the computation processor. The communication processor provides a quick response to the user and/or to the requests from the other nodes, and the computation processor provides a high throughput without interprocessor communication interrupt.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"72 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":"123544320","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 single-server system with limited service policy","authors":"P. Wang, Z. Wu","doi":"10.1109/SSST.1993.522840","DOIUrl":"https://doi.org/10.1109/SSST.1993.522840","url":null,"abstract":"The exhaustive limited service system, in which the processor takes a preventive maintenance after every M messages are processed, is considered. The probability-generating function of the number of messages in the system and the distribution of the message delay time are derived. From these the average number of messages in the system and the mean delay time of messages are easily obtained.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"35 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":"115296702","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":"Parallel structures for the decomposition of symmetric matrices","authors":"A. Barbir, J. Aravena","doi":"10.1109/SSST.1993.522825","DOIUrl":"https://doi.org/10.1109/SSST.1993.522825","url":null,"abstract":"A systematic method is developed for improving the efficiency of systolic structures designed for the solution of sets of simultaneous linear equations. The method uses the concept of a timing graph to display the evolution of computations in an array as a function of the compute cycle. Timing graph decoupling is used to determine structured sparsity patterns that are executable more efficiently in such arrays. The results are extended to cover symmetric matrices. It is shown that timing graph decoupling identifies the structure of sparse symmetric matrices executable in dense arrays in reduced time with no fill-in.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"63 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":"123651456","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}