Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621586
K. Goczyła, A. Waloszek
During the development of semantic Web there emerged a need for creating semantic descriptions of large domains of interest. However, it turned out that the large size of ontologies containing such descriptions led to many negative effects. As a result, the topics of distributing ontologies and ontology modularization gained major importance. The purpose of this paper is to present a novel approach to describe semantics of modules in distributed ontologies. We categorize problems that are encountered while working with ontology modules and describe some of the best known methods of importing data from a source ontology to a target one. Then we describe our contextual framework that generalizes our approach to the contextualization. This framework introduces a hierarchy of contexts accompanied by a hierarchy of context instances. We show how such a structure helps to solve some crucial problems with modularization, like constraining visibility and avoiding inconsistencies or incoherencies.
{"title":"A distributed description of facts in a distributed Semantic Web ontology","authors":"K. Goczyła, A. Waloszek","doi":"10.1109/INFTECH.2008.4621586","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621586","url":null,"abstract":"During the development of semantic Web there emerged a need for creating semantic descriptions of large domains of interest. However, it turned out that the large size of ontologies containing such descriptions led to many negative effects. As a result, the topics of distributing ontologies and ontology modularization gained major importance. The purpose of this paper is to present a novel approach to describe semantics of modules in distributed ontologies. We categorize problems that are encountered while working with ontology modules and describe some of the best known methods of importing data from a source ontology to a target one. Then we describe our contextual framework that generalizes our approach to the contextualization. This framework introduces a hierarchy of contexts accompanied by a hierarchy of context instances. We show how such a structure helps to solve some crucial problems with modularization, like constraining visibility and avoiding inconsistencies or incoherencies.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759929","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621614
R. Leszczyna, I. N. Fovino, M. Masera
Critical infrastructures have become highly dependent on information and communication technology (ICT). The drawback of this situation is that the consequences of disturbances of the underlying ICT networks may be serious as cascading effects can occur. This raises a high demand for security assurance, with a high importance assigned to security evaluations. In this paper we present an experiment-centric approach for the characterisation and assessment of security threats to information systems of industrial critical infrastructures. The description of the approach is followed with a presentation of the supporting hardware and software architecture.
{"title":"Security evaluation of IT systems underlying critical networked infrastructures","authors":"R. Leszczyna, I. N. Fovino, M. Masera","doi":"10.1109/INFTECH.2008.4621614","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621614","url":null,"abstract":"Critical infrastructures have become highly dependent on information and communication technology (ICT). The drawback of this situation is that the consequences of disturbances of the underlying ICT networks may be serious as cascading effects can occur. This raises a high demand for security assurance, with a high importance assigned to security evaluations. In this paper we present an experiment-centric approach for the characterisation and assessment of security threats to information systems of industrial critical infrastructures. The description of the approach is followed with a presentation of the supporting hardware and software architecture.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125044412","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621652
R. Mazurek, H. Lasota
The paper undertakes underestimated problem of influence of the number and distribution of loudspeakers in speech reinforcement systems (SRS) on the quality of publicly addressed voice messages, namely the speech intelligibility in auditory rooms. Linear superposition of time-shifted broadband waves of the same form and slightly different magnitudes that reach a listener from numerous coherent sources, is accompanied by interference effects leading to a deep modification of the received signal waveform and, consequently, of its frequency spectrum. Signal transmission in a multisource SRS and distortion of fundamental voice elements (phonemes) have been simulated and analyzed with the use of linear time-invariant (LTI) model of multichannel communications system. Calculations have been made on the basis of impulse responses (IR) of modeled reverberation-less auditorium. MLS correlation measurements in a real- life lecture room have been performed as well, for verification of the SRS quality.
{"title":"Broadband interference in speech reinforcement systems","authors":"R. Mazurek, H. Lasota","doi":"10.1109/INFTECH.2008.4621652","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621652","url":null,"abstract":"The paper undertakes underestimated problem of influence of the number and distribution of loudspeakers in speech reinforcement systems (SRS) on the quality of publicly addressed voice messages, namely the speech intelligibility in auditory rooms. Linear superposition of time-shifted broadband waves of the same form and slightly different magnitudes that reach a listener from numerous coherent sources, is accompanied by interference effects leading to a deep modification of the received signal waveform and, consequently, of its frequency spectrum. Signal transmission in a multisource SRS and distortion of fundamental voice elements (phonemes) have been simulated and analyzed with the use of linear time-invariant (LTI) model of multichannel communications system. Calculations have been made on the basis of impulse responses (IR) of modeled reverberation-less auditorium. MLS correlation measurements in a real- life lecture room have been performed as well, for verification of the SRS quality.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131448407","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621584
C. Sanín, E. Szczerbicki, C. Toro
In this article, we introduce the necessary elements that must integrate a decisional technology that can offer trust and use them for the implementation of decisional trust systems. Thus, we refer to these elements as Decisional Trust, which can be achieved through the use of elements such as the Decisional DNA and the reflexive ontologies. Decisional Trust operates in two fronts: (i) the construction of Reflexive Ontologies as descriptions of concepts and relations with a set of self contained queries in a domain of study; and (ii) the construction of Decisional DNA as a knowledge structure capable of collecting organizationspsila decisional fingerprints. Our approach extends the use of Reflexive Ontologies and Decisional DNA with the aim of offering trustable decisions, and introduces elements for the exploitation of embedded trustable decisional knowledge. Fully developed, it would advance the notion of administering trustable knowledge in the current decision making environment.
{"title":"Towards a technology of trust: Decisional DNA and Reflexive Ontologies","authors":"C. Sanín, E. Szczerbicki, C. Toro","doi":"10.1109/INFTECH.2008.4621584","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621584","url":null,"abstract":"In this article, we introduce the necessary elements that must integrate a decisional technology that can offer trust and use them for the implementation of decisional trust systems. Thus, we refer to these elements as Decisional Trust, which can be achieved through the use of elements such as the Decisional DNA and the reflexive ontologies. Decisional Trust operates in two fronts: (i) the construction of Reflexive Ontologies as descriptions of concepts and relations with a set of self contained queries in a domain of study; and (ii) the construction of Decisional DNA as a knowledge structure capable of collecting organizationspsila decisional fingerprints. Our approach extends the use of Reflexive Ontologies and Decisional DNA with the aim of offering trustable decisions, and introduces elements for the exploitation of embedded trustable decisional knowledge. Fully developed, it would advance the notion of administering trustable knowledge in the current decision making environment.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131500643","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621640
P. Popescu, Sanda Osiceanu
The security of many cryptographic techniques depends on the intractability of the discrete logarithm problem (DLP). As a starting point, we consider the particular case of this problem, the discrete logarithm problem in subgroups of Zopfp* (p prime number), which is of special interest because its presumed intractability is the basis for the security of the U.S. Government NIST Digital Signature Algorithm, among other cryptographic techniques. Our intention is to generalize the discrete logarithm problem in subgroups of Zopfp*, first by considering an arbitrary finite cyclic group G, instead of Zopfp*; and then, more generally, by considering an arbitrary finite group G instead of Zopfp*. Then, following the same idea, we try to generalize a problem closely related to the DLP, the Diffie-Hellman problem (DHP), which is of significance to public-key cryptography because its apparent intractability forms the basis for the security of many cryptographic schemes, including Diffie-Hellman key agreement and its derivatives, and ElGamal public-key encryption. Our paper will give the mathematical description of the general problems, using group theory, as well as provide a mathematical algorithm for solving them.
{"title":"The discrete logarithm problem in cyclic subgroups of not necessary cyclic groups","authors":"P. Popescu, Sanda Osiceanu","doi":"10.1109/INFTECH.2008.4621640","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621640","url":null,"abstract":"The security of many cryptographic techniques depends on the intractability of the discrete logarithm problem (DLP). As a starting point, we consider the particular case of this problem, the discrete logarithm problem in subgroups of Zopfp* (p prime number), which is of special interest because its presumed intractability is the basis for the security of the U.S. Government NIST Digital Signature Algorithm, among other cryptographic techniques. Our intention is to generalize the discrete logarithm problem in subgroups of Zopfp*, first by considering an arbitrary finite cyclic group G, instead of Zopfp*; and then, more generally, by considering an arbitrary finite group G instead of Zopfp*. Then, following the same idea, we try to generalize a problem closely related to the DLP, the Diffie-Hellman problem (DHP), which is of significance to public-key cryptography because its apparent intractability forms the basis for the security of many cryptographic schemes, including Diffie-Hellman key agreement and its derivatives, and ElGamal public-key encryption. Our paper will give the mathematical description of the general problems, using group theory, as well as provide a mathematical algorithm for solving them.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"40 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132644114","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621620
Michał Sygnowski, B. Trawinski, Aleksander Zgrzywa
A Takagi-Sugeno-Kang type-1 fuzzy system to assist with real estate appraisals was developed with the aid of experts and comprised input variables relating to main attributes of a property being appraised. The rule bases of TSK zero-order fuzzy systems were generated using evolutionary algorithms. In order to reflect the uncertainty of available data, the type-1 fuzzy model was extended to the type-2 one using a singleton function as the second degree membership function. The comparative study of both models was carried out. The experiments were conducted using actual data.
{"title":"An attempt to use a type-2 fuzzy logic system to assist with real estate appraisals","authors":"Michał Sygnowski, B. Trawinski, Aleksander Zgrzywa","doi":"10.1109/INFTECH.2008.4621620","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621620","url":null,"abstract":"A Takagi-Sugeno-Kang type-1 fuzzy system to assist with real estate appraisals was developed with the aid of experts and comprised input variables relating to main attributes of a property being appraised. The rule bases of TSK zero-order fuzzy systems were generated using evolutionary algorithms. In order to reflect the uncertainty of available data, the type-1 fuzzy model was extended to the type-2 one using a singleton function as the second degree membership function. The comparative study of both models was carried out. The experiments were conducted using actual data.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132664569","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621646
L. Wrona
The family of pursuit and evasion problems is widely studied because of its numerous practical applications, ranging from communication protocols to cybernetic and physical security. Calculating the search number of a graph is one of most commonly analyzed members of this problem family. The search number is the smallest number of mobile agents required to capture an invisible and arbitrarily fast fugitive, for instance piece of malicious software, in a given graph. It is closely related to some other well known graph parameters, such as treewidth and pathwidth, and has been studied in a wide range of variants (edge, node, mixed, monotonous, connected, distributed, and others). Calculating the edge search number of a general graph is NP-hard, while it can be computed in linear time for trees. Calculating the search number of cacti, however, has not yet been widely covered. In this work we focus on this class of graphs, as it may be used to model token ring networks as well as some other network topologies when we assume that backup links are present. We address the problem of calculating the search number, as well as generating search strategy for cacti.
{"title":"Scanning networks with cactus topology","authors":"L. Wrona","doi":"10.1109/INFTECH.2008.4621646","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621646","url":null,"abstract":"The family of pursuit and evasion problems is widely studied because of its numerous practical applications, ranging from communication protocols to cybernetic and physical security. Calculating the search number of a graph is one of most commonly analyzed members of this problem family. The search number is the smallest number of mobile agents required to capture an invisible and arbitrarily fast fugitive, for instance piece of malicious software, in a given graph. It is closely related to some other well known graph parameters, such as treewidth and pathwidth, and has been studied in a wide range of variants (edge, node, mixed, monotonous, connected, distributed, and others). Calculating the edge search number of a general graph is NP-hard, while it can be computed in linear time for trees. Calculating the search number of cacti, however, has not yet been widely covered. In this work we focus on this class of graphs, as it may be used to model token ring networks as well as some other network topologies when we assume that backup links are present. We address the problem of calculating the search number, as well as generating search strategy for cacti.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134608747","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621654
G. Szwoch, P. Dalka
A system for automatic event detection in the camera image is presented in this paper. A method of limiting a region of interest to relevant parts of the image using a set of processing procedures is proposed. Image processing includes object detection with shadow removal performed in the modified YCbCr color space instead of RGB. The proposed procedures help to reduce the complexity of image processing algorithm and result in extraction of objects in the image that fulfill the imposed criteria. The selected objects may be then processed by the rule-based event detection system.
{"title":"Identification of regions of interest in video for a traffic monitoring system","authors":"G. Szwoch, P. Dalka","doi":"10.1109/INFTECH.2008.4621654","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621654","url":null,"abstract":"A system for automatic event detection in the camera image is presented in this paper. A method of limiting a region of interest to relevant parts of the image using a set of processing procedures is proposed. Image processing includes object detection with shadow removal performed in the modified YCbCr color space instead of RGB. The proposed procedures help to reduce the complexity of image processing algorithm and result in extraction of objects in the image that fulfill the imposed criteria. The selected objects may be then processed by the rule-based event detection system.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615213","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621596
Jerzy Konorski, Janusz Lis
It has been recognized in the past that selfish configuration of the TCP congestion avoidance mechanism can lead to aggressive usage of network resources by some packet flows at the cost of other flows. It can be imagined that with multiple selfishly configured TCP connections, a game similar to the prisonerspsila dilemma arises whose strategic equilibria may occur at various levels of network resource utilization, depending on the TCP version and traffic conditions. This paper focuses on the effects of selfish TCP configuration in realistic network environments. Of interest is the impact of selfish TCP configuration in large networks with multiple bottlenecks, and the possibility of configuring TCP so as to avoid being exploited by aggressive packet flows competing for the same resources. Quantitative results are presented based on a special-purpose simulator.
{"title":"Testing aggressive TCP configurations","authors":"Jerzy Konorski, Janusz Lis","doi":"10.1109/INFTECH.2008.4621596","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621596","url":null,"abstract":"It has been recognized in the past that selfish configuration of the TCP congestion avoidance mechanism can lead to aggressive usage of network resources by some packet flows at the cost of other flows. It can be imagined that with multiple selfishly configured TCP connections, a game similar to the prisonerspsila dilemma arises whose strategic equilibria may occur at various levels of network resource utilization, depending on the TCP version and traffic conditions. This paper focuses on the effects of selfish TCP configuration in realistic network environments. Of interest is the impact of selfish TCP configuration in large networks with multiple bottlenecks, and the possibility of configuring TCP so as to avoid being exploited by aggressive packet flows competing for the same resources. Quantitative results are presented based on a special-purpose simulator.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132055756","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 : 2008-05-18DOI: 10.1109/INFTECH.2008.4621693
L. Hasse, J. Smulko
Resonant spectroscopy is an effective nondestructive testing method focused on defects in tested objects. The testing procedure, based on the resonant pattern, allows rejection of the tested samples with defects which do not fit the pattern. A sweeping frequency method has been used to measure the spectrum of resonances in high-voltage varistors. As a result we can observe resonances that depend directly on inhomogeneity of the object. A few hundreds of high-voltage varistors have been measured using resonant ultrasonic spectroscopy. The shift to a lower frequency caused by the defected material has been observed and this can be the basis for rejecting the defective parts during manufacturing process. The parameter Q relating to the homogeneity of the varistor structure has been proposed as a criterion for the ldquogo- no gordquo testing.
{"title":"Resonant ultrasonic spectroscopy in high-voltage varistor diagnostics","authors":"L. Hasse, J. Smulko","doi":"10.1109/INFTECH.2008.4621693","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621693","url":null,"abstract":"Resonant spectroscopy is an effective nondestructive testing method focused on defects in tested objects. The testing procedure, based on the resonant pattern, allows rejection of the tested samples with defects which do not fit the pattern. A sweeping frequency method has been used to measure the spectrum of resonances in high-voltage varistors. As a result we can observe resonances that depend directly on inhomogeneity of the object. A few hundreds of high-voltage varistors have been measured using resonant ultrasonic spectroscopy. The shift to a lower frequency caused by the defected material has been observed and this can be the basis for rejecting the defective parts during manufacturing process. The parameter Q relating to the homogeneity of the varistor structure has been proposed as a criterion for the ldquogo- no gordquo testing.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114525118","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
扫码关注我们
求助内容：
应助结果提醒方式：