Pub Date : 1992-04-12DOI: 10.1109/SECON.1992.202295
R. Petrovic
The synchronization in the code-division multiple-access (CDMA) fiber-optic networks reduces interchannel interference, permits larger number of stations, and gives higher throughput. In the star topology proposed, very strict synchronization of transmitters and equalization of propagation delays over various paths in the network is achieved since a single optical source is used for the whole network, and all the signals follow that same path around the network. Other advantages are that the operation mode of the optical source is pulsed, not continuous-wave, and the attenuation variations among interfering signals are low. The major disadvantage of the proposed system is in its stricter power constraints. This problem can be alleviated by the insertion of optical amplifiers when the number of stations outgrows the limits of the basic network.<>
{"title":"Synchronous CDMA technique for fiber-optic LANs with folded dual bus topology","authors":"R. Petrovic","doi":"10.1109/SECON.1992.202295","DOIUrl":"https://doi.org/10.1109/SECON.1992.202295","url":null,"abstract":"The synchronization in the code-division multiple-access (CDMA) fiber-optic networks reduces interchannel interference, permits larger number of stations, and gives higher throughput. In the star topology proposed, very strict synchronization of transmitters and equalization of propagation delays over various paths in the network is achieved since a single optical source is used for the whole network, and all the signals follow that same path around the network. Other advantages are that the operation mode of the optical source is pulsed, not continuous-wave, and the attenuation variations among interfering signals are low. The major disadvantage of the proposed system is in its stricter power constraints. This problem can be alleviated by the insertion of optical amplifiers when the number of stations outgrows the limits of the basic network.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133704633","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 : 1992-04-12DOI: 10.1109/SECON.1992.202328
A. Misra, P. K. Ajmera
The effects of hydrogen annealing in the 400 degrees C-600 degrees C range on oxides grown on silicon in 100 degrees C-300 degrees C temperature range by negative point-to-plane corona discharge were examined. This growth technique results in significant oxide growth rates, even at these low growth temperatures. The lowest interface state density for unannealed samples was obtained for samples grown at 100 degrees C. Among the annealed samples the lowest interface state density of 7.7*10/sup 11/ cm/sup -2/ in 0.05-0.5 eV range above the valence band edge for samples grown at 300 degrees C. Annealing at 600 degrees C gave the highest values for interface state densities, whereas the 500 degrees C annealed samples showed intermediate values with only a slight improvement over annealed cases. The changes in the interface state densities is attributed to the behavior of Si-H bonds at different annealing temperatures. The rate of change in the flat band voltage of 3.05, 8.2, and 10.2 mV/ degrees C was obtained in the annealing temperature range of 400 degrees C-600 degrees C for the oxide growth temperatures of 100 degrees C, 200 degrees C, and 300 degrees C respectively.<>
{"title":"Effects of hydrogen annealing on low temperature grown oxides on silicon by negative point-to-point corona discharge oxidation","authors":"A. Misra, P. K. Ajmera","doi":"10.1109/SECON.1992.202328","DOIUrl":"https://doi.org/10.1109/SECON.1992.202328","url":null,"abstract":"The effects of hydrogen annealing in the 400 degrees C-600 degrees C range on oxides grown on silicon in 100 degrees C-300 degrees C temperature range by negative point-to-plane corona discharge were examined. This growth technique results in significant oxide growth rates, even at these low growth temperatures. The lowest interface state density for unannealed samples was obtained for samples grown at 100 degrees C. Among the annealed samples the lowest interface state density of 7.7*10/sup 11/ cm/sup -2/ in 0.05-0.5 eV range above the valence band edge for samples grown at 300 degrees C. Annealing at 600 degrees C gave the highest values for interface state densities, whereas the 500 degrees C annealed samples showed intermediate values with only a slight improvement over annealed cases. The changes in the interface state densities is attributed to the behavior of Si-H bonds at different annealing temperatures. The rate of change in the flat band voltage of 3.05, 8.2, and 10.2 mV/ degrees C was obtained in the annealing temperature range of 400 degrees C-600 degrees C for the oxide growth temperatures of 100 degrees C, 200 degrees C, and 300 degrees C respectively.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461497","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 : 1992-04-12DOI: 10.1109/SECON.1992.202386
N. Attia, J.C. Rose
The authors discuss two optimization techniques for finding the minimum of an objective function while avoiding a saddle point solution. The first is a technique to handle the unconstrained objective function and the second is a technique to handle the constrained optimization problem. The winner-take-all neural network problem and the winner-take-all problem with constraints are considered.<>
{"title":"Some comments on optimization techniques in neural networks","authors":"N. Attia, J.C. Rose","doi":"10.1109/SECON.1992.202386","DOIUrl":"https://doi.org/10.1109/SECON.1992.202386","url":null,"abstract":"The authors discuss two optimization techniques for finding the minimum of an objective function while avoiding a saddle point solution. The first is a technique to handle the unconstrained objective function and the second is a technique to handle the constrained optimization problem. The winner-take-all neural network problem and the winner-take-all problem with constraints are considered.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451964","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 : 1992-04-12DOI: 10.1109/SECON.1992.202279
T. Lee, G. Vaughn
The authors describe an algorithm that may be used to evaluate the interference that will be experienced by a narrowband receiver from emissions of several hundred low-power, randomly distributed, cochannel, spread-spectrum, portable transmitters. In addition to the algorithm, sample runs of a computer model using this algorithm are presented and discussed. This application of the algorithm shows that multiple spread-spectrum portable units with densities and output powers in the range of those studied in this example can have a serious effect on the signal-to-noise ratio of narrowband, cochannel receivers located in the same general area.<>
{"title":"A method for predicting interference into a narrow band receiver from portable, direct sequence, spread spectrum CDMA transmitters","authors":"T. Lee, G. Vaughn","doi":"10.1109/SECON.1992.202279","DOIUrl":"https://doi.org/10.1109/SECON.1992.202279","url":null,"abstract":"The authors describe an algorithm that may be used to evaluate the interference that will be experienced by a narrowband receiver from emissions of several hundred low-power, randomly distributed, cochannel, spread-spectrum, portable transmitters. In addition to the algorithm, sample runs of a computer model using this algorithm are presented and discussed. This application of the algorithm shows that multiple spread-spectrum portable units with densities and output powers in the range of those studied in this example can have a serious effect on the signal-to-noise ratio of narrowband, cochannel receivers located in the same general area.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395568","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 : 1992-04-12DOI: 10.1109/SECON.1992.202274
Warren T. Jones, R. K. Vachha, A. Kulshrestha
DENDRITE is a visualization system being developed that helps interpret neural network (NN) data. DENDRITE's design consists of three overlapping modules: the graphical representation of the network: the interface between the NN simulation, the representation of the analyzed data, and the NN itself; and data analysis. The backpropagation algorithm was selected to train the network. The graphical representation aids the researcher in visually perceiving the dynamic nature of the network as it is being trained with a given configuration and data. The system basically consists of a graphical user interface with a toolkit that contains primitives to build a neural network, and an interface to a library of mathematical and statistical functions.<>
{"title":"DENDRITE: A system for visual interpretation of neural network data","authors":"Warren T. Jones, R. K. Vachha, A. Kulshrestha","doi":"10.1109/SECON.1992.202274","DOIUrl":"https://doi.org/10.1109/SECON.1992.202274","url":null,"abstract":"DENDRITE is a visualization system being developed that helps interpret neural network (NN) data. DENDRITE's design consists of three overlapping modules: the graphical representation of the network: the interface between the NN simulation, the representation of the analyzed data, and the NN itself; and data analysis. The backpropagation algorithm was selected to train the network. The graphical representation aids the researcher in visually perceiving the dynamic nature of the network as it is being trained with a given configuration and data. The system basically consists of a graphical user interface with a toolkit that contains primitives to build a neural network, and an interface to a library of mathematical and statistical functions.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116896235","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 : 1992-04-12DOI: 10.1109/SECON.1992.202395
S. Easwaran, J. Gowdy
A novel algorithm for codebook initialization for use with the K-means algorithm for codebook generation is presented. This algorithm was shown to result in better codebooks at considerably reduced generation time compared to Lloyd's algorithm and to other codebook initialization algorithms. The proposed algorithm generated codebooks with smaller maxima and smaller standard deviations of the codebook vector quantization (VQ) distortions. These outcomes were consistently observed with substantial margins for all cases considered.<>
{"title":"An improved initialization algorithm for use with the K-means algorithm for code book generation","authors":"S. Easwaran, J. Gowdy","doi":"10.1109/SECON.1992.202395","DOIUrl":"https://doi.org/10.1109/SECON.1992.202395","url":null,"abstract":"A novel algorithm for codebook initialization for use with the K-means algorithm for codebook generation is presented. This algorithm was shown to result in better codebooks at considerably reduced generation time compared to Lloyd's algorithm and to other codebook initialization algorithms. The proposed algorithm generated codebooks with smaller maxima and smaller standard deviations of the codebook vector quantization (VQ) distortions. These outcomes were consistently observed with substantial margins for all cases considered.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114404441","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 : 1992-04-12DOI: 10.1109/SECON.1992.202389
J. Cross
Several vendors are marketing digital signal processing equipment for instructional laboratories. The author describes an investigation of several such systems and discusses equipment that is presently being used. A digital signal processing laboratory that introduces the student to a variety of modern digital signal processors is being developed at Southern University, LA, USA. Presently, five different systems have been acquired. Some systems are fully operational, while others are being installed. The experience gained is presented.<>
{"title":"Getting a digital signal processor laboratory started (education)","authors":"J. Cross","doi":"10.1109/SECON.1992.202389","DOIUrl":"https://doi.org/10.1109/SECON.1992.202389","url":null,"abstract":"Several vendors are marketing digital signal processing equipment for instructional laboratories. The author describes an investigation of several such systems and discusses equipment that is presently being used. A digital signal processing laboratory that introduces the student to a variety of modern digital signal processors is being developed at Southern University, LA, USA. Presently, five different systems have been acquired. Some systems are fully operational, while others are being installed. The experience gained is presented.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115765321","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 : 1992-04-12DOI: 10.1109/SECON.1992.202412
A. Elsherbeni, D. Kajfez, J.A. Hawes
An educational software package has been developed which makes use of the personal computer for generating graphical displays of the various modes in hollow waveguides. WGVMAP is an interactive software for computing and plotting the electric and the magnetic field lines of various modes in rectangular and circular waveguides, including sectoral and circular with a conducting baffle. The user can choose the number of grid points and the step size and decide whether to change the minimum field magnitude below which the field lines are not plotted.<>
{"title":"WGVMAP-a software for mapping of vector fields in waveguides","authors":"A. Elsherbeni, D. Kajfez, J.A. Hawes","doi":"10.1109/SECON.1992.202412","DOIUrl":"https://doi.org/10.1109/SECON.1992.202412","url":null,"abstract":"An educational software package has been developed which makes use of the personal computer for generating graphical displays of the various modes in hollow waveguides. WGVMAP is an interactive software for computing and plotting the electric and the magnetic field lines of various modes in rectangular and circular waveguides, including sectoral and circular with a conducting baffle. The user can choose the number of grid points and the step size and decide whether to change the minimum field magnitude below which the field lines are not plotted.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115830035","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 : 1992-04-12DOI: 10.1109/SECON.1992.202320
C. Katsinis
The author describes a simple image processing technique for reconstruction of target images distorted due to propagation through a turbulent medium. Image processing algorithms based on shifted-average techniques that are used to reconstruct the original image are presented. Once an estimate of the point spread function of the turbulent medium is obtained by observing a target while it is still distant, a relatively small number of images can be used to obtain reconstructed estimates of the approaching target image. Compared to simple averaging, the shifted-average method produces relatively more precise results by using fewer images. The quality of the reconstruction depends on the particular gas combination and on the number of images used by the reconstruction algorithm.<>
{"title":"The reconstruction of images distorted by hypersonic turbulence","authors":"C. Katsinis","doi":"10.1109/SECON.1992.202320","DOIUrl":"https://doi.org/10.1109/SECON.1992.202320","url":null,"abstract":"The author describes a simple image processing technique for reconstruction of target images distorted due to propagation through a turbulent medium. Image processing algorithms based on shifted-average techniques that are used to reconstruct the original image are presented. Once an estimate of the point spread function of the turbulent medium is obtained by observing a target while it is still distant, a relatively small number of images can be used to obtain reconstructed estimates of the approaching target image. Compared to simple averaging, the shifted-average method produces relatively more precise results by using fewer images. The quality of the reconstruction depends on the particular gas combination and on the number of images used by the reconstruction algorithm.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116073829","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 : 1992-04-12DOI: 10.1109/SECON.1992.202378
S. Bhandarkar, Rathy Shankar, M. Suk
The authors show how data parallelism can be exploited at various stages in the recognition and localization of 3D objects from range data. These stages are edge detection, segmentation, feature extraction; matching, and pose determination. Qualitative classification of surfaces based on the signs of the mean and Gaussian curvature is used to come up with dihedral feature junctions as features for matching and pose determination. Dihedral feature junctions are shown to be fairly robust to occlusion and offer a viewpoint-independent modeling technique for the curved objects under consideration. This offers a considerable saving in terms of storing the object models as compared to the viewpoint-dependent modeling techniques which need to store multiple views of a single object model. Dihedral feature junctions are quite easy to extract and do not require very elaborate segmentation. Experimental results on the Connection Machine showed the advantages of exploiting parallelism in 3D object recognition.<>
{"title":"Exploiting parallelism in 3D object recognition using the Connection Machine","authors":"S. Bhandarkar, Rathy Shankar, M. Suk","doi":"10.1109/SECON.1992.202378","DOIUrl":"https://doi.org/10.1109/SECON.1992.202378","url":null,"abstract":"The authors show how data parallelism can be exploited at various stages in the recognition and localization of 3D objects from range data. These stages are edge detection, segmentation, feature extraction; matching, and pose determination. Qualitative classification of surfaces based on the signs of the mean and Gaussian curvature is used to come up with dihedral feature junctions as features for matching and pose determination. Dihedral feature junctions are shown to be fairly robust to occlusion and offer a viewpoint-independent modeling technique for the curved objects under consideration. This offers a considerable saving in terms of storing the object models as compared to the viewpoint-dependent modeling techniques which need to store multiple views of a single object model. Dihedral feature junctions are quite easy to extract and do not require very elaborate segmentation. Experimental results on the Connection Machine showed the advantages of exploiting parallelism in 3D object recognition.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116229673","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
扫码关注我们
求助内容：
应助结果提醒方式：