Pub Date : 2009-08-26DOI: 10.2174/1874133900903020123
Benoît Encelle, Nadine Baptiste-Jessel, J. Mothe, Bachelin Ralalason
Thanks to the WAI (Web Accessibility Initiative) guidelines for producing accessible HTML documents, visually impaired people can have better access to a lot of textual information. Concerning musical score, several encoding formats are available, focusing on the representation of different aspects of this kind of content. As XML is the standard for exchanging content through the Web, several XML applications have already been specified for representing musical scores, using the traditional music notation. As a result, users can access and share a lot of different types of musical content using the Web. However, for specific notations – like the Braille one - no dedicated XML application has been developed yet. Therefore, visually impaired musicians cannot easily represent, share, and access scores using the Web. This paper presents the application we have developed to respond to this need: BMML (Braille Music Markup Language). BMML handles specificities of Braille Music notation and takes into account the core features of existing formats. The main objective of BMML is to improve the accessibility of Braille musical scores.
{"title":"BMML: Braille Music Markup Language","authors":"Benoît Encelle, Nadine Baptiste-Jessel, J. Mothe, Bachelin Ralalason","doi":"10.2174/1874133900903020123","DOIUrl":"https://doi.org/10.2174/1874133900903020123","url":null,"abstract":"Thanks to the WAI (Web Accessibility Initiative) guidelines for producing accessible HTML documents, visually impaired people can have better access to a lot of textual information. Concerning musical score, several encoding formats are available, focusing on the representation of different aspects of this kind of content. As XML is the standard for exchanging content through the Web, several XML applications have already been specified for representing musical scores, using the traditional music notation. As a result, users can access and share a lot of different types of musical content using the Web. However, for specific notations – like the Braille one - no dedicated XML application has been developed yet. Therefore, visually impaired musicians cannot easily represent, share, and access scores using the Web. This paper presents the application we have developed to respond to this need: BMML (Braille Music Markup Language). BMML handles specificities of Braille Music notation and takes into account the core features of existing formats. The main objective of BMML is to improve the accessibility of Braille musical scores.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132539711","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 : 2009-02-26DOI: 10.2174/1874947X00902010018
Gehao Lu, Joan Lu, Shaowen Yao, Y. J. Yip
Trust plays important roles on effective interaction and cooperation for multi-agent systems(MAS). This study aims at finding out the current situation and future trends of computational trustfor multi-agent systems. Through defining seven common compositional elements for the computational trust models, the study points out significant weaknesses in the current design. Finally, the paper figures out the future research trends through discussion and analysis around the strengths and weaknesses identified. Also the paper proposes an idea of using ontology and XML technologies such as RDF that allow systems to provide both human and machine readable annotations for trust models.
{"title":"A Review on Computational Trust Models for Multi-agent Systems","authors":"Gehao Lu, Joan Lu, Shaowen Yao, Y. J. Yip","doi":"10.2174/1874947X00902010018","DOIUrl":"https://doi.org/10.2174/1874947X00902010018","url":null,"abstract":"Trust plays important roles on effective interaction and cooperation for multi-agent systems(MAS). This study aims at finding out the current situation and future trends of computational trustfor multi-agent systems. Through defining seven common compositional elements for the computational trust models, the study points out significant weaknesses in the current design. Finally, the paper figures out the future research trends through discussion and analysis around the strengths and weaknesses identified. Also the paper proposes an idea of using ontology and XML technologies such as RDF that allow systems to provide both human and machine readable annotations for trust models.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402773","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 : 2009-02-26DOI: 10.2174/1874947X00902020002
F. Mandreoli, R. Martoglia, E. Ronchetti
XML databases, providing structural querying support, are becoming more and more popular. As we know, XML data may change over time and providing an efficient support to queries which also involve temporal aspects is still an open issue. In this paper we present our native Temporal XML Query Processor, which exploits an ad-hoc temporal in- dexing scheme relying on relational approaches and a technology supporting temporal slicing. As we show through an ex- tensive experimental evaluation, our solution achieves good efficiency results, outperforming stratum-based solutions when dealing with time-related application requirements while continuing to guarantee good performance in traditional scenarios.
{"title":"Native Temporal Slicing Support for XML Databases","authors":"F. Mandreoli, R. Martoglia, E. Ronchetti","doi":"10.2174/1874947X00902020002","DOIUrl":"https://doi.org/10.2174/1874947X00902020002","url":null,"abstract":"XML databases, providing structural querying support, are becoming more and more popular. As we know, XML data may change over time and providing an efficient support to queries which also involve temporal aspects is still an open issue. In this paper we present our native Temporal XML Query Processor, which exploits an ad-hoc temporal in- dexing scheme relying on relational approaches and a technology supporting temporal slicing. As we show through an ex- tensive experimental evaluation, our solution achieves good efficiency results, outperforming stratum-based solutions when dealing with time-related application requirements while continuing to guarantee good performance in traditional scenarios.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122631921","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 : 2008-07-15DOI: 10.2174/1874133900903020136
Gehao Lu, Joan Lu, Y. J. Yip
A device for preventing a motor from being locked comprises a position indicator for indicating a position to be moved in response to rotation of the motor, a position detector for detecting the position being moved in response to rotation of the motor, a servo control unit for supplying a current to the motor so that an output signal from the position detector will be equalized with an indication by the position indicator, a stop detector for detecting stoppage of the motor in response to a differential of the output signal from the position detector, and a cutoff control unit for cutting off the current supplied from the servo control unit to the motor in response to an output signal from the stop detector.
{"title":"Mobile Agent based Data Fusion for Wireless Sensor Networks with a XML Framework","authors":"Gehao Lu, Joan Lu, Y. J. Yip","doi":"10.2174/1874133900903020136","DOIUrl":"https://doi.org/10.2174/1874133900903020136","url":null,"abstract":"A device for preventing a motor from being locked comprises a position indicator for indicating a position to be moved in response to rotation of the motor, a position detector for detecting the position being moved in response to rotation of the motor, a servo control unit for supplying a current to the motor so that an output signal from the position detector will be equalized with an indication by the position indicator, a stop detector for detecting stoppage of the motor in response to a differential of the output signal from the position detector, and a cutoff control unit for cutting off the current supplied from the servo control unit to the motor in response to an output signal from the stop detector.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591852","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 : 2002-03-01DOI: 10.3745/KIPSTA.2002.9A.1.029
Jaewoo Jeon, S. Oh
For the efficient collaboration awareness, the CSCW (Computer-Supported Cooperative Work) systems provide functions such as telepointing, snap-shot, and document/project tracking. Among these, telepointing allows an event occurrence on the shared window of a local computing system to be presented in remote computing systems. Although telepointing has been mentioned in the literature, few research papers deal with the functional requirements and protocols for telepointing. This parer describes the functional requirements and payload format for RTP (Real-Time Transport Protocol)-based telepointing. In order to evaluate the performance of the proposed RTP-barred telepointing, we have implemented a whiteboard and compared it with that of the Microsoft Netmeeting. The evaluation results show that the proposed telepointing performs better in terms of CPU usage and the amount of network traffic.
{"title":"The RTP Payload Format for Telepointing","authors":"Jaewoo Jeon, S. Oh","doi":"10.3745/KIPSTA.2002.9A.1.029","DOIUrl":"https://doi.org/10.3745/KIPSTA.2002.9A.1.029","url":null,"abstract":"For the efficient collaboration awareness, the CSCW (Computer-Supported Cooperative Work) systems provide functions such as telepointing, snap-shot, and document/project tracking. Among these, telepointing allows an event occurrence on the shared window of a local computing system to be presented in remote computing systems. Although telepointing has been mentioned in the literature, few research papers deal with the functional requirements and protocols for telepointing. This parer describes the functional requirements and payload format for RTP (Real-Time Transport Protocol)-based telepointing. In order to evaluate the performance of the proposed RTP-barred telepointing, we have implemented a whiteboard and compared it with that of the Microsoft Netmeeting. The evaluation results show that the proposed telepointing performs better in terms of CPU usage and the amount of network traffic.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069972","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 : 1900-01-01DOI: 10.4018/978-1-59904-855-0.CH017
L. Liao, Jörg Schwenk
This chapter deals with the issues concerning e-mail communication security. We analyze the most popular security mechanisms and standards related to the e-mail communication and identify potential threats and vulnerabilities. The most significant drawback of all current approaches is the impossibility of keeping headers information authentic. This leads to possible impersonation attacks and profiling of the e-mail communication, and encourages spam and phishing activities. Furthermore, none of the currently available security mechanisms supports partial signature generation of the e-mail content by distinct signers, which might be useful in commercial scenarios. To handle these problems, we suggest a new approach, called XMaiL, which can be considered as an advanced email security mechanism based on the popular XML technologies. The proposed XMaiL supersedes all currently available e-mail security standards in the sense of the higher flexibility and security.
{"title":"Securing Email Communication with XML Technology","authors":"L. Liao, Jörg Schwenk","doi":"10.4018/978-1-59904-855-0.CH017","DOIUrl":"https://doi.org/10.4018/978-1-59904-855-0.CH017","url":null,"abstract":"This chapter deals with the issues concerning e-mail communication security. We analyze the most popular security mechanisms and standards related to the e-mail communication and identify potential threats and vulnerabilities. The most significant drawback of all current approaches is the impossibility of keeping headers information authentic. This leads to possible impersonation attacks and profiling of the e-mail communication, and encourages spam and phishing activities. Furthermore, none of the currently available security mechanisms supports partial signature generation of the e-mail content by distinct signers, which might be useful in commercial scenarios. To handle these problems, we suggest a new approach, called XMaiL, which can be considered as an advanced email security mechanism based on the popular XML technologies. The proposed XMaiL supersedes all currently available e-mail security standards in the sense of the higher flexibility and security.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114380129","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 : 1900-01-01DOI: 10.4018/978-1-59140-414-9.CH017
Juan Manuel Hernansaez, J. A. Blaya, A. Gómez-Skarmeta
{"title":"A J2EE Technology Based Distributed Software Architecture for Web Usage Mining","authors":"Juan Manuel Hernansaez, J. A. Blaya, A. Gómez-Skarmeta","doi":"10.4018/978-1-59140-414-9.CH017","DOIUrl":"https://doi.org/10.4018/978-1-59140-414-9.CH017","url":null,"abstract":"","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125301171","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 : 1900-01-01DOI: 10.3745/kipstc.2003.10c.5.541
Yong Ju Yis, Sang-Choon Kim, Sang-Ho Lee
A fair exchange protocol enable two parties to exchange secrets with fairness, so that neither can gain any information advantage by quitting prematurely or otherwise misbehaving. Therefore a fair exchange is the most important for electronic transactions between untrusted parties. To design new fair exchange, after describing basic concepts, definitions and existing protocols and designing a non-interactive OT protocol using ELGamal`s public key system, I will design new protocol to support fair exchange. In my designed new protocol, untrusted parties exchange secrets obliviously and verify that their received secrets are true by using transformed Zero Knowledge Interactive Proof extended to duplex. At this time, concerned two parties can`t decrypt the other`s ciphertext. .After all of the steps, two parties can do it. It is the most important to provide perfect fairness and anonymity to untrusted parties in this protocol.
{"title":"How To Exchange Secrets By OT","authors":"Yong Ju Yis, Sang-Choon Kim, Sang-Ho Lee","doi":"10.3745/kipstc.2003.10c.5.541","DOIUrl":"https://doi.org/10.3745/kipstc.2003.10c.5.541","url":null,"abstract":"A fair exchange protocol enable two parties to exchange secrets with fairness, so that neither can gain any information advantage by quitting prematurely or otherwise misbehaving. Therefore a fair exchange is the most important for electronic transactions between untrusted parties. To design new fair exchange, after describing basic concepts, definitions and existing protocols and designing a non-interactive OT protocol using ELGamal`s public key system, I will design new protocol to support fair exchange. In my designed new protocol, untrusted parties exchange secrets obliviously and verify that their received secrets are true by using transformed Zero Knowledge Interactive Proof extended to duplex. At this time, concerned two parties can`t decrypt the other`s ciphertext. .After all of the steps, two parties can do it. It is the most important to provide perfect fairness and anonymity to untrusted parties in this protocol.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123188085","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}
To insure the confidentiality of data, it can be encrypted before it is transmitted. However, most data today is unencrypted. As a result, encrypted data might attract unwanted attention, simply due to the fact that it is encrypted. To avoid such attention, we propose a method of converting ciphertext into data that can pass certain automated tests for English text. Our goal is to foil automated detection methods, and we want to expand the encrypted data as little as possible in the process. Our technique can be considered as a form of steganography.
{"title":"Stealthy Ciphertext","authors":"M. Simova, M. Stamp, C. Pollett","doi":"10.31979/etd.bmj6-cqmb","DOIUrl":"https://doi.org/10.31979/etd.bmj6-cqmb","url":null,"abstract":"To insure the confidentiality of data, it can be encrypted before it is transmitted. However, most data today is unencrypted. As a result, encrypted data might attract unwanted attention, simply due to the fact that it is encrypted. To avoid such attention, we propose a method of converting ciphertext into data that can pass certain automated tests for English text. Our goal is to foil automated detection methods, and we want to expand the encrypted data as little as possible in the process. Our technique can be considered as a form of steganography.","PeriodicalId":126578,"journal":{"name":"International Conference on Internet Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130594580","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
扫码关注我们
求助内容：
应助结果提醒方式：