Marco M. Carvalho, M. Rebeschini, J. Horsley, Niranjan Suri
In this paper we introduce a group-messaging interface that allows humans to efficiently interact with a group of agents through a hierarchical and customizable text protocol. Our approach is presented in the context of the MAST mobile agent-based framework for security and administration of large scale computer networks. The MAST framework is primarily human-centric and directly supports human-agent interaction that enables customized agents to notify administrators and react to abnormal environmental conditions. The proposed IRC-like interface was developed and tested in the context of MAST. In this paper we present the group-manager interface in contrast with other agent interfaces currently available in the MAST framework.
{"title":"A chat interface for human-agent interaction in MAST","authors":"Marco M. Carvalho, M. Rebeschini, J. Horsley, Niranjan Suri","doi":"10.1145/1141277.1141302","DOIUrl":"https://doi.org/10.1145/1141277.1141302","url":null,"abstract":"In this paper we introduce a group-messaging interface that allows humans to efficiently interact with a group of agents through a hierarchical and customizable text protocol. Our approach is presented in the context of the MAST mobile agent-based framework for security and administration of large scale computer networks. The MAST framework is primarily human-centric and directly supports human-agent interaction that enables customized agents to notify administrators and react to abnormal environmental conditions. The proposed IRC-like interface was developed and tested in the context of MAST. In this paper we present the group-manager interface in contrast with other agent interfaces currently available in the MAST framework.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129593570","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}
In this work, we propose a new approach for protein classification based on Bayesian classifiers. Our goal is to predict the functional family of novel protein sequences based on their motif composition. For this purpose, datasets extracted from Prosite, a curated protein family database, are used as training datasets. In the conducted experiments, the performance of our classifier is compared to other known data mining approaches. The computational results have shown that the proposed method outperforms the other ones and looks very promising for problems with characteristics similar to the problem addressed here.
{"title":"A Bayesian approach for protein classification","authors":"L. Merschmann, A. Plastino","doi":"10.1145/1141277.1141322","DOIUrl":"https://doi.org/10.1145/1141277.1141322","url":null,"abstract":"In this work, we propose a new approach for protein classification based on Bayesian classifiers. Our goal is to predict the functional family of novel protein sequences based on their motif composition. For this purpose, datasets extracted from Prosite, a curated protein family database, are used as training datasets. In the conducted experiments, the performance of our classifier is compared to other known data mining approaches. The computational results have shown that the proposed method outperforms the other ones and looks very promising for problems with characteristics similar to the problem addressed here.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127088339","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 implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall error of the implementation with respect to the mathematical function. Such work is function specific, concerns tens of lines of code for each function, and will usually be broken by the smallest change to the code (e.g. for maintenance or optimization purpose). Therefore, it is very tedious and error-prone if done by hand. This article discusses the use of the Gappa proof assistant in this context. Gappa has two main advantages over previous approaches: Its input format is very close to the actual C code to validate, and it automates error evaluation and propagation using interval arithmetic. Besides, it can be used to incrementally prove complex mathematical properties pertaining to the C code. Yet it does not require any specific knowledge about automatic theorem proving, and thus is accessible to a wider community. Moreover, Gappa may generate a formal proof of the results that can be checked independently by a lower-level proof assistant like Coq, hence providing an even higher confidence in the certification of the numerical code.
{"title":"Assisted verification of elementary functions using Gappa","authors":"F. D. Dinechin, C. Lauter, G. Melquiond","doi":"10.1145/1141277.1141584","DOIUrl":"https://doi.org/10.1145/1141277.1141584","url":null,"abstract":"The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall error of the implementation with respect to the mathematical function. Such work is function specific, concerns tens of lines of code for each function, and will usually be broken by the smallest change to the code (e.g. for maintenance or optimization purpose). Therefore, it is very tedious and error-prone if done by hand. This article discusses the use of the Gappa proof assistant in this context. Gappa has two main advantages over previous approaches: Its input format is very close to the actual C code to validate, and it automates error evaluation and propagation using interval arithmetic. Besides, it can be used to incrementally prove complex mathematical properties pertaining to the C code. Yet it does not require any specific knowledge about automatic theorem proving, and thus is accessible to a wider community. Moreover, Gappa may generate a formal proof of the results that can be checked independently by a lower-level proof assistant like Coq, hence providing an even higher confidence in the certification of the numerical code.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127285675","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}
In this paper we will present the results of research into the semantics of modeling constructs for the process-oriented perspective for the conceptual modeling of enterprise subject areas. The set of modeling constructs that are defined in this paper are fully 'compatible' with the models in the data-oriented perspective in the fact oriented school of conceptual modeling. We will derive the 'semantic' bridges for the conceptual modeling methodology for enterprises in the process-oriented perspective.
{"title":"Conceptual process configurations in enterprise knowledge management systems","authors":"Peter Bollen","doi":"10.1145/1141277.1141631","DOIUrl":"https://doi.org/10.1145/1141277.1141631","url":null,"abstract":"In this paper we will present the results of research into the semantics of modeling constructs for the process-oriented perspective for the conceptual modeling of enterprise subject areas. The set of modeling constructs that are defined in this paper are fully 'compatible' with the models in the data-oriented perspective in the fact oriented school of conceptual modeling. We will derive the 'semantic' bridges for the conceptual modeling methodology for enterprises in the process-oriented perspective.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127539800","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}
T. D. Noia, E. Sciascio, F. D. Cugno, E. Tinelli, F. Donini
We present a framework and an application for semantic-based retrieval of images. Our approach adopts a two-level ontology structure in a subset of OWL-DL. In the core ontology only generic spatial relations are represented, while domain ontologies are specific for the image collection. The approach allows semantic-based relevence ranking and results explanation for query refinement, by exploiting standard and non-standard inferences in Description Logics.
{"title":"A framework for content-based image retrieval fully exploiting the semantics of annotation","authors":"T. D. Noia, E. Sciascio, F. D. Cugno, E. Tinelli, F. Donini","doi":"10.1145/1141277.1141682","DOIUrl":"https://doi.org/10.1145/1141277.1141682","url":null,"abstract":"We present a framework and an application for semantic-based retrieval of images. Our approach adopts a two-level ontology structure in a subset of OWL-DL. In the core ontology only generic spatial relations are represented, while domain ontologies are specific for the image collection. The approach allows semantic-based relevence ranking and results explanation for query refinement, by exploiting standard and non-standard inferences in Description Logics.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129983680","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}
Geographic Information Systems (GIS) software has become an important computational tool in several fields. GIS software ranges from command line processors, with maximal control over internal model decisions, to GUI versions with point-and-click access to pre-set modules. Based on the output from this software, some GIS users make important decisions to plan and manage landscapes (e.g., cities, parks, forests) with real consequences for the managed ecosystems. We discuss a programming decision in a GIS algorithm originally used to discern flow direction in hydrological modeling: a first step in mapping streams and rivers. Topographic depressions ("sinks") are "filled" in the algorithm to map water flow downstream; otherwise, the GIS algorithm cannot solve the flow direction. Unfortunately, sinks are often "isolated" wetlands which provide essential habitat for many species not commonly found elsewhere. Thus the algorithmic filling of sinks can make these wetlands "disappear" in GIS output and land-use decisions based on this output.This algorithmic detail may have potentially devastating real-world consequences for numerous wetlands because land-use plans made in ignorance cannot adequately conserve these unique habitats and the vital ecosystem services that wetlands provide. These consequences were not anticipated by the programmers who originally implemented the flow direction algorithm and may not be known to GIS users. We offer several strategies to reduce the impact of these consequences for GIS programmers, users, and policy makers who depend on GIS data when making decisions.
{"title":"GIS, SINKS, FILL, and disappearing wetlands: unintended consequences in algorithm development and use","authors":"D. Jenkins, L. McCauley","doi":"10.1145/1141277.1141342","DOIUrl":"https://doi.org/10.1145/1141277.1141342","url":null,"abstract":"Geographic Information Systems (GIS) software has become an important computational tool in several fields. GIS software ranges from command line processors, with maximal control over internal model decisions, to GUI versions with point-and-click access to pre-set modules. Based on the output from this software, some GIS users make important decisions to plan and manage landscapes (e.g., cities, parks, forests) with real consequences for the managed ecosystems. We discuss a programming decision in a GIS algorithm originally used to discern flow direction in hydrological modeling: a first step in mapping streams and rivers. Topographic depressions (\"sinks\") are \"filled\" in the algorithm to map water flow downstream; otherwise, the GIS algorithm cannot solve the flow direction. Unfortunately, sinks are often \"isolated\" wetlands which provide essential habitat for many species not commonly found elsewhere. Thus the algorithmic filling of sinks can make these wetlands \"disappear\" in GIS output and land-use decisions based on this output.This algorithmic detail may have potentially devastating real-world consequences for numerous wetlands because land-use plans made in ignorance cannot adequately conserve these unique habitats and the vital ecosystem services that wetlands provide. These consequences were not anticipated by the programmers who originally implemented the flow direction algorithm and may not be known to GIS users. We offer several strategies to reduce the impact of these consequences for GIS programmers, users, and policy makers who depend on GIS data when making decisions.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032274","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}
Elaine P. M. de Sousa, A. Traina, C. Traina, C. Faloutsos
Data streams are fundamental in several data processing applications involving large amount of data generated continuously as a sequence of events. Frequently, such events are not stored, so the data is analyzed and queried as they arrive and discarded right away. In many applications these events are represented by a predetermined number of numerical attributes. Thus, without loss of generality, we can consider events as elements from a dimensional domain. A sequence of events in a data stream can be characterized by its intrinsic dimension, which in dimensional datasets is usually lower than the embedding dimensionality. As the intrinsic dimension can be used to improve the performance of algorithms handling dimensional data (specially query optimization) measuring it is relevant to improve data streams processing and analysis as well. Moreover, it can also be useful to forecast data behavior. Hence, we present an algorithm able to measure the intrinsic dimension of a data stream on the fly, following its continuously changing behavior. We also present experimental studies, using both real and synthetic data streams, showing that the results on well-understood datasets closely follow what is expected from the known behavior of the data.
{"title":"Evaluating the intrinsic dimension of evolving data streams","authors":"Elaine P. M. de Sousa, A. Traina, C. Traina, C. Faloutsos","doi":"10.1145/1141277.1141426","DOIUrl":"https://doi.org/10.1145/1141277.1141426","url":null,"abstract":"Data streams are fundamental in several data processing applications involving large amount of data generated continuously as a sequence of events. Frequently, such events are not stored, so the data is analyzed and queried as they arrive and discarded right away. In many applications these events are represented by a predetermined number of numerical attributes. Thus, without loss of generality, we can consider events as elements from a dimensional domain. A sequence of events in a data stream can be characterized by its intrinsic dimension, which in dimensional datasets is usually lower than the embedding dimensionality. As the intrinsic dimension can be used to improve the performance of algorithms handling dimensional data (specially query optimization) measuring it is relevant to improve data streams processing and analysis as well. Moreover, it can also be useful to forecast data behavior. Hence, we present an algorithm able to measure the intrinsic dimension of a data stream on the fly, following its continuously changing behavior. We also present experimental studies, using both real and synthetic data streams, showing that the results on well-understood datasets closely follow what is expected from the known behavior of the data.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965412","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}
Thomas Hazel, Laura Toma, J. Vahrenhold, Rajiv Wickremesinghe
This paper addresses the problem of computing least-cost-path surfaces for massive grid-based terrains. Our approach follows a modular design, enabling the algorithm to make efficient use of memory, disk, and grid computing environments. We have implemented the algorithm in the context of the GRASS open source GIS system and---using our cluster management tool---in a distributed environment. We report experimental results demonstrating that the algorithm is not only of theoretical and conceptual interest but also performs well in practice. Our implementation outperforms standard solutions as dataset size increases relative to available memory and our distributed solver obtains near-linear speedup when preprocessing large terrains for multiple queries.
{"title":"TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains","authors":"Thomas Hazel, Laura Toma, J. Vahrenhold, Rajiv Wickremesinghe","doi":"10.1145/1141277.1141290","DOIUrl":"https://doi.org/10.1145/1141277.1141290","url":null,"abstract":"This paper addresses the problem of computing least-cost-path surfaces for massive grid-based terrains. Our approach follows a modular design, enabling the algorithm to make efficient use of memory, disk, and grid computing environments. We have implemented the algorithm in the context of the GRASS open source GIS system and---using our cluster management tool---in a distributed environment. We report experimental results demonstrating that the algorithm is not only of theoretical and conceptual interest but also performs well in practice. Our implementation outperforms standard solutions as dataset size increases relative to available memory and our distributed solver obtains near-linear speedup when preprocessing large terrains for multiple queries.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301778","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}
When we want information on current events, we often view news programs on TV or news streams on Web sites. A news video stream consists of several scenes, and viewers often gain a broad understanding of the news by viewing scenes in the given order. Since a viewer's opinion of a news topic will depend on the scene order, we have developed a method for extracting blog entries expressing a particular point of view regarding news topics where we use a form of evaluation and categorization similar to that based on news scene order. In this paper, we describe our method of news evaluation based on news scene order and explain how a blog search can be done using a news stream.
{"title":"An evaluation system for news video streams and blogs","authors":"D. Kitayama, K. Sumiya","doi":"10.1145/1141277.1141593","DOIUrl":"https://doi.org/10.1145/1141277.1141593","url":null,"abstract":"When we want information on current events, we often view news programs on TV or news streams on Web sites. A news video stream consists of several scenes, and viewers often gain a broad understanding of the news by viewing scenes in the given order. Since a viewer's opinion of a news topic will depend on the scene order, we have developed a method for extracting blog entries expressing a particular point of view regarding news topics where we use a form of evaluation and categorization similar to that based on news scene order. In this paper, we describe our method of news evaluation based on news scene order and explain how a blog search can be done using a news stream.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130591150","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}
This work presents a program analyzer for checking Abstract Non-Interference in a fragment of Java bytecode. Abstract Non-Interference is an information flow property which is weaker and more general than standard Non-Interference, since it can allow some selected parts of secret information to flow into the public part of a program. The motivation for such a weakening is that some flows are indeed useful in real-life applications. The amount of allowed flows is encoded into abstract domains, which characterize the degree of precision of a potential attacker in observing data; flows are forbidden as long as they can be observed and exploited by attackers. Abstract values describe possible values of programs in different executions. Basic features of Java bytecode are considered; advanced topics, such as method calls, objects and exceptions, are also discussed. A program is said to be secure if analysis computes a state which does not contain private information in public places; information flows can exist only as long as the attacker has not enough observational power to see and exploit them.
{"title":"Abstract non-interference in a fragment of Java bytecode","authors":"D. Zanardini","doi":"10.1145/1141277.1141706","DOIUrl":"https://doi.org/10.1145/1141277.1141706","url":null,"abstract":"This work presents a program analyzer for checking Abstract Non-Interference in a fragment of Java bytecode. Abstract Non-Interference is an information flow property which is weaker and more general than standard Non-Interference, since it can allow some selected parts of secret information to flow into the public part of a program. The motivation for such a weakening is that some flows are indeed useful in real-life applications. The amount of allowed flows is encoded into abstract domains, which characterize the degree of precision of a potential attacker in observing data; flows are forbidden as long as they can be observed and exploited by attackers. Abstract values describe possible values of programs in different executions. Basic features of Java bytecode are considered; advanced topics, such as method calls, objects and exceptions, are also discussed. A program is said to be secure if analysis computes a state which does not contain private information in public places; information flows can exist only as long as the attacker has not enough observational power to see and exploit them.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132392526","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
扫码关注我们
求助内容：
应助结果提醒方式：