Pub Date : 1996-08-21DOI: 10.1109/CMPSAC.1996.544166
Shigeki Goto
Scope : Internet is prevailing world wide. For example, countries and regions in Asia and Pacific rim are rapidly extending Internet connectivity in both academically and commercia!ly and are now collaborating to plan some hubs and backbones. This panel focuses emerging applications on Internet such as electronic commerce and interactive systems, together to be presented by both such application researchers and Internet community such as APNIC and Internet providers. Discussion will also include cultural issues, legal issues, government involvement, and each country specific issues such as language problems in Asian countries.
{"title":"Would Internet Meet Global Acceptance? - From application perspective -","authors":"Shigeki Goto","doi":"10.1109/CMPSAC.1996.544166","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544166","url":null,"abstract":"Scope : Internet is prevailing world wide. For example, countries and regions in Asia and Pacific rim are rapidly extending Internet connectivity in both academically and commercia!ly and are now collaborating to plan some hubs and backbones. This panel focuses emerging applications on Internet such as electronic commerce and interactive systems, together to be presented by both such application researchers and Internet community such as APNIC and Internet providers. Discussion will also include cultural issues, legal issues, government involvement, and each country specific issues such as language problems in Asian countries.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123269689","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544618
D. Kung, S. Oksanen, Jyhjong Lin
An object-oriented real time systems conceptual modeling approach is described. In this approach, each object is specified by an object type, consisting of supertypes (inheritance), component types (aggregation), attributes, operations, static constraints, and temporal constraints. That is, an object type specification defines a theory of a type of objects. An object-oriented real time conceptual model using the object types can be translated into an augmented Petri net with timing and temporal constraints. A reachability tree of permissible system states is generated for the augmented Petri nets for verifying whether the conceptual model satisfies desired temporal constraints.
{"title":"An object-oriented real time systems modeling and verification methodology","authors":"D. Kung, S. Oksanen, Jyhjong Lin","doi":"10.1109/CMPSAC.1996.544618","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544618","url":null,"abstract":"An object-oriented real time systems conceptual modeling approach is described. In this approach, each object is specified by an object type, consisting of supertypes (inheritance), component types (aggregation), attributes, operations, static constraints, and temporal constraints. That is, an object type specification defines a theory of a type of objects. An object-oriented real time conceptual model using the object types can be translated into an augmented Petri net with timing and temporal constraints. A reachability tree of permissible system states is generated for the augmented Petri nets for verifying whether the conceptual model satisfies desired temporal constraints.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123757170","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542435
Q. Shi, N. Zhang
We generalise and extend a composable security property that was developed for the noninterference requirement and used to deal with composition of components linked as a chain. The generalisation enables the property to enforce different security requirements, while the extension enables the property to handle the case where components are connected as a tree. This generalised and extended composable property is then applied to carry out a case study of security analysis of an information system.
{"title":"Applying composable security properties to assessment of information systems","authors":"Q. Shi, N. Zhang","doi":"10.1109/CMPSAC.1996.542435","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542435","url":null,"abstract":"We generalise and extend a composable security property that was developed for the noninterference requirement and used to deal with composition of components linked as a chain. The generalisation enables the property to enforce different security requirements, while the extension enables the property to handle the case where components are connected as a tree. This generalised and extended composable property is then applied to carry out a case study of security analysis of an information system.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122959980","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544613
K. Yi, Sukyoung Ryu, K. Pyun
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs. Contrary to our earlier method (Yi, 1994) based on abstract interpretation, where the input program's control flow is simultaneously computed while our exception analysis progresses, we separate the two phases in a manner similar to conventional data flow analysis. Before the exception analysis begins, we first estimate the input program's control flow from the type information from SML/NJ compiler. Based on this call-graph structure, exception flow is specified as a set of equations, whose solution is computed using an iterative least fixpoint method. A prototype of this analysis is applied to two realistic SML programs (ML-LEX and OR-SML core) and is 3 or 40 times faster than the earlier method and saves memory by 35 or 65 percent.
{"title":"Estimating uncaught exceptions in Standard ML programs from type-based equations","authors":"K. Yi, Sukyoung Ryu, K. Pyun","doi":"10.1109/CMPSAC.1996.544613","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544613","url":null,"abstract":"We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs. Contrary to our earlier method (Yi, 1994) based on abstract interpretation, where the input program's control flow is simultaneously computed while our exception analysis progresses, we separate the two phases in a manner similar to conventional data flow analysis. Before the exception analysis begins, we first estimate the input program's control flow from the type information from SML/NJ compiler. Based on this call-graph structure, exception flow is specified as a set of equations, whose solution is computed using an iterative least fixpoint method. A prototype of this analysis is applied to two realistic SML programs (ML-LEX and OR-SML core) and is 3 or 40 times faster than the earlier method and saves memory by 35 or 65 percent.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121167528","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544169
S. Miyakawa
The author reports on the status of technologies for Internet multimedia application in practice such as MBone, its utilities and some commercial products. Also introduced are some experimentations which have been carried out on new frameworks and technologies.
{"title":"Internet multimedia application technologies: current practice and future directions","authors":"S. Miyakawa","doi":"10.1109/CMPSAC.1996.544169","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544169","url":null,"abstract":"The author reports on the status of technologies for Internet multimedia application in practice such as MBone, its utilities and some commercial products. Also introduced are some experimentations which have been carried out on new frameworks and technologies.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128122877","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544587
Yimin Bao, E. Horowitz
The current trend of constructing new systems from collections of pre-existing third-party software and commercial off-the-shelf (COTS) products presents serious challenges to existing integration technology. We present a flexible integration framework which has general applicability for pre-existing third-party and COTS software (often highly interactive, with graphical user interface, and without source code access), supports users by allowing them to easily change the way software interacts (thus supporting system evolution and component reusability), and is easily programmable by end-users. Specifically we describe the Tool Integration Language (TIL) and the Tool Integration Server System (TISS) which provide flexible integration mechanisms for our framework and show how they can be used to integrate a set of existing applications and COTS.
{"title":"Integrating through user interface: a flexible integration framework for third-party software","authors":"Yimin Bao, E. Horowitz","doi":"10.1109/CMPSAC.1996.544587","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544587","url":null,"abstract":"The current trend of constructing new systems from collections of pre-existing third-party software and commercial off-the-shelf (COTS) products presents serious challenges to existing integration technology. We present a flexible integration framework which has general applicability for pre-existing third-party and COTS software (often highly interactive, with graphical user interface, and without source code access), supports users by allowing them to easily change the way software interacts (thus supporting system evolution and component reusability), and is easily programmable by end-users. Specifically we describe the Tool Integration Language (TIL) and the Tool Integration Server System (TISS) which provide flexible integration mechanisms for our framework and show how they can be used to integrate a set of existing applications and COTS.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125702764","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542426
Yen-Jen Lee, D. Du, Wei-hsiu Ma
The advances in storage, host I/O, and networks entice a variety of on-demand services. To effectively use these resources, we propose a Scalable and Extensible Architecture for Multimedia Entertainment (SESAME) to explore the modularity and scalability of a Karaoke-on-demand (KOD) service. Karaoke popularizes MTV-style entertainment to let viewers sing along. It is shown that hierarchical architecture for KOD scales well and is cost-effective in the network environment where latency is not a major concern. The modularity and scalability are achieved by: 1) distributing Karaoke data at different levels of storage based on popularity to leverage the cost of near-line and on-line storages, and alleviate hot spot access for popular titles, 2) modularizing the server design as well as service hierarchy, and 3) reducing the concurrent accesses to a server by expanding service levels such that an inexpensive computer can be a server. We illustrate live applications in a Karaoke house and in a campus-wide setting. The SESAME approach is being extended to some other areas of interests such as distance learning.
{"title":"SESAME: a Scalable and ExtenSible Architecture for Multimedia Entertainment","authors":"Yen-Jen Lee, D. Du, Wei-hsiu Ma","doi":"10.1109/CMPSAC.1996.542426","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542426","url":null,"abstract":"The advances in storage, host I/O, and networks entice a variety of on-demand services. To effectively use these resources, we propose a Scalable and Extensible Architecture for Multimedia Entertainment (SESAME) to explore the modularity and scalability of a Karaoke-on-demand (KOD) service. Karaoke popularizes MTV-style entertainment to let viewers sing along. It is shown that hierarchical architecture for KOD scales well and is cost-effective in the network environment where latency is not a major concern. The modularity and scalability are achieved by: 1) distributing Karaoke data at different levels of storage based on popularity to leverage the cost of near-line and on-line storages, and alleviate hot spot access for popular titles, 2) modularizing the server design as well as service hierarchy, and 3) reducing the concurrent accesses to a server by expanding service levels such that an inexpensive computer can be a server. We illustrate live applications in a Karaoke house and in a campus-wide setting. The SESAME approach is being extended to some other areas of interests such as distance learning.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115977935","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544150
C. Perkins
Mobile clients have unusual needs for sending and receiving multimedia data. The traditional client/server paradigm does not take into account variable network conditions; thus traditional client/server applications have no capability of responding to intermittent connectivity, changing cost structures, or the kind of fluctuations in available bandwidth which are characteristic of wireless links. Two approaches towards allowing such adaptations are presented for comparison: proxies and modifications to client and server.
{"title":"Handling multimedia data for mobile computers","authors":"C. Perkins","doi":"10.1109/CMPSAC.1996.544150","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544150","url":null,"abstract":"Mobile clients have unusual needs for sending and receiving multimedia data. The traditional client/server paradigm does not take into account variable network conditions; thus traditional client/server applications have no capability of responding to intermittent connectivity, changing cost structures, or the kind of fluctuations in available bandwidth which are characteristic of wireless links. Two approaches towards allowing such adaptations are presented for comparison: proxies and modifications to client and server.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130465693","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.545883
F. Andrès, Keigo Ihara, J. Boulos, K. Ono, Y. Yasuda
The paper discusses how the OLVP system, an innovative video-on-demand system, can be used to efficiently support video delivery applications over an asynchronous transfer mode (ATM) network. We show how the OLVP system provided a high quality of service (QoS) to video applications executing over a set of distributed and heterogeneous system resources. System architecture is described. Key functionality, including distributed video storage management, real-time admission control strategy and resource allocation routing mechanism, traffic management and routing algorithms (both in the ATM network and in the OLVP system) are investigated. To illustrate the success of our approach, we provide a performance evaluation based on simulations of the system.
{"title":"Performance evaluation of the OLVP (online video processing) system","authors":"F. Andrès, Keigo Ihara, J. Boulos, K. Ono, Y. Yasuda","doi":"10.1109/CMPSAC.1996.545883","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.545883","url":null,"abstract":"The paper discusses how the OLVP system, an innovative video-on-demand system, can be used to efficiently support video delivery applications over an asynchronous transfer mode (ATM) network. We show how the OLVP system provided a high quality of service (QoS) to video applications executing over a set of distributed and heterogeneous system resources. System architecture is described. Key functionality, including distributed video storage management, real-time admission control strategy and resource allocation routing mechanism, traffic management and routing algorithms (both in the ATM network and in the OLVP system) are investigated. To illustrate the success of our approach, we provide a performance evaluation based on simulations of the system.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899427","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544593
Daniel J. Callen, S. Urban
This research extends an existing framework for translating global queries over a heterogeneous network of databases, focusing on the consolidation of query results and the resolution of semantic differences between component databases and the global schema. The research uses an object-oriented database for the global platform and a self-describing global schema as a means for providing access to database information. During query consolidation, query results are read into object classes along with the metadata needed to resolve the semantic differences. Through encapsulated procedures, query results are transformed and merged into the global format. This research identifies the information needed in the global schema for resolution of semantic heterogeneity during consolidation of query results.
{"title":"Consolidation of query results in a multidatabase environment: an object-oriented approach","authors":"Daniel J. Callen, S. Urban","doi":"10.1109/CMPSAC.1996.544593","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544593","url":null,"abstract":"This research extends an existing framework for translating global queries over a heterogeneous network of databases, focusing on the consolidation of query results and the resolution of semantic differences between component databases and the global schema. The research uses an object-oriented database for the global platform and a self-describing global schema as a means for providing access to database information. During query consolidation, query results are read into object classes along with the metadata needed to resolve the semantic differences. Through encapsulated procedures, query results are transformed and merged into the global format. This research identifies the information needed in the global schema for resolution of semantic heterogeneity during consolidation of query results.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598796","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
扫码关注我们
求助内容：
应助结果提醒方式：