Knowledge is currently treated as one of the most important resources of the organization. During the time of global economy, conducted on the strongly competitive market and in conditions of turbulent changes in the surrounding, it is the knowledge which is becoming an important factor determining the position on the market, opportunities of its development, multipling capital, and the same the worth of the enterprise. Hence the knowledge, or more - the intellectual capital of enterprises - have become the basic component of the worth of enterprise valuation. The article includes the try of the synthesis of the problems connected with the knowledge measurement in an organization, critical analysis of the measurement methods described in the literature. The measurement here is widely understood, as various procedures which are supposed to deliver information on the size of the knowledge resources, the kind of the knowledge, the usage of it in the realization of the organization aims.
{"title":"Organizational Knowledge Measurement","authors":"Joanna Moczydlowska","doi":"10.1109/CISIM.2007.54","DOIUrl":"https://doi.org/10.1109/CISIM.2007.54","url":null,"abstract":"Knowledge is currently treated as one of the most important resources of the organization. During the time of global economy, conducted on the strongly competitive market and in conditions of turbulent changes in the surrounding, it is the knowledge which is becoming an important factor determining the position on the market, opportunities of its development, multipling capital, and the same the worth of the enterprise. Hence the knowledge, or more - the intellectual capital of enterprises - have become the basic component of the worth of enterprise valuation. The article includes the try of the synthesis of the problems connected with the knowledge measurement in an organization, critical analysis of the measurement methods described in the literature. The measurement here is widely understood, as various procedures which are supposed to deliver information on the size of the knowledge resources, the kind of the knowledge, the usage of it in the realization of the organization aims.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"27 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":"115137487","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 a new type of GIS system for maritime navigation safety is proposed. The system takes advantage of the properties of the kinetic Voronoi diagram, and uses the "quad-edge" data structure for the real-time maintenance of the spatial relationships of ships and other navigational objects. The locations of ships are updated using a standard onboard AIS transponder, and moving-points Voronoi algorithms. The spatial relationships are used for collision detection and avoidance. The system is aimed at tackling the main cause of marine accidents - human errors - by providing navigational aid and decision support to navigators. The brief introduction into static and kinematic Voronoi methods is given and is followed by the discussion of different types of GIS systems for marine purposes. The state-of-the-art in maritime safety and its major developments are also covered.
{"title":"Application of the Kinetic Voronoi Diagram to the Real-Time Navigation of Marine Vessels","authors":"R. Goralski, C. Gold, M. Dakowicz","doi":"10.1109/CISIM.2007.13","DOIUrl":"https://doi.org/10.1109/CISIM.2007.13","url":null,"abstract":"In this paper a new type of GIS system for maritime navigation safety is proposed. The system takes advantage of the properties of the kinetic Voronoi diagram, and uses the \"quad-edge\" data structure for the real-time maintenance of the spatial relationships of ships and other navigational objects. The locations of ships are updated using a standard onboard AIS transponder, and moving-points Voronoi algorithms. The spatial relationships are used for collision detection and avoidance. The system is aimed at tackling the main cause of marine accidents - human errors - by providing navigational aid and decision support to navigators. The brief introduction into static and kinematic Voronoi methods is given and is followed by the discussion of different types of GIS systems for marine purposes. The state-of-the-art in maritime safety and its major developments are also covered.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"27 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":"121786710","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 deal with the problem of the finite states machine's (FSM) state assignment. CMOS- based digital circuits dissipate a power only during a transition at the output. Therefore one of the methods of the power minimization is to reassign the FSM states. We discuss the methods such as column-based and annealing-based as well as propose the new method called sequential method. Experimental results showed that the proposed method is approximately 10% better than the other discussed algorithms.
{"title":"FSM State Assignment Methods for Low-Power Design","authors":"V. Salauyou, T. Grzes","doi":"10.1109/CISIM.2007.32","DOIUrl":"https://doi.org/10.1109/CISIM.2007.32","url":null,"abstract":"In this paper we deal with the problem of the finite states machine's (FSM) state assignment. CMOS- based digital circuits dissipate a power only during a transition at the output. Therefore one of the methods of the power minimization is to reassign the FSM states. We discuss the methods such as column-based and annealing-based as well as propose the new method called sequential method. Experimental results showed that the proposed method is approximately 10% better than the other discussed algorithms.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"49 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":"124246998","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 the paper, we introduce a mobile software agent-based scheme for digital rights management targeted for personal mobile devices. The goal of the proposed scheme is to provide a solution secure yet simple to implement and maintain for controlled consumption of digital media objects. In order to protect the digital content in transport and to prevent non-authorized use, we apply a combination of a threshold scheme, one-time password system, key agreement protocol, and clueless mobile agents. Here, every participating software agent receives a share from a dealer and only the end user is able to decrypt the DRM content after gathering all the shares. Clueless mobile agents traveling between the participants' sites do the distribution and the gathering of the shares. The proposed DRM scheme is compared to the industry-leading Open Mobile Alliance's digital rights management specification and their applicability and the differences are thoroughly discussed. Finally, we evaluate the weaknesses of the scheme and propose few variants satisfying different security requirements.
{"title":"Mobile Agent-Based Digital Rights Management Scheme","authors":"B. Ziólkowski, J. Stoklosa","doi":"10.1109/CISIM.2007.48","DOIUrl":"https://doi.org/10.1109/CISIM.2007.48","url":null,"abstract":"In the paper, we introduce a mobile software agent-based scheme for digital rights management targeted for personal mobile devices. The goal of the proposed scheme is to provide a solution secure yet simple to implement and maintain for controlled consumption of digital media objects. In order to protect the digital content in transport and to prevent non-authorized use, we apply a combination of a threshold scheme, one-time password system, key agreement protocol, and clueless mobile agents. Here, every participating software agent receives a share from a dealer and only the end user is able to decrypt the DRM content after gathering all the shares. Clueless mobile agents traveling between the participants' sites do the distribution and the gathering of the shares. The proposed DRM scheme is compared to the industry-leading Open Mobile Alliance's digital rights management specification and their applicability and the differences are thoroughly discussed. Finally, we evaluate the weaknesses of the scheme and propose few variants satisfying different security requirements.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"24 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":"121030778","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}
Efficiency of the B-Cell algorithm applied to one of the well-known test-case generators, the moving peaks benchmark (MPB) is a subject of study presented in this paper. We especially focused on the family of fitness landscapes generated by scenario 2 of the MPB. All of them represent the class of randomly changing environments. Some properties of the algorithm as well as the properties of the environments created by the generator MPB are discussed. A side effect of modification of one of the control parameters and its influence on the offline error measure is presented.
{"title":"B-Cell Algorithm as a Parallel Approach to Optimization of Moving Peaks Benchmark Tasks","authors":"K. Trojanowski","doi":"10.1109/CISIM.2007.17","DOIUrl":"https://doi.org/10.1109/CISIM.2007.17","url":null,"abstract":"Efficiency of the B-Cell algorithm applied to one of the well-known test-case generators, the moving peaks benchmark (MPB) is a subject of study presented in this paper. We especially focused on the family of fitness landscapes generated by scenario 2 of the MPB. All of them represent the class of randomly changing environments. Some properties of the algorithm as well as the properties of the environments created by the generator MPB are discussed. A side effect of modification of one of the control parameters and its influence on the offline error measure is presented.","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":"127349128","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}
P. Moravec, V. Snás̃el, A. Frolov, D. Húsek, H. Řezanková, Pavel Polyakov
In this paper, we compare performance of several dimension reduction techniques, namely LSI, NMF, SDD, Boolean factor analysis, and cluster analysis. The qualitative comparison is evaluated on a collection of bars. We compare the quality of these methods from on the base of the visual impact.
{"title":"Image Analysis by Methods of Dimension Reduction","authors":"P. Moravec, V. Snás̃el, A. Frolov, D. Húsek, H. Řezanková, Pavel Polyakov","doi":"10.1109/CISIM.2007.39","DOIUrl":"https://doi.org/10.1109/CISIM.2007.39","url":null,"abstract":"In this paper, we compare performance of several dimension reduction techniques, namely LSI, NMF, SDD, Boolean factor analysis, and cluster analysis. The qualitative comparison is evaluated on a collection of bars. We compare the quality of these methods from on the base of the visual impact.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"1373 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":"127438844","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 main goal of this paper is to introduce a model of intelligent behavior in pedestrian dynamics using cellular automata. Authors take into account classical situation of large room evacuation, where several exits are available. Presented model includes some criteria of making decisions by a particular pedestrian. Proposed criteria are: distance to all exits, density of crowd in each exit neighborhood, throughput of particular exit and following the other persons.
{"title":"Some Criteria of Making Decisions in Pedestrian Evacuation Algorithms","authors":"Bartlomiej Gudowski, Jarosław Wąs","doi":"10.1109/CISIM.2007.61","DOIUrl":"https://doi.org/10.1109/CISIM.2007.61","url":null,"abstract":"The main goal of this paper is to introduce a model of intelligent behavior in pedestrian dynamics using cellular automata. Authors take into account classical situation of large room evacuation, where several exits are available. Presented model includes some criteria of making decisions by a particular pedestrian. Proposed criteria are: distance to all exits, density of crowd in each exit neighborhood, throughput of particular exit and following the other persons.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"3 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":"125119648","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 standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving signature scheme. In this paper, we study key-evolving signature within the UC framework and propose an appropriate ideal functionality that captures the basic security requirements of key-evolving signature. Then, we present a generic way to transform a key-evolving signature scheme into a real-life protocol. Finally, we show that UC definition of security is equivalent to previous definition of security which is termed as EUF-ACMA security.
{"title":"Universally Composable Key-Evolving Signature","authors":"Jin Zhou, Yuefei Zhu, TingMao Chang, YaJuan Zhang","doi":"10.1109/CISIM.2007.70","DOIUrl":"https://doi.org/10.1109/CISIM.2007.70","url":null,"abstract":"The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving signature scheme. In this paper, we study key-evolving signature within the UC framework and propose an appropriate ideal functionality that captures the basic security requirements of key-evolving signature. Then, we present a generic way to transform a key-evolving signature scheme into a real-life protocol. Finally, we show that UC definition of security is equivalent to previous definition of security which is termed as EUF-ACMA security.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"8 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":"114511375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Kilon, Aida Saeed-Baginska, J. Sienkiewicz, R. Mosdorf
This work presents the use of nonlinear analysis for the daily meteorological data from Bialystok, Poland. The analysis is based both on daily temperature and rainfall fluctuation data. The data for the period of 43 years (1964-2006) have been analyzed. The temperature and rainfall fluctuation frequency in Bialystok has been analyzed using Fourier transform and the wavelet power spectrum, as well as fractal analysis, including attractor reconstruction, calculation of the correlation dimension and the largest Lyapunov exponent. The analysis allows us to identify short, medium and long-term cycles both for the temperature and rainfall data. As a result of attractor reconstruction made on the temperature data the 3D torus was obtained. It has been shown, that the correlation dimension D2 as well as the largest Lyapunov exponent varies in time. The parameters mentioned above increase rapidly in years when more medium-term cycles of temperature fluctuation are identified. The maximum period of the believable weather forecast has been also shown. It varies from 5 to 20 days in the analyzed years.
{"title":"Nonlinear and Frequency Analysis of the Weather in Bialystok","authors":"J. Kilon, Aida Saeed-Baginska, J. Sienkiewicz, R. Mosdorf","doi":"10.1109/CISIM.2007.50","DOIUrl":"https://doi.org/10.1109/CISIM.2007.50","url":null,"abstract":"This work presents the use of nonlinear analysis for the daily meteorological data from Bialystok, Poland. The analysis is based both on daily temperature and rainfall fluctuation data. The data for the period of 43 years (1964-2006) have been analyzed. The temperature and rainfall fluctuation frequency in Bialystok has been analyzed using Fourier transform and the wavelet power spectrum, as well as fractal analysis, including attractor reconstruction, calculation of the correlation dimension and the largest Lyapunov exponent. The analysis allows us to identify short, medium and long-term cycles both for the temperature and rainfall data. As a result of attractor reconstruction made on the temperature data the 3D torus was obtained. It has been shown, that the correlation dimension D2 as well as the largest Lyapunov exponent varies in time. The parameters mentioned above increase rapidly in years when more medium-term cycles of temperature fluctuation are identified. The maximum period of the believable weather forecast has been also shown. It varies from 5 to 20 days in the analyzed years.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"329 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":"123332897","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 apply Toeplitz matrices minimal eigenvalues approach to represent two-dimensional images. The problem of moving object identification is considered on an example and some theoretical results are derived.
{"title":"On Toeplitz Matrices Minimal Eigenvalues in Moving Object Description","authors":"K. Saeed, K. Piekarski","doi":"10.1109/CISIM.2007.53","DOIUrl":"https://doi.org/10.1109/CISIM.2007.53","url":null,"abstract":"In this paper we apply Toeplitz matrices minimal eigenvalues approach to represent two-dimensional images. The problem of moving object identification is considered on an example and some theoretical results are derived.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"13 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":"123467858","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
扫码关注我们
求助内容：
应助结果提醒方式：