Pub Date : 1994-04-10DOI: 10.1109/SECON.1994.324268
I. B. Fernandez, W. Subbarao
The current evolution of the public integrated services digital network (ISDN) with its complete end to end digital connectivity provides an excellent platform for networking and reliable data communications. The primary objective of the present work is to develop and implement methodologies for successful data encryption schemes which can be embedded into the ISDN customer premises equipment (CPE) and require no software upgrades of the switching equipment. This will make the public ISDN network look like a private network to the security conscious user. Furthermore, secure data communication is provided over circuit switched voice or data channels. Widely used encryption and keying schemes based upon the data encryption standard (DES), secret key cryptography, and Rivest-Shamir-Adleman (RSA) public key cryptography algorithms are being investigated for their applicability in the ISDN environment. Initial investigations show that a HYBRID cryptographic approach, RSA for authentication, and DES for encryption, may be most appropriate. Efforts are underway to develop a hardware and software implementation for the HYBRID approach. In the paper, the authors discuss possible standards for ISDN security that will allow data (including voice) transmitted over the ISDN basic rate interface (BRI) line to be encrypted so that only the intended receiver can decipher it. The ideas presented can easily be transported to the packet switched channels, primary rate interface (PRI) and possibly to broadband ISDN (BISDN).<>
{"title":"Encryption based security for ISDN communication: technique and application","authors":"I. B. Fernandez, W. Subbarao","doi":"10.1109/SECON.1994.324268","DOIUrl":"https://doi.org/10.1109/SECON.1994.324268","url":null,"abstract":"The current evolution of the public integrated services digital network (ISDN) with its complete end to end digital connectivity provides an excellent platform for networking and reliable data communications. The primary objective of the present work is to develop and implement methodologies for successful data encryption schemes which can be embedded into the ISDN customer premises equipment (CPE) and require no software upgrades of the switching equipment. This will make the public ISDN network look like a private network to the security conscious user. Furthermore, secure data communication is provided over circuit switched voice or data channels. Widely used encryption and keying schemes based upon the data encryption standard (DES), secret key cryptography, and Rivest-Shamir-Adleman (RSA) public key cryptography algorithms are being investigated for their applicability in the ISDN environment. Initial investigations show that a HYBRID cryptographic approach, RSA for authentication, and DES for encryption, may be most appropriate. Efforts are underway to develop a hardware and software implementation for the HYBRID approach. In the paper, the authors discuss possible standards for ISDN security that will allow data (including voice) transmitted over the ISDN basic rate interface (BRI) line to be encrypted so that only the intended receiver can decipher it. The ideas presented can easily be transported to the packet switched channels, primary rate interface (PRI) and possibly to broadband ISDN (BISDN).<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128532515","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 : 1994-04-10DOI: 10.1109/SECON.1994.324271
D. Petr, C. Braun, R. Rabi
In many mixed-technology packet switching networks, segmentation is required to convert larger data units of one technology (e.g., frame relay) to data units of another technology (e.g., asynchronous transfer mode or ATM). This paper examines cut-through and non-cut-through segmentation and presents simulation results of delay performance for these two options for a network consisting of local access arrangements, frame relay network access links, and an ATM backbone network, cut-through segmentation is found to significantly reduce delays when the segmenter input blocks are large compared to the output segments and the segmenter input clock rate is small compared to other network rates. Cut-through segmentation also typically produces a less bursty output stream which improves queuing delay performance for all network traffic. In our sample network, the effect of the different segmentation options is found to be highly dependent on the local access arrangement.<>
{"title":"Delay performance of segmentation options for mixed packet networks","authors":"D. Petr, C. Braun, R. Rabi","doi":"10.1109/SECON.1994.324271","DOIUrl":"https://doi.org/10.1109/SECON.1994.324271","url":null,"abstract":"In many mixed-technology packet switching networks, segmentation is required to convert larger data units of one technology (e.g., frame relay) to data units of another technology (e.g., asynchronous transfer mode or ATM). This paper examines cut-through and non-cut-through segmentation and presents simulation results of delay performance for these two options for a network consisting of local access arrangements, frame relay network access links, and an ATM backbone network, cut-through segmentation is found to significantly reduce delays when the segmenter input blocks are large compared to the output segments and the segmenter input clock rate is small compared to other network rates. Cut-through segmentation also typically produces a less bursty output stream which improves queuing delay performance for all network traffic. In our sample network, the effect of the different segmentation options is found to be highly dependent on the local access arrangement.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131140681","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 : 1994-04-10DOI: 10.1109/SECON.1994.324314
S. Natarajan, B. Chase
The paper presents a new actively compensated filter, which is a modified form of an existing active filter. Design guidelines are developed to eliminate its first order sensitivity and to reduce the second order sensitivity through optimization. PSPICE simulations and experimental results are provided to prove the theoretical predictions. Simulation and experimental results also show that, by choosing proper op. amps., the new circuit can be used to realize filters at very high frequencies in the order of a few hundreds of kHz.<>
{"title":"Design and optimization of a new actively compensated filter","authors":"S. Natarajan, B. Chase","doi":"10.1109/SECON.1994.324314","DOIUrl":"https://doi.org/10.1109/SECON.1994.324314","url":null,"abstract":"The paper presents a new actively compensated filter, which is a modified form of an existing active filter. Design guidelines are developed to eliminate its first order sensitivity and to reduce the second order sensitivity through optimization. PSPICE simulations and experimental results are provided to prove the theoretical predictions. Simulation and experimental results also show that, by choosing proper op. amps., the new circuit can be used to realize filters at very high frequencies in the order of a few hundreds of kHz.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127922597","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 : 1994-04-10DOI: 10.1109/SECON.1994.324339
P. Monnes, B. Furht
One of the hottest areas of development in the computer industry today is motion video on the desktop. Both motion video and still image video pose some new problems: huge storage and high bandwidths are required to send, view or store video data in a timely fashion. Compression techniques may help to reduce the amount of data by trading processing power for reduced data size. For both video compression and decompression, very large amounts of processing power are required to handle the video data quickly enough. Parallel processing is being used in some cases to solve this need for processing power. This paper explores some of the parallel processing techniques currently being used, and some additional possibilities for parallelization. It focuses primarily on JPEG (Joint Photographic Experts Group) techniques, but many of the concepts are applicable to other compression schemes. Results from a simple PC-based JPEG compression/decompression program are used to explore some of the techniques.<>
{"title":"Parallel JPEG algorithms for still image compression","authors":"P. Monnes, B. Furht","doi":"10.1109/SECON.1994.324339","DOIUrl":"https://doi.org/10.1109/SECON.1994.324339","url":null,"abstract":"One of the hottest areas of development in the computer industry today is motion video on the desktop. Both motion video and still image video pose some new problems: huge storage and high bandwidths are required to send, view or store video data in a timely fashion. Compression techniques may help to reduce the amount of data by trading processing power for reduced data size. For both video compression and decompression, very large amounts of processing power are required to handle the video data quickly enough. Parallel processing is being used in some cases to solve this need for processing power. This paper explores some of the parallel processing techniques currently being used, and some additional possibilities for parallelization. It focuses primarily on JPEG (Joint Photographic Experts Group) techniques, but many of the concepts are applicable to other compression schemes. Results from a simple PC-based JPEG compression/decompression program are used to explore some of the techniques.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127418227","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 : 1994-04-10DOI: 10.1109/SECON.1994.324270
A. Burrell, P. Papantoni-Kazakos
Discusses traffic management for broadband networks operating under the asynchronous transfer mode (ATM). The design of hybrid traffic management algorithms for the multiplexing of heterogenous classes of data over a common digital channel is of particular interest. Within the broadband integrated services digital network (B-ISDN) environment, we focus on the following traffic classes: voice, video, high-speed data and low-speed data. Each traffic category imposes different quality of service (QOS) requirements while simultaneously presenting traffic input rates which may vary dynamically. The prime issue is the deployment of hybrid multiplexing algorithms (HMAs) which satisfy both the constraints and QOSs of all traffic categories, while simultaneously attaining high channel utilization and induce low implementation overhead. A class of HMAs corresponds to a semi-dynamic capacity allocation approach, generally applicable to environments where traffic rates vary relatively slowly and their statistics are parametrically known. These semi-dynamic HMAs induce frame structures, where the capacity allocation per frame is dictated by a superimposed traffic monitoring algorithm (TMA). A key attribute of our TMA is its ability to quickly detect shifts in the rates of the traffic it monitors. The decisions induced by the TMA represent traffic characterization. For traffic management, they dictate pertinent capacity allocations per traffic class and may also be fed back to the input traffic cells to control the traffic load accordingly.<>
{"title":"Traffic management in broadband integrated services digital networks","authors":"A. Burrell, P. Papantoni-Kazakos","doi":"10.1109/SECON.1994.324270","DOIUrl":"https://doi.org/10.1109/SECON.1994.324270","url":null,"abstract":"Discusses traffic management for broadband networks operating under the asynchronous transfer mode (ATM). The design of hybrid traffic management algorithms for the multiplexing of heterogenous classes of data over a common digital channel is of particular interest. Within the broadband integrated services digital network (B-ISDN) environment, we focus on the following traffic classes: voice, video, high-speed data and low-speed data. Each traffic category imposes different quality of service (QOS) requirements while simultaneously presenting traffic input rates which may vary dynamically. The prime issue is the deployment of hybrid multiplexing algorithms (HMAs) which satisfy both the constraints and QOSs of all traffic categories, while simultaneously attaining high channel utilization and induce low implementation overhead. A class of HMAs corresponds to a semi-dynamic capacity allocation approach, generally applicable to environments where traffic rates vary relatively slowly and their statistics are parametrically known. These semi-dynamic HMAs induce frame structures, where the capacity allocation per frame is dictated by a superimposed traffic monitoring algorithm (TMA). A key attribute of our TMA is its ability to quickly detect shifts in the rates of the traffic it monitors. The decisions induced by the TMA represent traffic characterization. For traffic management, they dictate pertinent capacity allocations per traffic class and may also be fed back to the input traffic cells to control the traffic load accordingly.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124029510","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 : 1994-04-10DOI: 10.1109/SECON.1994.324286
Y. Jiang, J.S. Park, D. Clements, T. Hesketh
This paper considers adaptive control of robot manipulators in task space. An adaptive sliding-mode control scheme is combined with nonlinear integral control to derive a globally stable adaptive control algorithm. With this algorithm, the robustness is guaranteed by the sliding-mode control law and the chattering associated with sliding mode control is eliminated by the integral control law. With the proposed algorithm, model uncertainties and external disturbances can be easily handled. The algorithm has the advantages that the inverse of the Jacobian matrix is not required, that a detailed description of the dynamic model is not required and that only some PID operations are required for its implementation.<>
{"title":"Adaptive control of robot manipulators in task space","authors":"Y. Jiang, J.S. Park, D. Clements, T. Hesketh","doi":"10.1109/SECON.1994.324286","DOIUrl":"https://doi.org/10.1109/SECON.1994.324286","url":null,"abstract":"This paper considers adaptive control of robot manipulators in task space. An adaptive sliding-mode control scheme is combined with nonlinear integral control to derive a globally stable adaptive control algorithm. With this algorithm, the robustness is guaranteed by the sliding-mode control law and the chattering associated with sliding mode control is eliminated by the integral control law. With the proposed algorithm, model uncertainties and external disturbances can be easily handled. The algorithm has the advantages that the inverse of the Jacobian matrix is not required, that a detailed description of the dynamic model is not required and that only some PID operations are required for its implementation.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128712310","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 : 1994-04-10DOI: 10.1109/SECON.1994.324363
W. Porter, W. Liu
This study presents a methodology for specifying a neural controller for a system about which no a priori model information is available.<>
本研究提出了一种方法，用于为没有先验模型信息的系统指定神经控制器。
{"title":"Neural feedback controllers","authors":"W. Porter, W. Liu","doi":"10.1109/SECON.1994.324363","DOIUrl":"https://doi.org/10.1109/SECON.1994.324363","url":null,"abstract":"This study presents a methodology for specifying a neural controller for a system about which no a priori model information is available.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129128967","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 : 1994-04-10DOI: 10.1109/SECON.1994.324298
L. N. Kumar, C. Douligeris
An enhanced assessment protocol (EAP) is proposed for DQDB MANs. The proposed scheme comprises of two independent assessment cycles. The DANT cycles continuously update time dependent network information. The perception cycles estimate the required change in the perception of the node population in the network, to serve the existing demand pattern better and supports dynamic bandwidth control.<>
{"title":"An enhanced assessment protocol to support the dynamic bandwidth control capabilities in DQDB MANs","authors":"L. N. Kumar, C. Douligeris","doi":"10.1109/SECON.1994.324298","DOIUrl":"https://doi.org/10.1109/SECON.1994.324298","url":null,"abstract":"An enhanced assessment protocol (EAP) is proposed for DQDB MANs. The proposed scheme comprises of two independent assessment cycles. The DANT cycles continuously update time dependent network information. The perception cycles estimate the required change in the perception of the node population in the network, to serve the existing demand pattern better and supports dynamic bandwidth control.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116883984","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 : 1994-04-10DOI: 10.1109/SECON.1994.324259
Eyup Akpinar, A. Ersak
In this paper, the output response of speed and current controllers are presented for a slip energy recovery drive system that is perturbed by the negative step inputs in mechanical power. The operating region of the controllers in terms of the DC link current as a function of the rotor speed is obtained.<>
{"title":"Closed loop control of a slip energy recovery system-practical results","authors":"Eyup Akpinar, A. Ersak","doi":"10.1109/SECON.1994.324259","DOIUrl":"https://doi.org/10.1109/SECON.1994.324259","url":null,"abstract":"In this paper, the output response of speed and current controllers are presented for a slip energy recovery drive system that is perturbed by the negative step inputs in mechanical power. The operating region of the controllers in terms of the DC link current as a function of the rotor speed is obtained.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123640876","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 : 1994-04-10DOI: 10.1109/SECON.1994.324319
D.R. Marpka, W. Hwang, V. Moturi
In this paper the performance of a neural network with an activation function with constant and adaptable slope is presented. Later the network can be used as a neurocontroller to estimate the state and isolate the faulty power system from the rest of the system. The method is illustrated with an example.<>
{"title":"Neurocontroller with adaptable activation function for power system studies","authors":"D.R. Marpka, W. Hwang, V. Moturi","doi":"10.1109/SECON.1994.324319","DOIUrl":"https://doi.org/10.1109/SECON.1994.324319","url":null,"abstract":"In this paper the performance of a neural network with an activation function with constant and adaptable slope is presented. Later the network can be used as a neurocontroller to estimate the state and isolate the faulty power system from the rest of the system. The method is illustrated with an example.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522693","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
扫码关注我们
求助内容：
应助结果提醒方式：