Pub Date : 1992-05-04DOI: 10.1109/CMPEUR.1992.218472
W. Textor, S. Wessel, K.-U. Hoffgen
An algorithm is given for extracting fuzzy rules from a neural net model called a self-organizing feature map. These rules can also be transformed into a linguistic form. The algorithm gives an interpretation of the map after the learning process by describing its end configuration with fuzzy rules. This approach can be used in the area of knowledge acquisition if only a vast set of unclassified data of a given domain is available. The underlying ideas of the knowledge extraction algorithm are presented. The generation of membership functions is depicted. The process of creating rules out of these membership functions is described. The results of testing the algorithm with some real data sets are presented.<>
{"title":"Learning fuzzy rules from artificial neural nets","authors":"W. Textor, S. Wessel, K.-U. Hoffgen","doi":"10.1109/CMPEUR.1992.218472","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218472","url":null,"abstract":"An algorithm is given for extracting fuzzy rules from a neural net model called a self-organizing feature map. These rules can also be transformed into a linguistic form. The algorithm gives an interpretation of the map after the learning process by describing its end configuration with fuzzy rules. This approach can be used in the area of knowledge acquisition if only a vast set of unclassified data of a given domain is available. The underlying ideas of the knowledge extraction algorithm are presented. The generation of membership functions is depicted. The process of creating rules out of these membership functions is described. The results of testing the algorithm with some real data sets are presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620586","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-05-04DOI: 10.1109/CMPEUR.1992.218522
D. Perreault, J. Kassakian
A prototype shell system is described which gives single-user applications multiuser interfaces by linking workstations together. The system was designed to be independent of any particular application program, and to operate over low-bandwidth communications links. The limitations of previous techniques were overcome through the use of a parallel processing approach. A preliminary evaluation of the approach is presented, based on experiences with the prototype system.<>
{"title":"Interactive computer support of geographically separated design teams","authors":"D. Perreault, J. Kassakian","doi":"10.1109/CMPEUR.1992.218522","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218522","url":null,"abstract":"A prototype shell system is described which gives single-user applications multiuser interfaces by linking workstations together. The system was designed to be independent of any particular application program, and to operate over low-bandwidth communications links. The limitations of previous techniques were overcome through the use of a parallel processing approach. A preliminary evaluation of the approach is presented, based on experiences with the prototype system.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132085370","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-05-04DOI: 10.1109/CMPEUR.1992.218473
S. Parsons, M. Kubát, M. Dohnal
A symbolically quantified logic is presented for reasoning under uncertainty that is based upon the concept of rough sets. This mathematical model provides a simple yet sound basis for a robust reasoning system. A rule of inference analogous to modus ponens is described, and it is shown how it might be used by a reasoning system to determine the most likely outcome under conditions of uncertain knowledge. An analysis of the robustness of the logic in rule-based reasoning is also presented.<>
{"title":"A robust logic for rule-based reasoning under uncertainty","authors":"S. Parsons, M. Kubát, M. Dohnal","doi":"10.1109/CMPEUR.1992.218473","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218473","url":null,"abstract":"A symbolically quantified logic is presented for reasoning under uncertainty that is based upon the concept of rough sets. This mathematical model provides a simple yet sound basis for a robust reasoning system. A rule of inference analogous to modus ponens is described, and it is shown how it might be used by a reasoning system to determine the most likely outcome under conditions of uncertain knowledge. An analysis of the robustness of the logic in rule-based reasoning is also presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968330","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-05-04DOI: 10.1109/CMPEUR.1992.218423
L. Raffo, D. Caviglia, G. Bisio
The authors present modifications to Kohonen autoassociative maps to increase their efficiency for clustering and decrease their sensitivity to initial conditions. A new update rule is described for the classification for similarity. Some test results are presented for comparison between different algorithms. The new neural network algorithm was applied to the problem of preplacement of VLSI cells with improvement in the quality of the solution and computational time.<>
{"title":"Neural clustering algorithms for classification and pre-placement of VLSI cells","authors":"L. Raffo, D. Caviglia, G. Bisio","doi":"10.1109/CMPEUR.1992.218423","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218423","url":null,"abstract":"The authors present modifications to Kohonen autoassociative maps to increase their efficiency for clustering and decrease their sensitivity to initial conditions. A new update rule is described for the classification for similarity. Some test results are presented for comparison between different algorithms. The new neural network algorithm was applied to the problem of preplacement of VLSI cells with improvement in the quality of the solution and computational time.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114099235","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-05-04DOI: 10.1109/CMPEUR.1992.218435
M. Soriano, F. Recacha, J. L. Melús
The authors present the development and the methodology to implement the software of a secure learning-bridge which has the ability to filter, to forward, and to cipher frames in an extended Ethernet environment. The implemented security system was basically built up with three subsystems. These were a management subsystem, a supervision center, and a set of secure bridges, whose functions were filtering the network data traffic and ciphering/deciphering the sensitive data. These devices, called CryptoNets, are described. The algorithm for data ciphering is discussed.<>
{"title":"A software design and implementation for filtering, forwarding and ciphering in a secure bridge","authors":"M. Soriano, F. Recacha, J. L. Melús","doi":"10.1109/CMPEUR.1992.218435","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218435","url":null,"abstract":"The authors present the development and the methodology to implement the software of a secure learning-bridge which has the ability to filter, to forward, and to cipher frames in an extended Ethernet environment. The implemented security system was basically built up with three subsystems. These were a management subsystem, a supervision center, and a set of secure bridges, whose functions were filtering the network data traffic and ciphering/deciphering the sensitive data. These devices, called CryptoNets, are described. The algorithm for data ciphering is discussed.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"679 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107070","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-05-04DOI: 10.1109/CMPEUR.1992.218469
E. Barros, W. Rosenstiel
The authors present a method for partitioning a problem specification into hardware and a software implementation. A partitioning approach can be supported by the use of a specification language that permits considering several partitioning possibilities for the problem as well as analyzing different implementation alternatives of each part of the problem. These requirements are fulfilled in the approach by the use of UNITY as the specification language. The approach presented consists of classification of statements, a clustering algorithm, and cluster allocation, as well as cost and constraint analysis. The method is explained with an example.<>
{"title":"A method for hardware software partitioning","authors":"E. Barros, W. Rosenstiel","doi":"10.1109/CMPEUR.1992.218469","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218469","url":null,"abstract":"The authors present a method for partitioning a problem specification into hardware and a software implementation. A partitioning approach can be supported by the use of a specification language that permits considering several partitioning possibilities for the problem as well as analyzing different implementation alternatives of each part of the problem. These requirements are fulfilled in the approach by the use of UNITY as the specification language. The approach presented consists of classification of statements, a clustering algorithm, and cluster allocation, as well as cost and constraint analysis. The method is explained with an example.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116130435","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-05-04DOI: 10.1109/CMPEUR.1992.218428
A. Mulkers, W. Winsborough, M. Bruynooghe
The authors extend prior work in liveness analysis for logic programs. They develop an analysis for logic programs that allows compiler optimizations to reuse safely space allocated to data structures. The analysis is based on abstract interpretation and its main contribution consists of extending an abstract domain and operations for type and sharing analysis such that when applied to an abstract interpretation framework, the domain induces a powerful liveness analysis. Preliminary results obtained by an experimental prototype confirmed that useful and detailed information about the lifetime of term substructures can be derived.<>
{"title":"Static analysis of logic programs to detect run-time garbage cells","authors":"A. Mulkers, W. Winsborough, M. Bruynooghe","doi":"10.1109/CMPEUR.1992.218428","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218428","url":null,"abstract":"The authors extend prior work in liveness analysis for logic programs. They develop an analysis for logic programs that allows compiler optimizations to reuse safely space allocated to data structures. The analysis is based on abstract interpretation and its main contribution consists of extending an abstract domain and operations for type and sharing analysis such that when applied to an abstract interpretation framework, the domain induces a powerful liveness analysis. Preliminary results obtained by an experimental prototype confirmed that useful and detailed information about the lifetime of term substructures can be derived.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127723037","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-05-04DOI: 10.1109/CMPEUR.1992.218506
K. Sacha
A method for specification and early validation of embedded software is presented. The method is based on an extension to Petri nets, which provides a framework for building an executable model of a specification and describing control as well as data processing aspects of the software. A specification is developed by an object-oriented problem decomposition into a set of parallel processes. Each process is defined by a pair consisting of a Petri net and a data path. An algebraic model of the specification is defined, and basic problems for the model analysis are indicated. The generality of the model is shown by comparison with the functional specification language PAISLey.<>
{"title":"Transnet approach to requirements specification and prototyping","authors":"K. Sacha","doi":"10.1109/CMPEUR.1992.218506","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218506","url":null,"abstract":"A method for specification and early validation of embedded software is presented. The method is based on an extension to Petri nets, which provides a framework for building an executable model of a specification and describing control as well as data processing aspects of the software. A specification is developed by an object-oriented problem decomposition into a set of parallel processes. Each process is defined by a pair consisting of a Petri net and a data path. An algebraic model of the specification is defined, and basic problems for the model analysis are indicated. The generality of the model is shown by comparison with the functional specification language PAISLey.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132810454","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-05-04DOI: 10.1109/CMPEUR.1992.218451
M. Jolfaei, D. Kreuer, O. Maly, U. Quernheim
The authors consider different mathematical models for the error characteristics of satellite channels. They define a descriptive model and four generative models. Two of these are the well-known Gilbert and Fritchman error channel models, while the other two are new Markov models, termed the time-variant (TV) model and the two-layer time-variant (TLTV) model. The Gilbert and Fritchman models, as well as the TLTV model, are compared with the descriptive model and actual channel measurements, obtained by the German PTT on the Olympus 20/30-GHz channel. Block error probabilities and burst error probabilities are compared. For both error types, the TLTV models exhibit the best results.<>
{"title":"Modelling satellite channels-a new approach","authors":"M. Jolfaei, D. Kreuer, O. Maly, U. Quernheim","doi":"10.1109/CMPEUR.1992.218451","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218451","url":null,"abstract":"The authors consider different mathematical models for the error characteristics of satellite channels. They define a descriptive model and four generative models. Two of these are the well-known Gilbert and Fritchman error channel models, while the other two are new Markov models, termed the time-variant (TV) model and the two-layer time-variant (TLTV) model. The Gilbert and Fritchman models, as well as the TLTV model, are compared with the descriptive model and actual channel measurements, obtained by the German PTT on the Olympus 20/30-GHz channel. Block error probabilities and burst error probabilities are compared. For both error types, the TLTV models exhibit the best results.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132108828","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-05-04DOI: 10.1109/CMPEUR.1992.218411
P. Szczepaniak
An algebraic result useful in the computational solution of sets of algebraic matrix equations is derived. An important advantage of the method is that the solution of only one equation is sufficient to determine the solutions of all matrix equations of the class considered without these equations having to be solved directly. An application example from the area of system theory is presented.<>
{"title":"Solution of matrix equations via algebraic transformations","authors":"P. Szczepaniak","doi":"10.1109/CMPEUR.1992.218411","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218411","url":null,"abstract":"An algebraic result useful in the computational solution of sets of algebraic matrix equations is derived. An important advantage of the method is that the solution of only one equation is sufficient to determine the solutions of all matrix equations of the class considered without these equations having to be solved directly. An application example from the area of system theory is presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130349623","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
扫码关注我们
求助内容：
应助结果提醒方式：