Fingerprinting schemes use digital watermarks to determine originators of unauthorized/pirated copies. Multiple users may collude and collectively escape identification by creating an average or median of their individually watermarked copies. We present a scalable codebook generation scheme to increase the number of fingerprinted users. We extended the ACC (anti-collusion code) scheme using a Gaussian distributed random variable for medium attack robustness. We experimented with our scheme using human visual system based watermarking scheme, and the simulation results with standard test images show good collusion detection performance over average and median collusion attacks.
{"title":"A scalable fingerprinting scheme for tracing traitors/colluders in large scale contents distribution environments","authors":"Jae-Min Seol, Seong-Whan Kim","doi":"10.1109/ISDA.2005.14","DOIUrl":"https://doi.org/10.1109/ISDA.2005.14","url":null,"abstract":"Fingerprinting schemes use digital watermarks to determine originators of unauthorized/pirated copies. Multiple users may collude and collectively escape identification by creating an average or median of their individually watermarked copies. We present a scalable codebook generation scheme to increase the number of fingerprinted users. We extended the ACC (anti-collusion code) scheme using a Gaussian distributed random variable for medium attack robustness. We experimented with our scheme using human visual system based watermarking scheme, and the simulation results with standard test images show good collusion detection performance over average and median collusion attacks.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134464265","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 paper is an experimental study of using the rough sets based rule induction algorithm MODLEM in the framework of multiple classifiers. Particular attention is paid to using a meta-classifier called combiner, which learns how to aggregate answers of component classifiers. The experimental results confirm that the range of classification improvement for the combiner depends on the independence of errors made by the component classifiers. Moreover, we summarize the experience with using MODLEM in other multiple classifiers, namely the bagging and n/sup 2/ classifiers.
{"title":"On using rule induction in multiple classifiers with a combiner aggregation strategy","authors":"J. Stefanowski, Sławomir Nowaczyk","doi":"10.1109/ISDA.2005.74","DOIUrl":"https://doi.org/10.1109/ISDA.2005.74","url":null,"abstract":"The paper is an experimental study of using the rough sets based rule induction algorithm MODLEM in the framework of multiple classifiers. Particular attention is paid to using a meta-classifier called combiner, which learns how to aggregate answers of component classifiers. The experimental results confirm that the range of classification improvement for the combiner depends on the independence of errors made by the component classifiers. Moreover, we summarize the experience with using MODLEM in other multiple classifiers, namely the bagging and n/sup 2/ classifiers.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566204","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 an intelligent information retrieval model based on multi-agent paradigm and conceptual graphs. The growing amount of on-line information and its dynamic nature forces us to reconsider existing passive approaches for information retrieval. Because of this ever-growing size of information sources the burden of retrieving information can not be simply left on users. We attempt to handle this problem through software agents. Our model makes use of a user modeling agent (UMA), a facilitator and integrator (FACINT) module and a number of retrieval agents. UMA is responsible for creating a user profile. Actual retrieval is done by retrieval agents. FACINT is responsible for controlling and coordinating activities of various agents. It also does final ranking of the documents based on conceptual graph (CG) representation of documents. The use of CG brings semantics in making relevance judgment resulting in improved ranking. The model proposed by us is simple, efficient, scalable and can work actively as well as passively.
{"title":"Integrating notion of agency and semantics in information retrieval: an intelligent multi-agent model","authors":"Tanveer J. Siddiqui, U. Tiwary","doi":"10.1109/ISDA.2005.57","DOIUrl":"https://doi.org/10.1109/ISDA.2005.57","url":null,"abstract":"We present an intelligent information retrieval model based on multi-agent paradigm and conceptual graphs. The growing amount of on-line information and its dynamic nature forces us to reconsider existing passive approaches for information retrieval. Because of this ever-growing size of information sources the burden of retrieving information can not be simply left on users. We attempt to handle this problem through software agents. Our model makes use of a user modeling agent (UMA), a facilitator and integrator (FACINT) module and a number of retrieval agents. UMA is responsible for creating a user profile. Actual retrieval is done by retrieval agents. FACINT is responsible for controlling and coordinating activities of various agents. It also does final ranking of the documents based on conceptual graph (CG) representation of documents. The use of CG brings semantics in making relevance judgment resulting in improved ranking. The model proposed by us is simple, efficient, scalable and can work actively as well as passively.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133281036","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 there will be presented the new opportunities for applying linguistic algorithms of pattern recognition for computer understanding of image semantic content in intelligent information systems. A successful obtaining of the crucial semantic information of the image - especially medical - may contribute considerably to the creation of new intelligent cognitive information systems. Thanks to the new algorithms of cognitive resonance between stream of the data extracted from the image and expectations taken from the representation of the medical knowledge, we can understand the merit content of the image even if the form of the image is very different from any known pattern. It seems that in the near future the technique of automatic understanding of images may become one of the effective tools for semantic interpreting, and intelligent storing of the visual data in scattered databases. In this article we will try proving that structural techniques may be applied in the case of tasks related to automatic classification and machine perception of the semantic meaning of selected classes of medical patterns.
{"title":"New proposition for intelligent systems design: artificial understanding of the images as the next step of advanced data analysis after automatic classification and pattern recognition","authors":"R. Tadeusiewicz, M. Ogiela","doi":"10.1109/ISDA.2005.73","DOIUrl":"https://doi.org/10.1109/ISDA.2005.73","url":null,"abstract":"In this paper there will be presented the new opportunities for applying linguistic algorithms of pattern recognition for computer understanding of image semantic content in intelligent information systems. A successful obtaining of the crucial semantic information of the image - especially medical - may contribute considerably to the creation of new intelligent cognitive information systems. Thanks to the new algorithms of cognitive resonance between stream of the data extracted from the image and expectations taken from the representation of the medical knowledge, we can understand the merit content of the image even if the form of the image is very different from any known pattern. It seems that in the near future the technique of automatic understanding of images may become one of the effective tools for semantic interpreting, and intelligent storing of the visual data in scattered databases. In this article we will try proving that structural techniques may be applied in the case of tasks related to automatic classification and machine perception of the semantic meaning of selected classes of medical patterns.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131352821","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}
Construction of an effective real time learning algorithm is mostly needed for the pulsed neural network nowadays. The learning algorithm should collect and convert the data from networks inputs into a PNN memory while network's working. Keeping of an asynchronous state in the background is a big challenge during learning PNN with a certain number of recurrent connections like Hebbian cell assemblies (HCA) or synfire chains (SFC). This paper presents methods which are usable for refusing or accepting the examined learning algorithm in the relatively short time of simulation and it gives us advice about direction of our research.
{"title":"The verification's criterion of learning algorithm","authors":"Tymoteusz Bilyk","doi":"10.1109/ISDA.2005.93","DOIUrl":"https://doi.org/10.1109/ISDA.2005.93","url":null,"abstract":"Construction of an effective real time learning algorithm is mostly needed for the pulsed neural network nowadays. The learning algorithm should collect and convert the data from networks inputs into a PNN memory while network's working. Keeping of an asynchronous state in the background is a big challenge during learning PNN with a certain number of recurrent connections like Hebbian cell assemblies (HCA) or synfire chains (SFC). This paper presents methods which are usable for refusing or accepting the examined learning algorithm in the relatively short time of simulation and it gives us advice about direction of our research.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114311361","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}
Discrete optimization methods are applied in time-dependent systems where there are problems of production management and job's scheduling. One can encounter such problems in preparing travel itineraries for tourists, in optimal ways (e.g. traveling salesman's way), schedule planning and in expert systems connected with taking optimal decisions. Many of these problems amount to determining optimal scheduling (permutation of some objects) and usually they are NP-hard. They have also irregular goal functions and very many local minima. Classic heuristic algorithms (tabu search, simulated annealing and genetic algorithm) quickly converge to some local minimum and diversification of the search process is difficult. In this paper we present a hybrid evolutionary algorithm for solving permutation optimization problems. It consists in testing feasible solutions, which are local minima.
{"title":"A hybrid evolutionary algorithm for some discrete optimization problems","authors":"W. Bożejko, M. Wodecki","doi":"10.1109/ISDA.2005.8","DOIUrl":"https://doi.org/10.1109/ISDA.2005.8","url":null,"abstract":"Discrete optimization methods are applied in time-dependent systems where there are problems of production management and job's scheduling. One can encounter such problems in preparing travel itineraries for tourists, in optimal ways (e.g. traveling salesman's way), schedule planning and in expert systems connected with taking optimal decisions. Many of these problems amount to determining optimal scheduling (permutation of some objects) and usually they are NP-hard. They have also irregular goal functions and very many local minima. Classic heuristic algorithms (tabu search, simulated annealing and genetic algorithm) quickly converge to some local minimum and diversification of the search process is difficult. In this paper we present a hybrid evolutionary algorithm for solving permutation optimization problems. It consists in testing feasible solutions, which are local minima.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"34 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116187730","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 new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.
{"title":"APS: agent's learning with imperfect recall","authors":"D. Dudek, Michal Kubisz, Aleksander Zgrzywa","doi":"10.1109/ISDA.2005.26","DOIUrl":"https://doi.org/10.1109/ISDA.2005.26","url":null,"abstract":"We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122361397","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}
Intelligent behavior is the selection of actions based on knowledge. The design of the fuzzy adaptive survivability tool (FAST) agents and their intelligent behavior is explained. A FAST agent uses Belief-Desire-Intention (BDI) logic as the reasoning framework to decide on desirable response plans. These decisions are both context-sensitive to take into account the changes in the network status and cost-sensitive to avoid the risk of collateral damage. A real-world scenario, which shows how the FAST agents choose desirable responses to mitigate scanning worm traffic, is also presented.
{"title":"Agent-oriented design for network survivability","authors":"M. Shajari, A. Ghorbani","doi":"10.1109/ISDA.2005.20","DOIUrl":"https://doi.org/10.1109/ISDA.2005.20","url":null,"abstract":"Intelligent behavior is the selection of actions based on knowledge. The design of the fuzzy adaptive survivability tool (FAST) agents and their intelligent behavior is explained. A FAST agent uses Belief-Desire-Intention (BDI) logic as the reasoning framework to decide on desirable response plans. These decisions are both context-sensitive to take into account the changes in the network status and cost-sensitive to avoid the risk of collateral damage. A real-world scenario, which shows how the FAST agents choose desirable responses to mitigate scanning worm traffic, is also presented.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129176377","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}
Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.
Microsoft Windows使用注册表的概念来存储所有配置信息。注册表项具有关联和依赖关系。例如，可执行文件的路径可能是相对于某些主目录的。将更快的访问作为目标之一的注册中心并没有显式地捕获这些关系。在本文中，我们探索了一种使用共享和统一变量更显式地捕获依赖关系的表示。这种表示(称为mRegistry)利用了注册表的树状结构分层特性，它是基于概念的，并在多个阶段中获得。mRegistry捕获块内、块间和祖先-子依赖关系(注册表中父键的所有叶子条目作为一个实体组合在一起构成一个块，从而使该块成为父块的唯一子块)。此外，它还以规则的形式学习依赖关系的广义概念。我们展示了mRegistry在故障诊断、预测、比较、压缩等方面的应用。
{"title":"mRegistry: a registry representation for fault diagnosis","authors":"R. Bose, S. Srinivasan","doi":"10.1109/ISDA.2005.68","DOIUrl":"https://doi.org/10.1109/ISDA.2005.68","url":null,"abstract":"Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129444336","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}
Pub Date : 2005-09-08DOI: 10.1142/S0218213007003540
Christina Christakou, S. Vrettos, A. Stafylopatis
Recently, there has been a lot of speculation among the members of the artificial intelligence community concerning the way AI can help with the problem of successful information search in the reservoirs of knowledge of Internet. Recommender systems provide a solution to this problem by giving individualized recommendations. Content-based and collaborative filtering are usually applied to predict these recommendations. A combination of the results of these two techniques is used in this work in order to construct a system that provides more precise recommendations concerning movies. The MovieLens data set was used to test the proposed hybrid system.
{"title":"A hybrid movie recommender system based on neural networks","authors":"Christina Christakou, S. Vrettos, A. Stafylopatis","doi":"10.1142/S0218213007003540","DOIUrl":"https://doi.org/10.1142/S0218213007003540","url":null,"abstract":"Recently, there has been a lot of speculation among the members of the artificial intelligence community concerning the way AI can help with the problem of successful information search in the reservoirs of knowledge of Internet. Recommender systems provide a solution to this problem by giving individualized recommendations. Content-based and collaborative filtering are usually applied to predict these recommendations. A combination of the results of these two techniques is used in this work in order to construct a system that provides more precise recommendations concerning movies. The MovieLens data set was used to test the proposed hybrid system.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124446495","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
扫码关注我们
求助内容：
应助结果提醒方式：