Pub Date : 1992-05-04DOI: 10.1109/CMPEUR.1992.218480
J. A. Bakker
A semantic metamodel for database modeling is presented which unifies member aggregation, cover aggregation, horizontal fragmentation, and nondisjunct association. The model was integrated with the Xplain metamodel for conceptual data modeling and supports object association based on a common attribute value. Association may be realized by an access structure or a storage structure.<>
{"title":"A unifying approach to the modelling of object association based on a common property","authors":"J. A. Bakker","doi":"10.1109/CMPEUR.1992.218480","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218480","url":null,"abstract":"A semantic metamodel for database modeling is presented which unifies member aggregation, cover aggregation, horizontal fragmentation, and nondisjunct association. The model was integrated with the Xplain metamodel for conceptual data modeling and supports object association based on a common attribute value. Association may be realized by an access structure or a storage structure.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"17 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":"125447060","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.218486
T. Gjengedal, S. Johansen, O. Hansen
The authors describe the principles of and suggest a methodology for expanding the unit-commitment task beyond pure cost minimization to include environmental objectives. The suggested methodology, economic environmental unit commitment (EEUC), identifies both minimum cost and minimum emission commitment and dispatch schedules for an electric power production system. The EEUC problem formulation includes all standard system constraints, and explicitly addresses variable emission and cost during start-up, operation, and shut-down of electric generating units. The problem was solved by using a powerful Lagrangian relaxation algorithm.<>
{"title":"Economic-environmental unit-commitment (EEUC)-a multicriteria approach","authors":"T. Gjengedal, S. Johansen, O. Hansen","doi":"10.1109/CMPEUR.1992.218486","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218486","url":null,"abstract":"The authors describe the principles of and suggest a methodology for expanding the unit-commitment task beyond pure cost minimization to include environmental objectives. The suggested methodology, economic environmental unit commitment (EEUC), identifies both minimum cost and minimum emission commitment and dispatch schedules for an electric power production system. The EEUC problem formulation includes all standard system constraints, and explicitly addresses variable emission and cost during start-up, operation, and shut-down of electric generating units. The problem was solved by using a powerful Lagrangian relaxation algorithm.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"91 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":"132572731","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.218426
G. Succi, G. Marino
The authors propose an alternative approach to the parallel implementation of declarative languages, the data parallel approach. The focus is on large collections of data and the core idea is to parallelize the execution of elementwise operations. The target language is SEL, a subset equational language. An abstract machine for the language, the SAM (subset abstract machine) is outlined, which from a certain point of view belongs to the WAM family. The data parallel structure of the SAM and of its instruction set is discussed, and some examples are given.<>
{"title":"Exploiting the data parallelism of subset equational languages","authors":"G. Succi, G. Marino","doi":"10.1109/CMPEUR.1992.218426","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218426","url":null,"abstract":"The authors propose an alternative approach to the parallel implementation of declarative languages, the data parallel approach. The focus is on large collections of data and the core idea is to parallelize the execution of elementwise operations. The target language is SEL, a subset equational language. An abstract machine for the language, the SAM (subset abstract machine) is outlined, which from a certain point of view belongs to the WAM family. The data parallel structure of the SAM and of its instruction set is discussed, and some examples are given.<<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":"115136412","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.218434
M. Walker
Second generation mobile and cordless telephone systems, like GSM and DECT, provide for intersystem roaming and have integrated security features. These security features and the role played by smart cards in the implementation and management are discussed. The focus is on the security features provided in DECT because these are more comprehensive, and probably less widely known, then those provided in GSM. The method of authentication is identical to that used for authenticating subscribers accessing a GSM network. However, the DECT authentication mechanism includes an additional feature which is not provided within GSM. This feature provides for greater flexibility in the way authentication keys and authentication data may be managed.<>
{"title":"Security in mobile and cordless telecommunications","authors":"M. Walker","doi":"10.1109/CMPEUR.1992.218434","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218434","url":null,"abstract":"Second generation mobile and cordless telephone systems, like GSM and DECT, provide for intersystem roaming and have integrated security features. These security features and the role played by smart cards in the implementation and management are discussed. The focus is on the security features provided in DECT because these are more comprehensive, and probably less widely known, then those provided in GSM. The method of authentication is identical to that used for authenticating subscribers accessing a GSM network. However, the DECT authentication mechanism includes an additional feature which is not provided within GSM. This feature provides for greater flexibility in the way authentication keys and authentication data may be managed.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"140 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":"115543844","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.218466
A. Pombortsis, I. Vlahavas
The authors present a threshold-based flow control procedure, based on feedback schemes for reducing the performance degradation of packet-switched multistage interconnection networks with binary routing, under a nonuniform hot spot traffic pattern. The use of the proposed feedback policies in such networks permits the discrimination between regular and hot packets, controls the tree saturation, and offers a significant network performance improvement.<>
{"title":"Flow control in packet-switched multistage interconnection networks","authors":"A. Pombortsis, I. Vlahavas","doi":"10.1109/CMPEUR.1992.218466","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218466","url":null,"abstract":"The authors present a threshold-based flow control procedure, based on feedback schemes for reducing the performance degradation of packet-switched multistage interconnection networks with binary routing, under a nonuniform hot spot traffic pattern. The use of the proposed feedback policies in such networks permits the discrimination between regular and hot packets, controls the tree saturation, and offers a significant network performance improvement.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"59 6 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":"124318264","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.218516
E. de Jong, E. Paalvast, H. Sips, M.R. van Steen
An overview is given of the approach followed by the parTool project in developing a parallel programming system. The key feature of parTool is a separation of algorithm specifications and the allocation of hardware resources to data and computations. Algorithms are formulated at an abstract level in a specification language having its own ideal virtual machine, thus preserving the parallelism inherent in the algorithm. Mapping the algorithm onto a specific target machine is done by adding annotations to the description of the algorithm. Porting a program from one machine to another is done by merely changing the mapping annotations. Two high-level specification languages in the parTool system are presented; the parallel transaction-based language Vista, and the data-parallel language Booster.<>
{"title":"High-level specification tools for parallel application development","authors":"E. de Jong, E. Paalvast, H. Sips, M.R. van Steen","doi":"10.1109/CMPEUR.1992.218516","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218516","url":null,"abstract":"An overview is given of the approach followed by the parTool project in developing a parallel programming system. The key feature of parTool is a separation of algorithm specifications and the allocation of hardware resources to data and computations. Algorithms are formulated at an abstract level in a specification language having its own ideal virtual machine, thus preserving the parallelism inherent in the algorithm. Mapping the algorithm onto a specific target machine is done by adding annotations to the description of the algorithm. Porting a program from one machine to another is done by merely changing the mapping annotations. Two high-level specification languages in the parTool system are presented; the parallel transaction-based language Vista, and the data-parallel language Booster.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"87 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":"123238897","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.218414
J. David, B. De Moor
Directional aspects of multiple-input-multiple-output systems relative to one another are studied. The quotient singular value decomposition (QSVD), a generalization of the SVD is used. The definition and some properties of the QSVD are stated. The concepts of the indicator ellipsoid and the oriented energy plot allow for a better visualization of the directional gain. The oriented signal-to-signal ratio, is introduced. It is shown that it can be computed by using the QSVD. Some applications in control are outlined.<>
{"title":"The quotient SVD and directional aspects of 2 transfer matrices","authors":"J. David, B. De Moor","doi":"10.1109/CMPEUR.1992.218414","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218414","url":null,"abstract":"Directional aspects of multiple-input-multiple-output systems relative to one another are studied. The quotient singular value decomposition (QSVD), a generalization of the SVD is used. The definition and some properties of the QSVD are stated. The concepts of the indicator ellipsoid and the oriented energy plot allow for a better visualization of the directional gain. The oriented signal-to-signal ratio, is introduced. It is shown that it can be computed by using the QSVD. Some applications in control are outlined.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"27 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":"126059868","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.218449
D. Cakmakov, V. Arnautovski, D. Davcev
A model for polygon similarity estimation is presented. The advantages of the model are that it introduces a numerical measure of similarity between two polygons; it can be applied for all polygon forms and any number of vertices; and it gives acceptable intuitively interpreted results even in the cases of great differences in the number of polygon vertices. The model has been tested in a large number of experiments. The discussion is restricted to simple planar polygons, i.e., those polygons whose edges do not intersect themselves and whose vertices are represented by ordered pairs of Cartesian coordinates.<>
{"title":"A model for polygon similarity estimation","authors":"D. Cakmakov, V. Arnautovski, D. Davcev","doi":"10.1109/CMPEUR.1992.218449","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218449","url":null,"abstract":"A model for polygon similarity estimation is presented. The advantages of the model are that it introduces a numerical measure of similarity between two polygons; it can be applied for all polygon forms and any number of vertices; and it gives acceptable intuitively interpreted results even in the cases of great differences in the number of polygon vertices. The model has been tested in a large number of experiments. The discussion is restricted to simple planar polygons, i.e., those polygons whose edges do not intersect themselves and whose vertices are represented by ordered pairs of Cartesian coordinates.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"28 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":"121934402","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}
The construction of a multitasking programming environment called MCPE is presented. MCPE contains multiple tasks so that it can speed up response and utilize idle CPU time. Tasks communicate with each other through shared data storage. The tasks (such as a structure editor and a static analyzer) were designed as lightweight processes. The shared data storage (such as the grammar tree and the symbol table) are managed by monitors to guarantee effective sharing. Access on shared data storage is broadcast, so that the related tools can terminate unnecessary jobs. MCPE has been built on Smalltalk using a library of reusable codes, such as the MVC (model, view controller) triad and classes. The experiments showed that response time has been reduced. New tools can easily be built by reusing these classes and can be added to MCPE with no further delay in system response.<>
{"title":"Constructing a multitasking programming environment","authors":"Feng-Jian Wang, Pei-Chi Wu, Kai-Ru Yong, Jieh-Cherng Wang, Cherng-Wu Shaw","doi":"10.1109/CMPEUR.1992.218403","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218403","url":null,"abstract":"The construction of a multitasking programming environment called MCPE is presented. MCPE contains multiple tasks so that it can speed up response and utilize idle CPU time. Tasks communicate with each other through shared data storage. The tasks (such as a structure editor and a static analyzer) were designed as lightweight processes. The shared data storage (such as the grammar tree and the symbol table) are managed by monitors to guarantee effective sharing. Access on shared data storage is broadcast, so that the related tools can terminate unnecessary jobs. MCPE has been built on Smalltalk using a library of reusable codes, such as the MVC (model, view controller) triad and classes. The experiments showed that response time has been reduced. New tools can easily be built by reusing these classes and can be added to MCPE with no further delay in system response.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"73 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":"121724209","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.218453
V. Lee, E. Chan, J. M. Ng
The behavior of the stations in a token ring under an integrated services/multi-LAN environment composed of an Ethernet and a token ring network was studied. Simulation was used in this study. It was found that the position of the stations relative to the bridge affects their performance. Stations that were farthest downstream from the bridge suffered substantial degradation in performance when compared to upstream stations. A dynamic priority allocation scheme which assigns priority to stations according to queue length was found to be effective in improving the fairness and delay/throughput characteristics.<>
{"title":"Location dependency in the token ring of an integrated services/multi-LANs environment","authors":"V. Lee, E. Chan, J. M. Ng","doi":"10.1109/CMPEUR.1992.218453","DOIUrl":"https://doi.org/10.1109/CMPEUR.1992.218453","url":null,"abstract":"The behavior of the stations in a token ring under an integrated services/multi-LAN environment composed of an Ethernet and a token ring network was studied. Simulation was used in this study. It was found that the position of the stations relative to the bridge affects their performance. Stations that were farthest downstream from the bridge suffered substantial degradation in performance when compared to upstream stations. A dynamic priority allocation scheme which assigns priority to stations according to queue length was found to be effective in improving the fairness and delay/throughput characteristics.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"25 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":"129238163","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
扫码关注我们
求助内容：
应助结果提醒方式：