Juan Gabriel González Serna, V. Sosa, Azucena Montes Rendón, Juan C. Olivares-Rojas, J. Rojas
The objective of this work is to allow users of mobile devices to visualize Web sites without mattering if Web sites were designed or not specifically for these types of devices; in that way, it is necessary to adapt Web contents to the limitations of each mobile device. In this paper, Web content transcoding mechanism "on-the-flight" is presented. This mechanism works by means of a simple inclusion of a HTTP header named X-Transform, which describes a transcoding format command. This header is generated by a client-side proxy named GAP, which runs on mobile devices with Windows CE operating system (Pocket PC, Smartphone, among others). The transcoding header is interpreted by a server-side proxy named GAT MT, that converts Web documents to WML, XHTML-MP, PDF, plain text, PostScript, XML and HTML adapted for mobile devices, making use of XSL technologies (XSLT and XSL-FO)
{"title":"Multi-Format Web Content Transcoding for Mobile Devices","authors":"Juan Gabriel González Serna, V. Sosa, Azucena Montes Rendón, Juan C. Olivares-Rojas, J. Rojas","doi":"10.1109/ENC.2006.21","DOIUrl":"https://doi.org/10.1109/ENC.2006.21","url":null,"abstract":"The objective of this work is to allow users of mobile devices to visualize Web sites without mattering if Web sites were designed or not specifically for these types of devices; in that way, it is necessary to adapt Web contents to the limitations of each mobile device. In this paper, Web content transcoding mechanism \"on-the-flight\" is presented. This mechanism works by means of a simple inclusion of a HTTP header named X-Transform, which describes a transcoding format command. This header is generated by a client-side proxy named GAP, which runs on mobile devices with Windows CE operating system (Pocket PC, Smartphone, among others). The transcoding header is interpreted by a server-side proxy named GAT MT, that converts Web documents to WML, XHTML-MP, PDF, plain text, PostScript, XML and HTML adapted for mobile devices, making use of XSL technologies (XSLT and XSL-FO)","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"97 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801138","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}
Modern database systems integrate diverse technology to implement data security. One important aspect of the security scheme is about using encryption to protect sensitive information while it remains stored in the database. We first review in this paper the general aspects of data security and analyze how the leading commercial databases address these issues. Then we discuss about applying encryption as a justified measure of increasing the data privacy and we identify a weak support from commercial database systems when a group of users owns encrypted data. Finally, we propose an enhanced mechanism, called secure groups, that intends to improve the management of encryption at a database level
{"title":"Secure Groups: Enhanced Management of Encrypted Data in Databases","authors":"J. S. González-Campos","doi":"10.1109/ENC.2006.27","DOIUrl":"https://doi.org/10.1109/ENC.2006.27","url":null,"abstract":"Modern database systems integrate diverse technology to implement data security. One important aspect of the security scheme is about using encryption to protect sensitive information while it remains stored in the database. We first review in this paper the general aspects of data security and analyze how the leading commercial databases address these issues. Then we discuss about applying encryption as a justified measure of increasing the data privacy and we identify a weak support from commercial database systems when a group of users owns encrypted data. Finally, we propose an enhanced mechanism, called secure groups, that intends to improve the management of encryption at a database level","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133874389","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}
An iterative equidistribution algorithm is proposed for solving a two-dimensional phase field model, using the finite element method. The phase field equation is used to model a two-phase fluid inside a tube, where the boundary conditions at the walls define the static contact angle. The numerical solution is found by the finite element method with triangular elements, using a structured mesh generated with Delaunay triangulation. First, the adaptive grid algorithm is carefully tested in an analytic function where numerical results demonstrate the accuracy and effectiveness in the adaptive grid generation. Finally, we present numerical results for the phase field model
{"title":"Equidistribution algorithm for a two-dimensional phase field model","authors":"J. J. T. Armenta, G. Mariscal","doi":"10.1109/ENC.2006.13","DOIUrl":"https://doi.org/10.1109/ENC.2006.13","url":null,"abstract":"An iterative equidistribution algorithm is proposed for solving a two-dimensional phase field model, using the finite element method. The phase field equation is used to model a two-phase fluid inside a tube, where the boundary conditions at the walls define the static contact angle. The numerical solution is found by the finite element method with triangular elements, using a structured mesh generated with Delaunay triangulation. First, the adaptive grid algorithm is carefully tested in an analytic function where numerical results demonstrate the accuracy and effectiveness in the adaptive grid generation. Finally, we present numerical results for the phase field model","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124340761","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}
J. Nieves, U. Cortés, Mauricio Osorio, Iván Olmos, Jesus A. Gonzalez
Dung's argumentation approach is a unifying approach which has played an influential role on argumentation research and artificial intelligence (AT). Based on a proper representation of Dung's argumentation approach and minimal models, we introduce a novel argumentation semantics called preferred+ semantics which follows the preferred semantics' philosophy. Also, we show how to infer preferred+ semantics using a software tool called SI-COBRA that was introduced recently
{"title":"Defining new argumentation-based semantics by minimal models","authors":"J. Nieves, U. Cortés, Mauricio Osorio, Iván Olmos, Jesus A. Gonzalez","doi":"10.1109/ENC.2006.10","DOIUrl":"https://doi.org/10.1109/ENC.2006.10","url":null,"abstract":"Dung's argumentation approach is a unifying approach which has played an influential role on argumentation research and artificial intelligence (AT). Based on a proper representation of Dung's argumentation approach and minimal models, we introduce a novel argumentation semantics called preferred+ semantics which follows the preferred semantics' philosophy. Also, we show how to infer preferred+ semantics using a software tool called SI-COBRA that was introduced recently","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115912525","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}
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discriminate between noisy and noiseless observations by using kernel methods. We apply our noise-aware algorithms to several domains including: astronomy, face recognition and ten machine learning benchmark datasets. Experimental results adding noise and useful anomalies to the data show that our algorithm improves data quality, without having to eliminate any observation from the original dataset
{"title":"Cleaning Training-Datasets with Noise-Aware Algorithms","authors":"H. Escalante","doi":"10.1109/ENC.2006.7","DOIUrl":"https://doi.org/10.1109/ENC.2006.7","url":null,"abstract":"We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discriminate between noisy and noiseless observations by using kernel methods. We apply our noise-aware algorithms to several domains including: astronomy, face recognition and ten machine learning benchmark datasets. Experimental results adding noise and useful anomalies to the data show that our algorithm improves data quality, without having to eliminate any observation from the original dataset","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835313","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}
Maria Guadalupe Jimenez Velasco, A. Muñoz-Meléndez
A simple swing propagation mechanism for multi-robot motion coordination is presented. This mechanism is based on local-perception and low-level communication. It is oriented to coordinate situated modular robots. The swing propagation mechanism is divided into two movements: simple following and collective obstacle-avoidance. The first movement is executed when the leader of a robot formation is able to move and proposes a movement that is copied by its followers in the formation. The second movement is executed when the leader of a robot formation is unable to move and asks its followers to undo an action. In the first movement, motion is propagated backwards in a robot formation, whereas in the second movement, a request is propagated backwards and motion is propagated forward in a robot formation. Experimental results of multi-robot motion coordination using Mini-trans, a physical homemade modular system, are presented
{"title":"Multi-robot Motion Coordination based on Swing Propagation","authors":"Maria Guadalupe Jimenez Velasco, A. Muñoz-Meléndez","doi":"10.1109/ENC.2006.22","DOIUrl":"https://doi.org/10.1109/ENC.2006.22","url":null,"abstract":"A simple swing propagation mechanism for multi-robot motion coordination is presented. This mechanism is based on local-perception and low-level communication. It is oriented to coordinate situated modular robots. The swing propagation mechanism is divided into two movements: simple following and collective obstacle-avoidance. The first movement is executed when the leader of a robot formation is able to move and proposes a movement that is copied by its followers in the formation. The second movement is executed when the leader of a robot formation is unable to move and asks its followers to undo an action. In the first movement, motion is propagated backwards in a robot formation, whereas in the second movement, a request is propagated backwards and motion is propagated forward in a robot formation. Experimental results of multi-robot motion coordination using Mini-trans, a physical homemade modular system, are presented","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115924898","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
扫码关注我们
求助内容：
应助结果提醒方式：