The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.
{"title":"More expressive extensions of TQL","authors":"W. Khalil","doi":"10.1145/1456223.1456347","DOIUrl":"https://doi.org/10.1145/1456223.1456347","url":null,"abstract":"The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"326 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":"115152899","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 paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.
{"title":"A novel particle swarm optimization for multiple campaigns assignment problem","authors":"Satchidananda Dehuri, Sung-Bae Cho","doi":"10.1145/1456223.1456290","DOIUrl":"https://doi.org/10.1145/1456223.1456290","url":null,"abstract":"This paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"74 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":"127080594","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}
Despite being relatively unheralded, application-to-application communication of data in standard format still requires human intervention in vast majority of electronic commerce transactions. The perception of the entire electronic data interchange paradigm has to take into account manual data entry of relevant information. Efficient data entry requires de facto standards to capture and structure data of end-users so they can be automatically processed by appropriate applications. The XML meta-language, which is a general-purpose specification for creating custom markup languages, highlights a step toward capturing structured data from graphical interfaces. In fact, XML provides Document Definition Types (DTD) to describe a class of documents in terms of constraints on their structures. However providing on-the-fly graphical forms to capture data based upon predefined DTDs raises a challenge in supporting advanced web-based applications. In this paper, we present a system that is able to automatically generate web forms or editors to capture data with respect to predefined DTDs. On the completion of the data entry the web--based form builds appropriate XML documents. The system receives a DTD as an input and relies on attributed grammars to associate semantic to its elements and produces on-the-fly an HTML-based editor.
{"title":"Automatic generator of XML documents editors based on attributed grammars","authors":"K. Barbar","doi":"10.1145/1456223.1456260","DOIUrl":"https://doi.org/10.1145/1456223.1456260","url":null,"abstract":"Despite being relatively unheralded, application-to-application communication of data in standard format still requires human intervention in vast majority of electronic commerce transactions. The perception of the entire electronic data interchange paradigm has to take into account manual data entry of relevant information. Efficient data entry requires de facto standards to capture and structure data of end-users so they can be automatically processed by appropriate applications. The XML meta-language, which is a general-purpose specification for creating custom markup languages, highlights a step toward capturing structured data from graphical interfaces. In fact, XML provides Document Definition Types (DTD) to describe a class of documents in terms of constraints on their structures. However providing on-the-fly graphical forms to capture data based upon predefined DTDs raises a challenge in supporting advanced web-based applications. In this paper, we present a system that is able to automatically generate web forms or editors to capture data with respect to predefined DTDs. On the completion of the data entry the web--based form builds appropriate XML documents. The system receives a DTD as an input and relies on attributed grammars to associate semantic to its elements and produces on-the-fly an HTML-based editor.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"52 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":"127525785","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}
M. Occello, Jean-Paul Jamont, R. Guillermin, M. Pezzin
The contribution of this paper aims to show how collective intelligence systems as multiagent systems can be specialized and used to build wireless sensor embedded decision software. The paper focuses on methodological, architectural and design aspects of embedded multiagent systems through the experimentation of the DIAMOND multiagent method on an application to distributed location services in Ultra Wide Band sensor networks.
{"title":"A multiagent approach for an UWB location embedded software architecture","authors":"M. Occello, Jean-Paul Jamont, R. Guillermin, M. Pezzin","doi":"10.1145/1456223.1456282","DOIUrl":"https://doi.org/10.1145/1456223.1456282","url":null,"abstract":"The contribution of this paper aims to show how collective intelligence systems as multiagent systems can be specialized and used to build wireless sensor embedded decision software. The paper focuses on methodological, architectural and design aspects of embedded multiagent systems through the experimentation of the DIAMOND multiagent method on an application to distributed location services in Ultra Wide Band sensor networks.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"42 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":"115557914","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 paper provides a framework for specification and verification of intelligent agent-based systems, with the emphasis on their cognitive and reactive features. We use an epistemic transition system to specify the agents and an epistemic synchronous product to specify the multi-agent system. We verify the system by means of a special action-based logic - ACTLW for Epistemic Reasoning (ACTLW stands for Action Computation Tree Logic with Unless Operator). Using temporal and epistemic operators we create the appropriate formulae to check whether the relevant property holds, or the protocol works within the given conditions. We test our method by the example of security communication protocol called Dining Cryptographers.
{"title":"Verification of communication protocols in a multi-agent system","authors":"Marina Bagić Babac, Aleksandar Babac, M. Kunstic","doi":"10.1145/1456223.1456283","DOIUrl":"https://doi.org/10.1145/1456223.1456283","url":null,"abstract":"This paper provides a framework for specification and verification of intelligent agent-based systems, with the emphasis on their cognitive and reactive features. We use an epistemic transition system to specify the agents and an epistemic synchronous product to specify the multi-agent system.\u0000 We verify the system by means of a special action-based logic - ACTLW for Epistemic Reasoning (ACTLW stands for Action Computation Tree Logic with Unless Operator). Using temporal and epistemic operators we create the appropriate formulae to check whether the relevant property holds, or the protocol works within the given conditions.\u0000 We test our method by the example of security communication protocol called Dining Cryptographers.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"129 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":"122423791","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}
Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.
{"title":"A multi-swarm approach for neighbor selection in peer-to-peer networks","authors":"A. Abraham, Hongbo Liu, Y. Badr, C. Grosan","doi":"10.1145/1456223.1456263","DOIUrl":"https://doi.org/10.1145/1456223.1456263","url":null,"abstract":"Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.","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":"122785923","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 paper describes a context aware mobile application which helps the user with his daily commitments. The application senses the user's current context and provides him with suitable information. The system is a mobile application which simulates a user companion aiming to inform him and remind him with his daily duties at the right time and location, and taking into account his personal profile. The application is a client-server architecture which deals with both the mobile environment and the user's context. In this paper we focus on a specific user, the Muslim Companion, for which we have implemented a set of services. The Muslim Companion works like an advisor; it provides guidance and teaching and reminds any Muslim about his daily tasks. Our system has been developed to i) sense the context including the mobile device's environment, the user profile and the calendar's related events; ii) process the suitable services to be required and the information to be displayed; iii) display the information in a user-friendly manner on the user's mobile device. The system is portable and can operate on many platforms and a variety of mobile devices.
{"title":"Context aware mobile Muslim companion","authors":"Mohamed Ali, J. Berri, M. Zemerly","doi":"10.1145/1456223.1456335","DOIUrl":"https://doi.org/10.1145/1456223.1456335","url":null,"abstract":"This paper describes a context aware mobile application which helps the user with his daily commitments. The application senses the user's current context and provides him with suitable information. The system is a mobile application which simulates a user companion aiming to inform him and remind him with his daily duties at the right time and location, and taking into account his personal profile. The application is a client-server architecture which deals with both the mobile environment and the user's context. In this paper we focus on a specific user, the Muslim Companion, for which we have implemented a set of services. The Muslim Companion works like an advisor; it provides guidance and teaching and reminds any Muslim about his daily tasks. Our system has been developed to i) sense the context including the mobile device's environment, the user profile and the calendar's related events; ii) process the suitable services to be required and the information to be displayed; iii) display the information in a user-friendly manner on the user's mobile device. The system is portable and can operate on many platforms and a variety of mobile devices.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"34 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":"117098053","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 typically contain a large number and a large variety of networked sensors that are often embedded in the environment. As these networks grow in size and complexity, their management becomes increasingly costly, for instance in terms of equipment, software, and people. One way to keep these costs under control is to automate some or all of the management aspects in the system, reducing or even removing the need for human interaction. In this paper, we focus on automatically managing Bluetooth networks for indoor localization, which we consider a specific class of ubiquitous computing systems because they usually rely on many Bluetooth devices scattered throughout a particular building. We will discuss algorithms that help reducing the number of active devices needed in a network, while maintaining a comparable localization accuracy compared to the "full" network. The algorithms enable the most "valuable" Bluetooth devices in the network and will disable the others. The main advantage is that this reduces the need for network planning, which reduces the costs of operating the system. Another advantage is that it reduces the amount of energy used by the network and the mobile devices being located. We evaluate the real-world performance of our algorithms through experiments carried out with a running system in a realistic environment. We found that our algorithms can reduce a network to approximately half the original size while still retaining an accuracy level comparable to the original "full" network.
{"title":"Dynamic optimization of Bluetooth networks for indoor localization","authors":"Markus Jevring, R. D. Groote, Cristian Hesselman","doi":"10.1145/1456223.1456357","DOIUrl":"https://doi.org/10.1145/1456223.1456357","url":null,"abstract":"Ubiquitous computing environments typically contain a large number and a large variety of networked sensors that are often embedded in the environment. As these networks grow in size and complexity, their management becomes increasingly costly, for instance in terms of equipment, software, and people. One way to keep these costs under control is to automate some or all of the management aspects in the system, reducing or even removing the need for human interaction. In this paper, we focus on automatically managing Bluetooth networks for indoor localization, which we consider a specific class of ubiquitous computing systems because they usually rely on many Bluetooth devices scattered throughout a particular building. We will discuss algorithms that help reducing the number of active devices needed in a network, while maintaining a comparable localization accuracy compared to the \"full\" network. The algorithms enable the most \"valuable\" Bluetooth devices in the network and will disable the others. The main advantage is that this reduces the need for network planning, which reduces the costs of operating the system. Another advantage is that it reduces the amount of energy used by the network and the mobile devices being located. We evaluate the real-world performance of our algorithms through experiments carried out with a running system in a realistic environment. We found that our algorithms can reduce a network to approximately half the original size while still retaining an accuracy level comparable to the original \"full\" network.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"8 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":"130584694","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}
M. Uzunova, D. Jolly, E. Nikolov, Kamel Boumediene
The main aim of this paper is using the obtain transfer function of the macroscopic traffic flow model, as distributed parameter system, to simulate this model (fig. 1), then based on the obtain results characteristics to make analysis and for further works to use all this simulations for the synthesis and analysis of corresponding control algorithms depending of the needed conditions in transportation problem model. Using this exact method we obtain directly the plant transfer function for the traffic flow model viewed as a distributed parameter system. The entire physical phenomenon is presenting through the partial differential equations whose show the distribution in vehicles on the high ways. All the research is devoted on the transfer function result and his control system model. In the presenting paper we shown the verification of the analytical result of the model simulation thought the time and frequency characteristics analysis.
{"title":"Green function analytical method of solution of transport equation: modeling and simulation of the macroscopic LWR model as a distributed parameter system","authors":"M. Uzunova, D. Jolly, E. Nikolov, Kamel Boumediene","doi":"10.1145/1456223.1456340","DOIUrl":"https://doi.org/10.1145/1456223.1456340","url":null,"abstract":"The main aim of this paper is using the obtain transfer function of the macroscopic traffic flow model, as distributed parameter system, to simulate this model (fig. 1), then based on the obtain results characteristics to make analysis and for further works to use all this simulations for the synthesis and analysis of corresponding control algorithms depending of the needed conditions in transportation problem model. Using this exact method we obtain directly the plant transfer function for the traffic flow model viewed as a distributed parameter system. The entire physical phenomenon is presenting through the partial differential equations whose show the distribution in vehicles on the high ways. All the research is devoted on the transfer function result and his control system model. In the presenting paper we shown the verification of the analytical result of the model simulation thought the time and frequency characteristics analysis.","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":"121635291","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 paper presents a hierarchical clustering algorithm aimed at creating groups of stems with similar characteristics. The resulting groups (clusters) are expected to comprise stems belonging to the same inflectional paradigm (e.g. verbs in passive voice) which will aid the creation of a morphological lexicon. A new metric for calculating the distance between the data objects is proposed, that better suits the specific application by addressing problems that may occur due to the limited amount of information from the data. A series of experimental results are also provided, that demonstrate the performance of the algorithm, compare different distance metrics in terms of their effectiveness and assist in choosing appropriate approaches for a number of parameters.
{"title":"Discovery of underlying morphological relations using an agglomerative clustering algorithm","authors":"Zacharias Detorakis, G. Tambouratzis","doi":"10.1145/1456223.1456267","DOIUrl":"https://doi.org/10.1145/1456223.1456267","url":null,"abstract":"This paper presents a hierarchical clustering algorithm aimed at creating groups of stems with similar characteristics. The resulting groups (clusters) are expected to comprise stems belonging to the same inflectional paradigm (e.g. verbs in passive voice) which will aid the creation of a morphological lexicon. A new metric for calculating the distance between the data objects is proposed, that better suits the specific application by addressing problems that may occur due to the limited amount of information from the data. A series of experimental results are also provided, that demonstrate the performance of the algorithm, compare different distance metrics in terms of their effectiveness and assist in choosing appropriate approaches for a number of parameters.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"39 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":"127592050","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
扫码关注我们
求助内容：
应助结果提醒方式：