We present a new approach to study the global coherence of constraints in data modeling. Unlike most of other approaches, we take a best part of these constraints into account during modeling processing. Thus, it is useless to generate the database - which may be partially or totally empty - if the constraints are in conflict. To this end, we formalize the constraints in mathematical inequalities form combined with expressions in first-order logic. We propose two approaches to detect and localize conflicts. In the first one, an algorithm, based on Fourier-Motzkin elimination, is suggested. In the second approach, the conceptual schema is formalized using a knowledge base.
{"title":"Constraints satisfaction problems in data modeling","authors":"Djamel Berrabah, F. Boufarès","doi":"10.1145/1456223.1456284","DOIUrl":"https://doi.org/10.1145/1456223.1456284","url":null,"abstract":"We present a new approach to study the global coherence of constraints in data modeling. Unlike most of other approaches, we take a best part of these constraints into account during modeling processing. Thus, it is useless to generate the database - which may be partially or totally empty - if the constraints are in conflict. To this end, we formalize the constraints in mathematical inequalities form combined with expressions in first-order logic. We propose two approaches to detect and localize conflicts. In the first one, an algorithm, based on Fourier-Motzkin elimination, is suggested. In the second approach, the conceptual schema is formalized using a knowledge base.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127583075","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}
Recently semantic caching has become very popular due to its novel method for retrieving information. In semantic caching, the cache not only stores the results of the queries, but also stores the semantic description of queries. This strategy provides a good reuse of the cache contents if the results of the queries exactly match the existing semantic regions. Otherwise some existing semantic regions need to be removed to accommodate new regions which are created by the new queries. The constant replacement of existing semantic regions reduces the efficiency expected from this type of caching, since the queries that are using the same relations could have been answered if the existing semantic regions were merged. Therefore, in this research we propose a novel merging strategy for semantic regions in the cache which can enhance the usage of many applications with little memory resources. Although any information system with client/server architecture can benefit from merging of its existing semantic regions, this strategy is particularly useful for mobile environment, due to memory constraints, communication cost, slow and unreliable connections to the server.
{"title":"Novel cache management strategy for semantic caching in mobile environment","authors":"S. Makki, Xu Zhou","doi":"10.1145/1456223.1456265","DOIUrl":"https://doi.org/10.1145/1456223.1456265","url":null,"abstract":"Recently semantic caching has become very popular due to its novel method for retrieving information. In semantic caching, the cache not only stores the results of the queries, but also stores the semantic description of queries. This strategy provides a good reuse of the cache contents if the results of the queries exactly match the existing semantic regions. Otherwise some existing semantic regions need to be removed to accommodate new regions which are created by the new queries. The constant replacement of existing semantic regions reduces the efficiency expected from this type of caching, since the queries that are using the same relations could have been answered if the existing semantic regions were merged. Therefore, in this research we propose a novel merging strategy for semantic regions in the cache which can enhance the usage of many applications with little memory resources. Although any information system with client/server architecture can benefit from merging of its existing semantic regions, this strategy is particularly useful for mobile environment, due to memory constraints, communication cost, slow and unreliable connections to the server.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"532 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113982431","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 present a text mining approach that enables an extension of a standard authorship assessment problem (the problem in which an author of a text needs to be established) to role identification in communications within some Internet community. More precisely, we want to recognize a group of authors communicating in a specific role within such a community rather than a single author. The challenge here is that the same author may participate in different roles in communications within the group, in each role having different authors as peers. An additional challenge of our problem is the length of communications. Each individual exchange in our intended domain, communications within an Internet community, is relatively short, in the order of several dozens of words, so standard text mining approaches may fail. An example of such a problem is recognizing roles in a collection of emails from an organization in which middle level managers communicate both with superiors and subordinates. To validate our approach we use the Enron email dataset which is such a collection. Our approach is based on discovering patterns at varying degrees of abstraction in a hierarchical fashion. Such discovery process allows for certain degree of approximation in matching patterns, which is necessary for capturing non-trivial structures in realistic datasets. The discovered patterns are used as features to build efficient classifiers. Due to the nature of the pattern discovery process, we call our approach Recursive Data Mining. The results show that a classifier that uses the dominant patterns discovered by Recursive Data Mining performs well in role detection.
{"title":"Recursive data mining for role identification","authors":"V. Chaoji, Apirak Hoonlor, B. Szymanski","doi":"10.1145/1456223.1456270","DOIUrl":"https://doi.org/10.1145/1456223.1456270","url":null,"abstract":"We present a text mining approach that enables an extension of a standard authorship assessment problem (the problem in which an author of a text needs to be established) to role identification in communications within some Internet community. More precisely, we want to recognize a group of authors communicating in a specific role within such a community rather than a single author. The challenge here is that the same author may participate in different roles in communications within the group, in each role having different authors as peers. An additional challenge of our problem is the length of communications. Each individual exchange in our intended domain, communications within an Internet community, is relatively short, in the order of several dozens of words, so standard text mining approaches may fail. An example of such a problem is recognizing roles in a collection of emails from an organization in which middle level managers communicate both with superiors and subordinates. To validate our approach we use the Enron email dataset which is such a collection.\u0000 Our approach is based on discovering patterns at varying degrees of abstraction in a hierarchical fashion. Such discovery process allows for certain degree of approximation in matching patterns, which is necessary for capturing non-trivial structures in realistic datasets. The discovered patterns are used as features to build efficient classifiers. Due to the nature of the pattern discovery process, we call our approach Recursive Data Mining. The results show that a classifier that uses the dominant patterns discovered by Recursive Data Mining performs well in role detection.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115311632","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}
Complexity in real-world problems is often tackled by a divide-and-conquer strategy which consists of breaking down the problem into sub-problems to find local solutions. These solutions are then merged in a bottom-up fashion and optimized to produce the final solution. Applications like wiring and pipelining in urban areas are typically complex problems. They require searching the famous Minimum Steiner tree in huge graphs that model the real-world topology of the urban areas. The present paper introduces a new approach relying on the notion of divide-and-conquer to solve the Minimum Steiner tree in large graphs. This approach, called SC-IAC, combines spectral clustering and ant colony optimization in a two-stage algorithm. The first stage allows generating graph segments, whereas the second uses parallel independent ant colonies to find local and global minima of the Steiner tree. To illustrate the efficiency and accuracy of SC-IAC, large real-world benchmarks are used.
{"title":"Ant colony optimization for Steiner tree problems","authors":"Markus Prossegger, A. Bouchachia","doi":"10.1145/1456223.1456292","DOIUrl":"https://doi.org/10.1145/1456223.1456292","url":null,"abstract":"Complexity in real-world problems is often tackled by a divide-and-conquer strategy which consists of breaking down the problem into sub-problems to find local solutions. These solutions are then merged in a bottom-up fashion and optimized to produce the final solution. Applications like wiring and pipelining in urban areas are typically complex problems. They require searching the famous Minimum Steiner tree in huge graphs that model the real-world topology of the urban areas. The present paper introduces a new approach relying on the notion of divide-and-conquer to solve the Minimum Steiner tree in large graphs. This approach, called SC-IAC, combines spectral clustering and ant colony optimization in a two-stage algorithm. The first stage allows generating graph segments, whereas the second uses parallel independent ant colonies to find local and global minima of the Steiner tree. To illustrate the efficiency and accuracy of SC-IAC, large real-world benchmarks are used.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325334","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}
Ubiquitous computing environments are complex systems containing a great amount of heterogeneous devices and services available to users. Both user needs and services offered to them evolve very fast. This evolution requires the adaptation of the software architectures that support user activities. Moreover, such adaptation must be based on application semantics in order to better respond to user needs in any situation. This paper presents a work in progress that aims to build an architecture enabling the development of adaptive collaborative applications in ubiquitous computing environments. An ontology model, containing generic collaboration knowledge as well as domain-specific knowledge, is proposed in order to enable architecture adaptation and to support spontaneous and implicit sessions inside groups of humans and devices.
{"title":"A semantic-driven auto-adaptive architecture for collaborative ubiquitous systems","authors":"Germán Sancho, S. Tazi, T. Villemur","doi":"10.1145/1456223.1456354","DOIUrl":"https://doi.org/10.1145/1456223.1456354","url":null,"abstract":"Ubiquitous computing environments are complex systems containing a great amount of heterogeneous devices and services available to users. Both user needs and services offered to them evolve very fast. This evolution requires the adaptation of the software architectures that support user activities. Moreover, such adaptation must be based on application semantics in order to better respond to user needs in any situation. This paper presents a work in progress that aims to build an architecture enabling the development of adaptive collaborative applications in ubiquitous computing environments. An ontology model, containing generic collaboration knowledge as well as domain-specific knowledge, is proposed in order to enable architecture adaptation and to support spontaneous and implicit sessions inside groups of humans and devices.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580381","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 interdisciplinary study proposes a method for architectural design analysis of house façades which is based on face detection and facial expression classification. The hypothesis is that abstract face expression features can occur in the architectural design of house façades and will potentially trigger emotional responses of observers. The approach used statistical learning with support vector machines for classification. In the computer experiments the system was trained using a specifically composed image data base consisting of human faces and smileys. Afterwards it was applied to a series of test images of human facial expressions and house façades. The experiments show how facial expression pattern associated with emotional states such as surprise, fear, happiness, sadness, anger, disgust, contempt or neutral could be recognised in both image data sets.
{"title":"A face-house paradigm for architectural scene analysis","authors":"S. Chalup, Kenny Hong, Michael J. Ostwald","doi":"10.1145/1456223.1456304","DOIUrl":"https://doi.org/10.1145/1456223.1456304","url":null,"abstract":"This interdisciplinary study proposes a method for architectural design analysis of house façades which is based on face detection and facial expression classification. The hypothesis is that abstract face expression features can occur in the architectural design of house façades and will potentially trigger emotional responses of observers. The approach used statistical learning with support vector machines for classification. In the computer experiments the system was trained using a specifically composed image data base consisting of human faces and smileys. Afterwards it was applied to a series of test images of human facial expressions and house façades. The experiments show how facial expression pattern associated with emotional states such as surprise, fear, happiness, sadness, anger, disgust, contempt or neutral could be recognised in both image data sets.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126055445","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 two-levels of description of organ development as swarm intelligences. The organogenesis process is a clear structure--function system with the property of self-organization (or SI organization). We suggest how this can be applied to the example of kidney development. We discuss how genes and proteins can be described as SI agents. We analyze simplified functions of agents (genes, proteins, etc.) that lead to organization of the next level of cell--cell interactions and postulate rules of behavior of the cells as agents of the next level SI. We also discuss the necessary features of the gene networks that may make it possible for "relay" signal transfer between the cells.
{"title":"Swarm intelligence of gene networks leads to behavioral rules for biological cells to serve as agents for higher level tissue and organ development","authors":"I. Tsigelny, V. Kouznetsova, S. Nigam","doi":"10.1145/1456223.1456253","DOIUrl":"https://doi.org/10.1145/1456223.1456253","url":null,"abstract":"We provide two-levels of description of organ development as swarm intelligences. The organogenesis process is a clear structure--function system with the property of self-organization (or SI organization). We suggest how this can be applied to the example of kidney development. We discuss how genes and proteins can be described as SI agents. We analyze simplified functions of agents (genes, proteins, etc.) that lead to organization of the next level of cell--cell interactions and postulate rules of behavior of the cells as agents of the next level SI. We also discuss the necessary features of the gene networks that may make it possible for \"relay\" signal transfer between the cells.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651415","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}
Bertrand Grandvallet, A. Zemouche, M. Boutayeb, S. Changey
This work brings a contribution on projectile attitude and position estimation in a noisy context. Due to strong non linearities and poor observability of the dynamical model, describing the projectile behavior, very few estimation techniques could be applied. The main features lie in the use of an EKF based estimator that use a sliding window of output measurements and assures a strong tracking using magnetometer sensor only. Furthermore, we notice that the proposed approach may be applied to a general class of non linear discrete time systems with few computational requirements. High performances, even in the presence of unknown biases, are shown through simulation results.
{"title":"A software based approach for autonomous projectile attitude and position estimation","authors":"Bertrand Grandvallet, A. Zemouche, M. Boutayeb, S. Changey","doi":"10.1145/1456223.1456301","DOIUrl":"https://doi.org/10.1145/1456223.1456301","url":null,"abstract":"This work brings a contribution on projectile attitude and position estimation in a noisy context. Due to strong non linearities and poor observability of the dynamical model, describing the projectile behavior, very few estimation techniques could be applied. The main features lie in the use of an EKF based estimator that use a sliding window of output measurements and assures a strong tracking using magnetometer sensor only. Furthermore, we notice that the proposed approach may be applied to a general class of non linear discrete time systems with few computational requirements. High performances, even in the presence of unknown biases, are shown through simulation results.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"105 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133165","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 recognition of unexpected behaviors in databases is an important problem in many real-world applications. In the previous studies, the unexpectedness is mainly stated within the context of the most-studied patterns, association rules, or sequential patterns. In this paper, we first propose the notion of fuzzy recurrence rule, a new kind of rule-based behavior in sequence databases, and then we introduce the problem of recognizing unexpected sequences contradicting the beliefs on fuzzy recurrence rules, with fuzzy measures. We also develop, UFR, an algorithm for discovering unexpected recurrence behaviors in a sequence database. Our approach is evaluated with Web access log data.
{"title":"Recognizing unexpected recurrence behaviors with fuzzy measures in sequence databases","authors":"Dong Li, Anne Laurent, P. Poncelet","doi":"10.1145/1456223.1456235","DOIUrl":"https://doi.org/10.1145/1456223.1456235","url":null,"abstract":"The recognition of unexpected behaviors in databases is an important problem in many real-world applications. In the previous studies, the unexpectedness is mainly stated within the context of the most-studied patterns, association rules, or sequential patterns. In this paper, we first propose the notion of fuzzy recurrence rule, a new kind of rule-based behavior in sequence databases, and then we introduce the problem of recognizing unexpected sequences contradicting the beliefs on fuzzy recurrence rules, with fuzzy measures. We also develop, UFR, an algorithm for discovering unexpected recurrence behaviors in a sequence database. Our approach is evaluated with Web access log data.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129403155","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 an improved version of the Bacterial Memetic Algorithm (BMA) used for fuzzy rule base extraction. In previous works we have found several ways to improve the original BMA. Some of them perform well rather in the case of more complex fuzzy rule base, and some of them perform well rather in the case of less complex fuzzy rule base. We have combined the improvements into a new version of the BMA that performs well in each case investigated.
{"title":"Modified bacterial memetic algorithm used for fuzzy rule base extraction","authors":"L. Gál, János Botzheim, L. Kóczy","doi":"10.1145/1456223.1456310","DOIUrl":"https://doi.org/10.1145/1456223.1456310","url":null,"abstract":"In this paper we discuss an improved version of the Bacterial Memetic Algorithm (BMA) used for fuzzy rule base extraction. In previous works we have found several ways to improve the original BMA. Some of them perform well rather in the case of more complex fuzzy rule base, and some of them perform well rather in the case of less complex fuzzy rule base. We have combined the improvements into a new version of the BMA that performs well in each case investigated.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126462075","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
扫码关注我们
求助内容：
应助结果提醒方式：