Labeled graphs provide a natural way of representing objects and the way they are connected. They have various applications in different fields, such as for example in computational chemistry. They can be represented by relational structures and thus stored in relational databases. Acyclic conjunctive queries form a practically relevant fragment of database queries that can be evaluated in polynomial time. We propose a top-down induction algorithm for learning acyclic conjunctive queries from labeled graphs represented by relational structures. The algorithm allows the use of building blocks which depend on the particular application considered. To compensate for the reduced expressive power of the hypothesis language and thus the potential loss in predictive performance, we combine acyclic conjunctive queries with confidence-rated boosting. In the empirical evaluation of the method we show that it leads to excellent prediction accuracy on the domain of mutagenicity.
{"title":"Effective rule induction from labeled graphs","authors":"T. Horváth, S. Hoche, S. Wrobel","doi":"10.1145/1141277.1141416","DOIUrl":"https://doi.org/10.1145/1141277.1141416","url":null,"abstract":"Labeled graphs provide a natural way of representing objects and the way they are connected. They have various applications in different fields, such as for example in computational chemistry. They can be represented by relational structures and thus stored in relational databases. Acyclic conjunctive queries form a practically relevant fragment of database queries that can be evaluated in polynomial time. We propose a top-down induction algorithm for learning acyclic conjunctive queries from labeled graphs represented by relational structures. The algorithm allows the use of building blocks which depend on the particular application considered. To compensate for the reduced expressive power of the hypothesis language and thus the potential loss in predictive performance, we combine acyclic conjunctive queries with confidence-rated boosting. In the empirical evaluation of the method we show that it leads to excellent prediction accuracy on the domain of mutagenicity.","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":"124939106","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}
For the fourth time in a sequence the annual ACM-SAC symposium is hosting this Software Engineering track. A few changes have taken place since last year: From last year's SE-Track team only Sung Shin and Stefan Gruner are continuing to organise this track and, at the occasion of the 21st SAC symposium, the track's previous subtitle "Methods, Practices and Tools" was modified to "Sound Solutions for the 21st Century". Moreover: For the very first time this track is not only supported by the ACM via the SAC symposium but also endorsed by two further Software Engineering societies, namely Formal Methods Europe (FME) and the European Association of Software Science and Technology (EASST).
{"title":"Editorial message","authors":"Stefan Gruner, Sung-uk Shin","doi":"10.1145/1141277.1141684","DOIUrl":"https://doi.org/10.1145/1141277.1141684","url":null,"abstract":"For the fourth time in a sequence the annual ACM-SAC symposium is hosting this Software Engineering track. A few changes have taken place since last year: From last year's SE-Track team only Sung Shin and Stefan Gruner are continuing to organise this track and, at the occasion of the 21st SAC symposium, the track's previous subtitle \"Methods, Practices and Tools\" was modified to \"Sound Solutions for the 21st Century\". Moreover: For the very first time this track is not only supported by the ACM via the SAC symposium but also endorsed by two further Software Engineering societies, namely Formal Methods Europe (FME) and the European Association of Software Science and Technology (EASST).","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":"123009132","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 show how to extend MOF 2.0 to include an action semantics to support behavioural modelling. We explain why such an extension is useful, particularly for model transformation and consistency checking.
{"title":"An action semantics for MOF 2.0","authors":"R. Paige, D. Kolovos, F. Polack","doi":"10.1145/1141277.1141579","DOIUrl":"https://doi.org/10.1145/1141277.1141579","url":null,"abstract":"We show how to extend MOF 2.0 to include an action semantics to support behavioural modelling. We explain why such an extension is useful, particularly for model transformation and consistency checking.","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":"123509024","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}
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects. What we need is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results, while providing guarantees on the non-disclosure of data. Support vector machine classification is one of the most widely used classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification, PP-SVM for short. Our solution constructs the global SVM classification model from the data distributed at multiple parties, without disclosing the data of each party to others. We assume that data is horizontally partitioned -- each party collects the same features of information for different data objects. We quantify the security and efficiency of the proposed method, and highlight future challenges.
{"title":"Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data","authors":"Hwanjo Yu, Xiaoqian Jiang, Jaideep Vaidya","doi":"10.1145/1141277.1141415","DOIUrl":"https://doi.org/10.1145/1141277.1141415","url":null,"abstract":"Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects. What we need is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results, while providing guarantees on the non-disclosure of data. Support vector machine classification is one of the most widely used classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification, PP-SVM for short. Our solution constructs the global SVM classification model from the data distributed at multiple parties, without disclosing the data of each party to others. We assume that data is horizontally partitioned -- each party collects the same features of information for different data objects. We quantify the security and efficiency of the proposed method, and highlight future challenges.","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":"121786124","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 discuss how to create and update diagrams after the execution of a model transformation. This is achieved by creating an independent diagram reconciliation tool component that is based on a mapping language from the abstract syntax to the concrete syntax of a modeling language. This approach allows us to decouple model transformation from diagram handling in model transformation languages and tools.
{"title":"Reconciling diagrams after executing model transformations","authors":"Marcus Alanen, Torbjörn Lundkvist, Ivan Porres","doi":"10.1145/1141277.1141573","DOIUrl":"https://doi.org/10.1145/1141277.1141573","url":null,"abstract":"In this paper we discuss how to create and update diagrams after the execution of a model transformation. This is achieved by creating an independent diagram reconciliation tool component that is based on a mapping language from the abstract syntax to the concrete syntax of a modeling language. This approach allows us to decouple model transformation from diagram handling in model transformation languages and tools.","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":"122059692","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 provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of floating-point numbers and rounding modes in the Program Verification System (PVS). Our work is based on a well-known formalization of floating-point arithmetic in the proof assistant Coq, where polynomial evaluation has been already studied. However, thanks to the powerful proof automation provided by PVS, the sufficient conditions proposed in our work are more general than the original ones.
{"title":"Provably faithful evaluation of polynomials","authors":"S. Boldo, C. Muñoz","doi":"10.1145/1141277.1141586","DOIUrl":"https://doi.org/10.1145/1141277.1141586","url":null,"abstract":"We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of floating-point numbers and rounding modes in the Program Verification System (PVS). Our work is based on a well-known formalization of floating-point arithmetic in the proof assistant Coq, where polynomial evaluation has been already studied. However, thanks to the powerful proof automation provided by PVS, the sufficient conditions proposed in our work are more general than the original ones.","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":"123896541","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 Location API for J2ME is a standard Java mobile client API that is intended to provide a generic interface to multiple positioning technologies. Its client side object model goes beyond the provision of raw location data to enable geocoding and reverse geocoding of physical landmarks, utilising the mobile device's persistent storage. However this alone does not provide direct support for 'friend finder' type applications that encompass third party mobile devices. In this paper we propose some extensions to the Location API that would enable such applications to be supported in a client centric manner, and demonstrate the use of these extensions within a simulation environment
{"title":"Extending the location API for J2ME™ to support friend finder services","authors":"D. Parsons","doi":"10.1145/1141277.1141514","DOIUrl":"https://doi.org/10.1145/1141277.1141514","url":null,"abstract":"The Location API for J2ME is a standard Java mobile client API that is intended to provide a generic interface to multiple positioning technologies. Its client side object model goes beyond the provision of raw location data to enable geocoding and reverse geocoding of physical landmarks, utilising the mobile device's persistent storage. However this alone does not provide direct support for 'friend finder' type applications that encompass third party mobile devices. In this paper we propose some extensions to the Location API that would enable such applications to be supported in a client centric manner, and demonstrate the use of these extensions within a simulation environment","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":"124019663","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 study looks at the application of preference programming approaches and techniques for decision support during prenegotiations over services. In hierarchical decision analysis models the need for multi-attribute evaluation techniques that may incorporate uncertainties directly in the modeling phase has resulted in the use of the 'interval' approach. With such an approach, preference judgments are presented as ranges including all possible value estimates. This paper reports the results of applying an interval preference programming approach and technique in decision support scenarios for reasoning during pre-negotiations over services. The aim has been to critically evaluate the approach and establish its applicability for ranking multi-dimensional service offers. Our experimental results using interval SMART, in pre-negotiation decision making scenarios, showed that while the dominance relations among alternatives remained unchanged following the introduction of uncertainty intervals, the rank order and dominance relations of the alternatives may vary as a result of the addition or dropping of new alternatives with inferior values.
{"title":"Dominance and ranking issues applying interval techniques in pre-negotiations for services","authors":"P. Tsvetinov, A. Underwood, Taizan Chan","doi":"10.1145/1141277.1141482","DOIUrl":"https://doi.org/10.1145/1141277.1141482","url":null,"abstract":"The study looks at the application of preference programming approaches and techniques for decision support during prenegotiations over services. In hierarchical decision analysis models the need for multi-attribute evaluation techniques that may incorporate uncertainties directly in the modeling phase has resulted in the use of the 'interval' approach. With such an approach, preference judgments are presented as ranges including all possible value estimates. This paper reports the results of applying an interval preference programming approach and technique in decision support scenarios for reasoning during pre-negotiations over services. The aim has been to critically evaluate the approach and establish its applicability for ranking multi-dimensional service offers. Our experimental results using interval SMART, in pre-negotiation decision making scenarios, showed that while the dominance relations among alternatives remained unchanged following the introduction of uncertainty intervals, the rank order and dominance relations of the alternatives may vary as a result of the addition or dropping of new alternatives with inferior values.","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":"124276052","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}
Engineering requires tradeoffs [23]. When engineering computer applications, software engineers should consider the costs and benefits to humans as an integral part of the software development process. In this paper we focus on reliability, a central aspect of software quality, and the influence of relationships and various software development contexts on the software developer.
{"title":"Good/fast/cheap: contexts, relationships and professional responsibility during software development","authors":"Marty J. Wolf, F. Grodzinsky","doi":"10.1145/1141277.1141339","DOIUrl":"https://doi.org/10.1145/1141277.1141339","url":null,"abstract":"Engineering requires tradeoffs [23]. When engineering computer applications, software engineers should consider the costs and benefits to humans as an integral part of the software development process. In this paper we focus on reliability, a central aspect of software quality, and the influence of relationships and various software development contexts on the software developer.","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":"125391408","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. L. Malaquias, A. Rosa, Carlos Manuel B. A. Correia
We propose a model of the human mind from first principles and introspection. We then try to represent that model as a semantic network. Finally, we hypothesize that the key for the intelligent processing of information might be to consider that the semantic network graph to be a kind of small-world.
{"title":"A small-world model of the human mind","authors":"J. L. Malaquias, A. Rosa, Carlos Manuel B. A. Correia","doi":"10.1145/1141277.1141281","DOIUrl":"https://doi.org/10.1145/1141277.1141281","url":null,"abstract":"We propose a model of the human mind from first principles and introspection. We then try to represent that model as a semantic network. Finally, we hypothesize that the key for the intelligent processing of information might be to consider that the semantic network graph to be a kind of small-world.","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":"129848675","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
扫码关注我们
求助内容：
应助结果提醒方式：