If much remains still to discover concerning animal brain's internal structure as well as concerning its learning and self-organization mechanisms,, a number of recent advances in "neurobiology" already highlight some of key mechanisms of this marvels machine. Among them one can emphasizes brain's "modular" structure and its "self-organizing" capabilities. The main goal of this paper is to show how these primary supplies, especially the modularity, could be exploited and combined in the frame of "soft- computing" issued techniques in order to design intelligent artificial systems emerging higher level intelligent behavior than conventional Artificial Neural Networks (ANN) based structures.
{"title":"Toward Higher Level Intelligent Systems","authors":"K. Madani","doi":"10.1109/CISIM.2007.67","DOIUrl":"https://doi.org/10.1109/CISIM.2007.67","url":null,"abstract":"If much remains still to discover concerning animal brain's internal structure as well as concerning its learning and self-organization mechanisms,, a number of recent advances in \"neurobiology\" already highlight some of key mechanisms of this marvels machine. Among them one can emphasizes brain's \"modular\" structure and its \"self-organizing\" capabilities. The main goal of this paper is to show how these primary supplies, especially the modularity, could be exploited and combined in the frame of \"soft- computing\" issued techniques in order to design intelligent artificial systems emerging higher level intelligent behavior than conventional Artificial Neural Networks (ANN) based structures.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131857007","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}
Shichang Sun, A. Abraham, Guiyong Zhang, Hongbo Liu
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a particle swarm optimization (PSO) approach to the problem of neighbor selection (NS) in P2P networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than genetic algorithm (GA), specially for large scale problems.
{"title":"A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks","authors":"Shichang Sun, A. Abraham, Guiyong Zhang, Hongbo Liu","doi":"10.1109/CISIM.2007.6","DOIUrl":"https://doi.org/10.1109/CISIM.2007.6","url":null,"abstract":"Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a particle swarm optimization (PSO) approach to the problem of neighbor selection (NS) in P2P networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than genetic algorithm (GA), specially for large scale problems.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"23 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114048342","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 the off-line type signature analysis have been considered. Signature image by means of three different approaches is analysed, what allows to define features (weights) of the signature. Different influences of such features were tested and stated. In this paper, personal signature is pre-processed and in the three stages signature is processed. In proposed approach the Hough transform is introduced, centre of signature gravity is determined, and the horizontal and vertical signature histograms are performed. Proposed approach gives good signature recognition level, hence described method can be used in many areas, for example in biometric authentication, as biometric computer protection or as method of the analysis of person's behaviour changes.
{"title":"The Compact Three Stages Method of the Signature Recognition","authors":"P. Porwik","doi":"10.1109/CISIM.2007.65","DOIUrl":"https://doi.org/10.1109/CISIM.2007.65","url":null,"abstract":"In this paper the off-line type signature analysis have been considered. Signature image by means of three different approaches is analysed, what allows to define features (weights) of the signature. Different influences of such features were tested and stated. In this paper, personal signature is pre-processed and in the three stages signature is processed. In proposed approach the Hough transform is introduced, centre of signature gravity is determined, and the horizontal and vertical signature histograms are performed. Proposed approach gives good signature recognition level, hence described method can be used in many areas, for example in biometric authentication, as biometric computer protection or as method of the analysis of person's behaviour changes.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114675098","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 probabilistic and nondeterministic programs are considered on the ground of logic of programs. The formal semantics of probabilistic and nondeterministic computations of a program are the starting point for the comparing properties of these programs. We are interested in dependencies, especially in similarities between nondeterministic and probabilistic interpretation of a program.
{"title":"Interpretation of Probabilistic Algorithmic Logic in Nondeterministic Algorithmic Logic","authors":"Agnieszka Makarec","doi":"10.1109/CISIM.2007.42","DOIUrl":"https://doi.org/10.1109/CISIM.2007.42","url":null,"abstract":"In this paper probabilistic and nondeterministic programs are considered on the ground of logic of programs. The formal semantics of probabilistic and nondeterministic computations of a program are the starting point for the comparing properties of these programs. We are interested in dependencies, especially in similarities between nondeterministic and probabilistic interpretation of a program.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117124576","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 article concerns the 3D multiview representation of monotonous polyhedrons generated on the base of their Brep and including shaded views as a result of concavities occlusions in the views. The algorithm acts according to viewing sphere with perspective projection concept (called K-M view space model). Those models are used for visual identification based on them and a scene depth map. The results of algorithm testing are presented (the resulting views with shaded views) for some solids.
{"title":"Using Shaded Views in 3D Multiview Representation of Monotonous Polyhedron","authors":"W. Mokrzycki, A. Salamończyk","doi":"10.1109/CISIM.2007.71","DOIUrl":"https://doi.org/10.1109/CISIM.2007.71","url":null,"abstract":"The article concerns the 3D multiview representation of monotonous polyhedrons generated on the base of their Brep and including shaded views as a result of concavities occlusions in the views. The algorithm acts according to viewing sphere with perspective projection concept (called K-M view space model). Those models are used for visual identification based on them and a scene depth map. The results of algorithm testing are presented (the resulting views with shaded views) for some solids.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124945695","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}
Software is more and more frequently distributed inform of source code. Unprotected code is easy to alter and build in others projects. The answer for attacks against intellectual rights is obfuscation, a process that makes software unintelligible but still functional. In this paper we review several generic techniques of obfuscation VHDL (Very High Speed Integrated Circuit Hardware Description Language) code and present a set of them for software protection. We are going to describe some related experimental work.
{"title":"Obfuscation as Intellectual Rights Protection in VHDL Language","authors":"M. Brzozowski, V. Yarmolik","doi":"10.1109/CISIM.2007.51","DOIUrl":"https://doi.org/10.1109/CISIM.2007.51","url":null,"abstract":"Software is more and more frequently distributed inform of source code. Unprotected code is easy to alter and build in others projects. The answer for attacks against intellectual rights is obfuscation, a process that makes software unintelligible but still functional. In this paper we review several generic techniques of obfuscation VHDL (Very High Speed Integrated Circuit Hardware Description Language) code and present a set of them for software protection. We are going to describe some related experimental work.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715459","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 OLAP (on-line analytical processing) queries are ad hoc, complex aggregation queries on massive data set. How to effectively aggregate the query data becomes the key issue for OLAP query evaluation. To solve this problem, a novel grouping aggregation algorithm, DHEGA(grouping aggregation based on the dimension hierarchical encoding), is proposed in this paper. It utilizes the fairly short DHE(dimension hierarchical encoding) and its hierarchical prefix path, retrieves the matching dimension hierarchical encoding and evaluates the set of query ranges for each dimension rapidly. As a result, our algorithm significantly reduces the disk I/Os and improves the efficiency of OLAP queries. The analytical and experimental results demonstrate that DHEGA algorithm is highly efficient and outperforms all the previous approaches.
{"title":"A Grouping Aggregation Algorithm Based on the Dimension Hierarchical Encoding in Data Warehouse","authors":"Zhen-zhi Gong, Kong-fa Hu, Qingli Da","doi":"10.1109/CISIM.2007.4","DOIUrl":"https://doi.org/10.1109/CISIM.2007.4","url":null,"abstract":"The OLAP (on-line analytical processing) queries are ad hoc, complex aggregation queries on massive data set. How to effectively aggregate the query data becomes the key issue for OLAP query evaluation. To solve this problem, a novel grouping aggregation algorithm, DHEGA(grouping aggregation based on the dimension hierarchical encoding), is proposed in this paper. It utilizes the fairly short DHE(dimension hierarchical encoding) and its hierarchical prefix path, retrieves the matching dimension hierarchical encoding and evaluates the set of query ranges for each dimension rapidly. As a result, our algorithm significantly reduces the disk I/Os and improves the efficiency of OLAP queries. The analytical and experimental results demonstrate that DHEGA algorithm is highly efficient and outperforms all the previous approaches.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405531","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 proposes a new face recognition approach by using kernel principal component analysis (KPCA) and hierarchical radial basis function (HRBF) network classification model. To improve the quality of the face images, a series of image pre-processing techniques, which include histogram equalization, edge detection and geometrical transformation are used. The KPCA is employed to extract features for reducing the dimension of the face pattern, and the HRBF network is used to identify the faces. To accelerate the convergence of the HRBF network and improve the quality of the solutions, the extended compact genetic programming (ECGP) and particle swarm optimization (PSO) is applied to optimize the HRBF network structure and parameters. The experimental results show that the proposed framework is efficient for face recognition.
{"title":"Face Recognition Using Kernel PCA and Hierarchical RBF Network","authors":"Jin Zhou, Yang Liu, Yuehui Chen","doi":"10.1109/CISIM.2007.28","DOIUrl":"https://doi.org/10.1109/CISIM.2007.28","url":null,"abstract":"This paper proposes a new face recognition approach by using kernel principal component analysis (KPCA) and hierarchical radial basis function (HRBF) network classification model. To improve the quality of the face images, a series of image pre-processing techniques, which include histogram equalization, edge detection and geometrical transformation are used. The KPCA is employed to extract features for reducing the dimension of the face pattern, and the HRBF network is used to identify the faces. To accelerate the convergence of the HRBF network and improve the quality of the solutions, the extended compact genetic programming (ECGP) and particle swarm optimization (PSO) is applied to optimize the HRBF network structure and parameters. The experimental results show that the proposed framework is efficient for face recognition.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115307957","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 deals with the recognition task with a full probabilistic information. In this problem of recognition the Bayesian statistic is applied and multistage recognition is considered. The information on objects features is fuzzy-valued. The decision rules minimize the mean risk, that is the mean value of the zero-one loss function. The probability of misclassification for local optimal strategy and the difference between probability of misclassification for the fuzzy-valued and crisp data are presented. Simple example conclude the work and influence of the width of the fuzzy number on this difference is discussed.
{"title":"Fuzzy Data in Local Optimal Strategy of Multistage Recognition","authors":"R. Burduk","doi":"10.1109/CISIM.2007.33","DOIUrl":"https://doi.org/10.1109/CISIM.2007.33","url":null,"abstract":"The paper deals with the recognition task with a full probabilistic information. In this problem of recognition the Bayesian statistic is applied and multistage recognition is considered. The information on objects features is fuzzy-valued. The decision rules minimize the mean risk, that is the mean value of the zero-one loss function. The probability of misclassification for local optimal strategy and the difference between probability of misclassification for the fuzzy-valued and crisp data are presented. Simple example conclude the work and influence of the width of the fuzzy number on this difference is discussed.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126485132","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}
Cooperation between entities of different types is of major importance for the process of developing and implementing an innovation. The aim of the paper was to present results of research concerning cooperation of enterprises in the area of innovation with their suppliers and buyers, with other enterprises and with scientific institutions (institution carrying scientific research) as well as organizations dealing with transfer of innovations. The study using questionnaire covered 156 enterprises from the region of northeastern Poland, which declared introducing product and/or process innovations. The cooperation occurred most frequently within the chain of supplier-processor-buyer, which is consistent with the global trends. The cooperation was much more frequently undertaken by larger entities and it involved a wide range of partner institutions. Small and medium enterprises represent a low level of cooperation with innovation transfer institutions.
{"title":"Cooperation of Enterprises in the Area of Innovative Activity","authors":"A. Strychalska-Rudzewicz","doi":"10.1109/CISIM.2007.24","DOIUrl":"https://doi.org/10.1109/CISIM.2007.24","url":null,"abstract":"Cooperation between entities of different types is of major importance for the process of developing and implementing an innovation. The aim of the paper was to present results of research concerning cooperation of enterprises in the area of innovation with their suppliers and buyers, with other enterprises and with scientific institutions (institution carrying scientific research) as well as organizations dealing with transfer of innovations. The study using questionnaire covered 156 enterprises from the region of northeastern Poland, which declared introducing product and/or process innovations. The cooperation occurred most frequently within the chain of supplier-processor-buyer, which is consistent with the global trends. The cooperation was much more frequently undertaken by larger entities and it involved a wide range of partner institutions. Small and medium enterprises represent a low level of cooperation with innovation transfer institutions.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302144","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
扫码关注我们
求助内容：
应助结果提醒方式：