Pub Date : 1999-06-07DOI: 10.1109/MMCS.1999.778459
J. Bruno, J. Brustoloni, E. Gabber, Banu Özden, A. Silberschatz
The paper introduces YFQ, a new disk scheduling algorithm that allows applications to set aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the Eclipse/BSD operating system, which is derived from FreeBSD, a version of 4.4 BSD Unix. YFQ's disk bandwidth reservations can guarantee file accesses with high throughput, low delay, and good fairness. Such quality of service (QoS) guarantees to individual applications unfortunately can also hinder global disk scheduling optimizations. We propose and evaluate several disk scheduling enhancements that promote global optimizations and give to YFQ aggregate disk throughput approaching that of FreeBSD's conventional disk scheduler, which does not provide QoS guarantees. We believe that our enhancements may be helpful also in other disk scheduling algorithms.
{"title":"Disk scheduling with quality of service guarantees","authors":"J. Bruno, J. Brustoloni, E. Gabber, Banu Özden, A. Silberschatz","doi":"10.1109/MMCS.1999.778459","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778459","url":null,"abstract":"The paper introduces YFQ, a new disk scheduling algorithm that allows applications to set aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the Eclipse/BSD operating system, which is derived from FreeBSD, a version of 4.4 BSD Unix. YFQ's disk bandwidth reservations can guarantee file accesses with high throughput, low delay, and good fairness. Such quality of service (QoS) guarantees to individual applications unfortunately can also hinder global disk scheduling optimizations. We propose and evaluate several disk scheduling enhancements that promote global optimizations and give to YFQ aggregate disk throughput approaching that of FreeBSD's conventional disk scheduler, which does not provide QoS guarantees. We believe that our enhancements may be helpful also in other disk scheduling algorithms.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116290169","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 : 1999-06-07DOI: 10.1109/MMCS.1999.779219
R. Simon
Deadline-driven packet scheduling policies provide highly flexible methods for real-time communication support of distributed multimedia applications. This paper presents a probabilistic approach for analyzing admission control and communication establishment for the general class of non-preemptive deadline-oriented packet scheduling policies. The prediction method can be used for communication and scheduling policy evaluation, routing for multimedia traffic and capacity planning. A large-scale simulation study demonstrates that our method provides highly accurate predictions of acceptance rates for multiple types of multimedia connection requests.
{"title":"Predictable path establishment in multimedia communication networks","authors":"R. Simon","doi":"10.1109/MMCS.1999.779219","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779219","url":null,"abstract":"Deadline-driven packet scheduling policies provide highly flexible methods for real-time communication support of distributed multimedia applications. This paper presents a probabilistic approach for analyzing admission control and communication establishment for the general class of non-preemptive deadline-oriented packet scheduling policies. The prediction method can be used for communication and scheduling policy evaluation, routing for multimedia traffic and capacity planning. A large-scale simulation study demonstrates that our method provides highly accurate predictions of acceptance rates for multiple types of multimedia connection requests.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117078719","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778551
T. Shih
The ecosystem is an evolutionary result of natural laws. Food Web (or Food Chain) embeds a set of computation rules of natural balance. Based one the concepts of Food Web, one of the laws that we may learn from the natural besides neural networks and genetic algorithms, we propose a theoretical computation model for mobile agent evolution on the Internet. We define an agent niche overlap graph and agent evolution states. We also propose a set of algorithms, which is used in our multimedia search programs, to simulate agent evolution. Agents are cloned to live on a remote host station based on three different strategies: the brute force strategy, the semi-brute force strategy, and the selective strategy. Evaluations of different strategies are discussed. Guidelines of writing mobile agent programs are proposed. The technique can be used in distributed information retrieval which allows the computation load to be added to servers, but significantly reduces the traffic of network communication.
{"title":"Using Food Web as an evolution computing model for Internet-based multimedia agents","authors":"T. Shih","doi":"10.1109/MMCS.1999.778551","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778551","url":null,"abstract":"The ecosystem is an evolutionary result of natural laws. Food Web (or Food Chain) embeds a set of computation rules of natural balance. Based one the concepts of Food Web, one of the laws that we may learn from the natural besides neural networks and genetic algorithms, we propose a theoretical computation model for mobile agent evolution on the Internet. We define an agent niche overlap graph and agent evolution states. We also propose a set of algorithms, which is used in our multimedia search programs, to simulate agent evolution. Agents are cloned to live on a remote host station based on three different strategies: the brute force strategy, the semi-brute force strategy, and the selective strategy. Evaluations of different strategies are discussed. Guidelines of writing mobile agent programs are proposed. The technique can be used in distributed information retrieval which allows the computation load to be added to servers, but significantly reduces the traffic of network communication.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115031732","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778674
A. Pasquarelli, F. D. Stefani, Gregory M. P. O'Hare, Aidan Murphy
The paper presents the ECHOES' (EduCational Hypermedia On-linE System) training environment, its architecture and the services offered to the users. The main objective of the ECHOES project is to build a distributed dynamic environment for educating and supporting technicians in using and repairing complex industrial artefacts. To pursue this objective, computer Web based training, virtual reality and multi agent systems are integrated and synthesised in the ECHOES environment. These technologies are used to aid users at different levels of complexity, starting from the novice, who wants to quickly develop a global functional view of complex systems, up to the technician, who needs a strong conceptual understanding of complex equipment. The user interaction with the system is agent based and the chosen interface is that of the visit metaphor within a 2D or 3D environment, in order to leave the trainee or the technician free in exploring the environment.
{"title":"ECHOES: educational hypermedia on-line system","authors":"A. Pasquarelli, F. D. Stefani, Gregory M. P. O'Hare, Aidan Murphy","doi":"10.1109/MMCS.1999.778674","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778674","url":null,"abstract":"The paper presents the ECHOES' (EduCational Hypermedia On-linE System) training environment, its architecture and the services offered to the users. The main objective of the ECHOES project is to build a distributed dynamic environment for educating and supporting technicians in using and repairing complex industrial artefacts. To pursue this objective, computer Web based training, virtual reality and multi agent systems are integrated and synthesised in the ECHOES environment. These technologies are used to aid users at different levels of complexity, starting from the novice, who wants to quickly develop a global functional view of complex systems, up to the technician, who needs a strong conceptual understanding of complex equipment. The user interaction with the system is agent based and the chosen interface is that of the visit metaphor within a 2D or 3D environment, in order to leave the trainee or the technician free in exploring the environment.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114902594","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778598
I. Cruz, Parag S. Mahalley
Designing high quality multimedia presentations is a tedious and time consuming task, even for skilled authors. This is particularly true when temporal media such as speech and animation are involved. The focus of our research is to determine whether the multimedia presentation is synchronized or amenable to synchronization. We define a formal framework for verifying temporal synchronization of a presentation, which is based on a modified all-pairs shortest path algorithm.
{"title":"Temporal synchronization in multimedia presentations","authors":"I. Cruz, Parag S. Mahalley","doi":"10.1109/MMCS.1999.778598","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778598","url":null,"abstract":"Designing high quality multimedia presentations is a tedious and time consuming task, even for skilled authors. This is particularly true when temporal media such as speech and animation are involved. The focus of our research is to determine whether the multimedia presentation is synchronized or amenable to synchronization. We define a formal framework for verifying temporal synchronization of a presentation, which is based on a modified all-pairs shortest path algorithm.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115242423","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778130
K. Law, H. Ip, Fang Wei
We propose a layered model for hypermedia document systems and use this model in the design and implementation of a prototype hypermedia document system. The model consists of three layers: a runtime layer (RTL) a document description layer (DOCDL) and a storage layer (SRL). The DOCDL contributes to defining the logical structure. It not only constrains the structure of the SRL, but also forms a bridge between the RTL and the SRL. In the DOCDL, an extended open document architecture (ODA) is employed for describing the logical structure of the document. In addition, we present a technique for automatically generating and updating database schema given a document logical structure. For the RTL, the document logical structure is visualized to help users to retrieve information, and as a means for multimedia data capture. The advantages and benefits of this approach are to allow the design and implementation of hypermedia systems to be automated and much simplified. The approach also caters for the continuous updating of the document logical structure such as adding an extra data object. The paper applies the proposed model to the design and implementation of a multimedia document system for medical documents.
{"title":"An abstract layered model for hypermedia document system","authors":"K. Law, H. Ip, Fang Wei","doi":"10.1109/MMCS.1999.778130","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778130","url":null,"abstract":"We propose a layered model for hypermedia document systems and use this model in the design and implementation of a prototype hypermedia document system. The model consists of three layers: a runtime layer (RTL) a document description layer (DOCDL) and a storage layer (SRL). The DOCDL contributes to defining the logical structure. It not only constrains the structure of the SRL, but also forms a bridge between the RTL and the SRL. In the DOCDL, an extended open document architecture (ODA) is employed for describing the logical structure of the document. In addition, we present a technique for automatically generating and updating database schema given a document logical structure. For the RTL, the document logical structure is visualized to help users to retrieve information, and as a means for multimedia data capture. The advantages and benefits of this approach are to allow the design and implementation of hypermedia systems to be automated and much simplified. The approach also caters for the continuous updating of the document logical structure such as adding an extra data object. The paper applies the proposed model to the design and implementation of a multimedia document system for medical documents.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125016533","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778377
P. Bosch, S. Mullender, P. Jansen
This paper presents Clockwise, a mixed-media file system. The primary goal of Clockwise is to provide a storage architecture that supports the storage and retrieval of best-effort and real-time file system data. Clockwise provides an abstraction called a dynamic partition that groups lists of related (large) blocks on one or more disks. Dynamic partitions can grow and shrink in size and reading or writing of dynamic partitions can be scheduled explicitly. With respect to scheduling, Clockwise uses a novel strategy to pre-calculate schedule slack time and it schedules best-effort requests before queued real-time requests in this slack time.
{"title":"Clockwise: a mixed-media file system","authors":"P. Bosch, S. Mullender, P. Jansen","doi":"10.1109/MMCS.1999.778377","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778377","url":null,"abstract":"This paper presents Clockwise, a mixed-media file system. The primary goal of Clockwise is to provide a storage architecture that supports the storage and retrieval of best-effort and real-time file system data. Clockwise provides an abstraction called a dynamic partition that groups lists of related (large) blocks on one or more disks. Dynamic partitions can grow and shrink in size and reading or writing of dynamic partitions can be scheduled explicitly. With respect to scheduling, Clockwise uses a novel strategy to pre-calculate schedule slack time and it schedules best-effort requests before queued real-time requests in this slack time.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363739","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778666
A. Tirakis, Panagiotis Katalagarianos, M. Papathomas, Christodoulos Hamilakis
The ESPRIT project DiVAN (EP 24956) aims at the building of a distributed audio-visual library system for TV broadcasters and video archives owners. The DiVAN system provides facilities to effectively, digitize, annotate, organize, store and access raw material in a coherent content-based manner, on top of high-speed wide area communication networks. Also, the project aims to demonstrate and assess the applicability and acceptability of the proposed system, through field trials on a DiVAN-based infrastructure interconnecting the archives of the users of the partnership, i.e. INA, RAI, and ERT. The consortium consists of industrial partners (i.e. INTRACOM, TECMATH), research institutes (i.e. ICS-FORTH, INRIA, Tech. Un. of Darmstadt) and users (i.e. Institut National de l'Audiovisuel-INA, Radiotelevisione Italiana-RAI and Greek National Broadcaster-ERT).
{"title":"Distributed audio-visual archives network (DiVAN)","authors":"A. Tirakis, Panagiotis Katalagarianos, M. Papathomas, Christodoulos Hamilakis","doi":"10.1109/MMCS.1999.778666","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778666","url":null,"abstract":"The ESPRIT project DiVAN (EP 24956) aims at the building of a distributed audio-visual library system for TV broadcasters and video archives owners. The DiVAN system provides facilities to effectively, digitize, annotate, organize, store and access raw material in a coherent content-based manner, on top of high-speed wide area communication networks. Also, the project aims to demonstrate and assess the applicability and acceptability of the proposed system, through field trials on a DiVAN-based infrastructure interconnecting the archives of the users of the partnership, i.e. INA, RAI, and ERT. The consortium consists of industrial partners (i.e. INTRACOM, TECMATH), research institutes (i.e. ICS-FORTH, INRIA, Tech. Un. of Darmstadt) and users (i.e. Institut National de l'Audiovisuel-INA, Radiotelevisione Italiana-RAI and Greek National Broadcaster-ERT).","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125175500","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 : 1999-06-07DOI: 10.1109/MMCS.1999.779245
F. Pachet, Pierre Roy, Daniel Cazaly
Advances in networking and transmission of digital multimedia data will soon bring huge catalogues of music to users. Accessing these catalogues raises a problem for users and content providers, that we define as the music selection problem. We introduce three main goals to be satisfied in music selection: match user preferences, provide users with new music, and exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose constraint satisfaction techniques to solve it. The resulting system is an enabling technology to build better music delivery services.
{"title":"A combinatorial approach to content-based music selection","authors":"F. Pachet, Pierre Roy, Daniel Cazaly","doi":"10.1109/MMCS.1999.779245","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779245","url":null,"abstract":"Advances in networking and transmission of digital multimedia data will soon bring huge catalogues of music to users. Accessing these catalogues raises a problem for users and content providers, that we define as the music selection problem. We introduce three main goals to be satisfied in music selection: match user preferences, provide users with new music, and exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose constraint satisfaction techniques to solve it. The resulting system is an enabling technology to build better music delivery services.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123602649","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778564
M. Akhloufi, V. Polotski, P. Cohen
This paper presents a new approach to the synthesis of a novel view from two images captured by a non-calibrated stereo system. Here view synthesis employs epipolar constraints associated with a two camera configuration. A fundamental matrix is used to obtain features in the synthesized view via reprojection of corresponding features in the source images. Unlike classical methods which are based on inferring three dimensional structure of the scene or use dense correspondence between the source images to produce the new synthesized image, this method requires only sparse correspondence between source image features. Perspective image warping techniques then render the remaining image points via interpolation. The approach permits interactive view synthesis in: immersive telepresence systems, realistic virtual worlds and overlay of objects at different positions on live video of dynamic scenes for augmented reality display systems. Method efficiency is illustrated with examples of synthetic and real scenes.
{"title":"Virtual view synthesis from uncalibrated stereo cameras","authors":"M. Akhloufi, V. Polotski, P. Cohen","doi":"10.1109/MMCS.1999.778564","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778564","url":null,"abstract":"This paper presents a new approach to the synthesis of a novel view from two images captured by a non-calibrated stereo system. Here view synthesis employs epipolar constraints associated with a two camera configuration. A fundamental matrix is used to obtain features in the synthesized view via reprojection of corresponding features in the source images. Unlike classical methods which are based on inferring three dimensional structure of the scene or use dense correspondence between the source images to produce the new synthesized image, this method requires only sparse correspondence between source image features. Perspective image warping techniques then render the remaining image points via interpolation. The approach permits interactive view synthesis in: immersive telepresence systems, realistic virtual worlds and overlay of objects at different positions on live video of dynamic scenes for augmented reality display systems. Method efficiency is illustrated with examples of synthetic and real scenes.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128149453","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
扫码关注我们
求助内容：
应助结果提醒方式：