We propose a novel real-time affect classification system based on features extracted from the acoustic speech signal. The proposed system analyses the speech signal and provides a real-time classification of the speaker's perceived affective state. A neural network is trained and tested using a database of 391 authentic emotional utterances from 11 speakers. Two emotions, anger and neutral, are considered. The system is designed to be speaker and text-independent and is to be deployed in a call-centre environment to assist in the handling of customer inquiries. We achieve a success rate of 80.1% accuracy in our preliminary results.
{"title":"Real-time spoken affect classification and its application in call-centres","authors":"Donn Morrison, Ruili Wang, L. D. Silva, W. L. Xu","doi":"10.1109/ICITA.2005.231","DOIUrl":"https://doi.org/10.1109/ICITA.2005.231","url":null,"abstract":"We propose a novel real-time affect classification system based on features extracted from the acoustic speech signal. The proposed system analyses the speech signal and provides a real-time classification of the speaker's perceived affective state. A neural network is trained and tested using a database of 391 authentic emotional utterances from 11 speakers. Two emotions, anger and neutral, are considered. The system is designed to be speaker and text-independent and is to be deployed in a call-centre environment to assist in the handling of customer inquiries. We achieve a success rate of 80.1% accuracy in our preliminary results.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368588","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}
Velocity filtering is a means of detecting weak point targets in imagery sequences. Pixel intensity is accumulated under an assumed target velocity and detection is predicated upon this cumulative intensity. However the unknown target velocity necessitates implementation of an entire bank of velocity filters, which requires dedicated hardware in order to be feasible. This paper describes some heuristic search methods which may be used to facilitate implementation of velocity filtering on a sequential computer. Criteria for ordering a pixel-first search through the candidate space are described. A best-first paradigm is also suggested as an alternative to pixel-first search. Monte-Carlo simulations show that both approaches are more efficient and yield better results than an arbitrary-order search of the candidate space.
{"title":"Implementation of velocity filtering for sequential architectures","authors":"S. Searle","doi":"10.1109/ICITA.2005.157","DOIUrl":"https://doi.org/10.1109/ICITA.2005.157","url":null,"abstract":"Velocity filtering is a means of detecting weak point targets in imagery sequences. Pixel intensity is accumulated under an assumed target velocity and detection is predicated upon this cumulative intensity. However the unknown target velocity necessitates implementation of an entire bank of velocity filters, which requires dedicated hardware in order to be feasible. This paper describes some heuristic search methods which may be used to facilitate implementation of velocity filtering on a sequential computer. Criteria for ordering a pixel-first search through the candidate space are described. A best-first paradigm is also suggested as an alternative to pixel-first search. Monte-Carlo simulations show that both approaches are more efficient and yield better results than an arbitrary-order search of the candidate space.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128500746","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}
Decision tree is one of the most widely used and practical methods in the data mining and machine learning discipline. However, many discretization algorithms developed in this field focus on univariate only, which is inadequate to handle the critical problems especially owned by medical domain. In this paper, we propose a new multivariate discretization method called multivariate interdependent discretization for continuous attributes - MIDCA. Our novel algorithm can minimize the uncertainty between the interdependent attribute and the continuous-valued attribute, and at the same time to maximize their correlation. The empirical results demonstrate a comparison of performance of various decision tree algorithms on twelve real-life datasets from UCI repository.
{"title":"Multivariate interdependent discretization for continuous attribute","authors":"S. Chao, Yiping Li","doi":"10.1109/ICITA.2005.188","DOIUrl":"https://doi.org/10.1109/ICITA.2005.188","url":null,"abstract":"Decision tree is one of the most widely used and practical methods in the data mining and machine learning discipline. However, many discretization algorithms developed in this field focus on univariate only, which is inadequate to handle the critical problems especially owned by medical domain. In this paper, we propose a new multivariate discretization method called multivariate interdependent discretization for continuous attributes - MIDCA. Our novel algorithm can minimize the uncertainty between the interdependent attribute and the continuous-valued attribute, and at the same time to maximize their correlation. The empirical results demonstrate a comparison of performance of various decision tree algorithms on twelve real-life datasets from UCI repository.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128751164","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}
Most of the existing commercial NIDS products are signature-based but not adaptive. In this paper, an adaptive NIDS using data mining technology is developed. Data mining approaches are used to accurately capture the actual behavior of network traffic, and portfolio mined is useful for differentiating "normal" and "attack" traffics. On the other hand, most of the current researches are using only one engine for detection of various attacks; the proposed system is constructed by a number of agents, which are totally different in both training and detecting processes. Each of the agents has its own strength on capturing a kind of network behavior and hence the system has strength on detecting different types of attack. In addition, its ability on detecting new types of attack as well as a higher tolerant to fluctuations were shown. The experimental results showed that the frequent patterns mined from the audit data could be used as reliable agents, which outperformed from traditional signature-based NIDS.
{"title":"Agent-based network intrusion detection system using data mining approaches","authors":"Cheung-Leung Lui, Tak-Chung Fu, Ting-Yee Cheung","doi":"10.1109/ICITA.2005.57","DOIUrl":"https://doi.org/10.1109/ICITA.2005.57","url":null,"abstract":"Most of the existing commercial NIDS products are signature-based but not adaptive. In this paper, an adaptive NIDS using data mining technology is developed. Data mining approaches are used to accurately capture the actual behavior of network traffic, and portfolio mined is useful for differentiating \"normal\" and \"attack\" traffics. On the other hand, most of the current researches are using only one engine for detection of various attacks; the proposed system is constructed by a number of agents, which are totally different in both training and detecting processes. Each of the agents has its own strength on capturing a kind of network behavior and hence the system has strength on detecting different types of attack. In addition, its ability on detecting new types of attack as well as a higher tolerant to fluctuations were shown. The experimental results showed that the frequent patterns mined from the audit data could be used as reliable agents, which outperformed from traditional signature-based NIDS.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128759068","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}
Using ant algorithm, robot path planning in two-dimension environment is studied. It introduces the intelligent finding optimum mechanism of ant colony. It solves the drawback of local optimization and expedites searching speed. The mathematical model is established and the algorithm is achieved with VB language, the result shows it is valid with the capability of robust and extensibility
{"title":"The Ant Algorithm for Solving Robot Path Planning Problem","authors":"Gengqian Liu, Tiejun Li, Yuqing Peng, Xiangdan Hou","doi":"10.1109/ICITA.2005.268","DOIUrl":"https://doi.org/10.1109/ICITA.2005.268","url":null,"abstract":"Using ant algorithm, robot path planning in two-dimension environment is studied. It introduces the intelligent finding optimum mechanism of ant colony. It solves the drawback of local optimization and expedites searching speed. The mathematical model is established and the algorithm is achieved with VB language, the result shows it is valid with the capability of robust and extensibility","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"463 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115921845","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}
A re-ranking technique, called "PageRank", brings a successful story behind the Googletrade search engine. Many studies focus on finding an efficient way to compute the PageRank scores of a large web graph. Researchers propose to compute them sequentially by reducing the I/O cost of disk access, improving the convergence rate, or even employing peer-2-peer architecture, etc. However, only a few concentrate on computation using parallel processing techniques. In this paper, we propose a partition-based parallel PageRank algorithm that can efficiently be run on a low-cost parallel environment like PC cluster. For comparison, we also study other two well-known PageRank techniques, and provide an analytical discussion of their performance in terms of I/O and synchronization cost, as well as memory usage. Experimental results show a promising improvement on a large artificial web graph synthesized from the TH domain
{"title":"Partition-Based Parallel PageRank Algorithm","authors":"A. Rungsawang, Bundit Manaskasemsak","doi":"10.1109/ICITA.2005.207","DOIUrl":"https://doi.org/10.1109/ICITA.2005.207","url":null,"abstract":"A re-ranking technique, called \"PageRank\", brings a successful story behind the Googletrade search engine. Many studies focus on finding an efficient way to compute the PageRank scores of a large web graph. Researchers propose to compute them sequentially by reducing the I/O cost of disk access, improving the convergence rate, or even employing peer-2-peer architecture, etc. However, only a few concentrate on computation using parallel processing techniques. In this paper, we propose a partition-based parallel PageRank algorithm that can efficiently be run on a low-cost parallel environment like PC cluster. For comparison, we also study other two well-known PageRank techniques, and provide an analytical discussion of their performance in terms of I/O and synchronization cost, as well as memory usage. Experimental results show a promising improvement on a large artificial web graph synthesized from the TH domain","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"791 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758911","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}
Security protocols are indispensable in secure communication. We give an operational semantics of security protocols in terms of a Prolog-like language. With this semantics, we can uncover attacks on a security protocol that are possible with no more than a given number of rounds. Though our approach is exhaustive testing, the majority of fruitless search is cut off by selecting a small number of representative values that could be sent by an attacker. Hence, the number of scenarios is relatively small and our method is quite practical. Furthermore, our method not only reports possible attacks but also describes the attacks in great detail. This description would be very helpful to protocol designers and analyzers.
{"title":"Uncovering attacks on security protocols","authors":"Wuu Yang","doi":"10.1109/ICITA.2005.292","DOIUrl":"https://doi.org/10.1109/ICITA.2005.292","url":null,"abstract":"Security protocols are indispensable in secure communication. We give an operational semantics of security protocols in terms of a Prolog-like language. With this semantics, we can uncover attacks on a security protocol that are possible with no more than a given number of rounds. Though our approach is exhaustive testing, the majority of fruitless search is cut off by selecting a small number of representative values that could be sent by an attacker. Hence, the number of scenarios is relatively small and our method is quite practical. Furthermore, our method not only reports possible attacks but also describes the attacks in great detail. This description would be very helpful to protocol designers and analyzers.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115231031","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 Web is a universal space where a huge amount of information is daily published. Digital archives (DA) constitute a valuable documentary domain to be propagated through the Web. But the virtual integration of Web heterogeneous data sources is a difficult task nowadays. This paper deals with the semantic integration of many specific DA ontologies. Beforehand, we have proposed a virtual and dynamic Web integrated architecture, based on mediator and wrapper layers. This paper is focused on a unified DA ontological proposal allocated at the mediator layer. Coming from the ISAD(G) and ISAAR(CPF) International Archival standards, two specific archival ontologies: ISAD-0 and ISAAR-0 are introduced. Besides, we have built the integrated parliamentary management system, SIAPI (successfully running at the Asamblea of Madrid since 1999) that contains a powerful parliamentary archive system. From it, we have built the SIAP-0 specific parliamentary archive ontology. Above all these ontologies, a global ontological kernel (GOK) is here introduced. The GOK, as a unifying umbrella, provides the attachment of many pre-existing specific DA ontologies. In the future, this GOK will make possible that the user query will be firstly pre-processed against to a personalized ontology, inferred from the GOK and tailored to each Web user preference's profile.
{"title":"Towards a Web digital archive ontological unification","authors":"Juan P. Palacios, J. Cremades, Carmen Costilla","doi":"10.1109/ICITA.2005.289","DOIUrl":"https://doi.org/10.1109/ICITA.2005.289","url":null,"abstract":"The Web is a universal space where a huge amount of information is daily published. Digital archives (DA) constitute a valuable documentary domain to be propagated through the Web. But the virtual integration of Web heterogeneous data sources is a difficult task nowadays. This paper deals with the semantic integration of many specific DA ontologies. Beforehand, we have proposed a virtual and dynamic Web integrated architecture, based on mediator and wrapper layers. This paper is focused on a unified DA ontological proposal allocated at the mediator layer. Coming from the ISAD(G) and ISAAR(CPF) International Archival standards, two specific archival ontologies: ISAD-0 and ISAAR-0 are introduced. Besides, we have built the integrated parliamentary management system, SIAPI (successfully running at the Asamblea of Madrid since 1999) that contains a powerful parliamentary archive system. From it, we have built the SIAP-0 specific parliamentary archive ontology. Above all these ontologies, a global ontological kernel (GOK) is here introduced. The GOK, as a unifying umbrella, provides the attachment of many pre-existing specific DA ontologies. In the future, this GOK will make possible that the user query will be firstly pre-processed against to a personalized ontology, inferred from the GOK and tailored to each Web user preference's profile.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114899704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents innovative manufacturing and control procedures applied in the design, construction and operation, of a mobile hydraulic press machine (RoboPress). The research demonstrates how the design of an automated mobile manufacturing system can be optimized through using qualitative modeling and simulation from artificial intelligence
{"title":"\"RoboPress\" — An Automated Mobile Press for Manufacturing Concrete Products","authors":"G. Adam, E. Grant, Gordon K. Lee","doi":"10.1109/ICITA.2005.2","DOIUrl":"https://doi.org/10.1109/ICITA.2005.2","url":null,"abstract":"This paper presents innovative manufacturing and control procedures applied in the design, construction and operation, of a mobile hydraulic press machine (RoboPress). The research demonstrates how the design of an automated mobile manufacturing system can be optimized through using qualitative modeling and simulation from artificial intelligence","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125379532","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 introduces E-DM, a QoS-enabled storage service schedule system, which provides performance virtualization in shared storage environment. It uses EPYFQ scheduling algorithm to schedule requests from virtual disks according to their shares, and can satisfy the following three requirements demanded by performance virtualization, performance isolation, fairness and throughput. We also evaluate E-DM from the above three aspects. Our results show that E-DM has good ability of performance isolation and fairness. Besides, we can adjust the tradeoff between tight resource control and throughput of storage system through the parameter epsiv
{"title":"E-DM: A QoS-Enabled Storage Service Schedule System in Shared Storage Environment","authors":"Yong Feng, Yan-yuan Zhang","doi":"10.1109/ICITA.2005.121","DOIUrl":"https://doi.org/10.1109/ICITA.2005.121","url":null,"abstract":"This paper introduces E-DM, a QoS-enabled storage service schedule system, which provides performance virtualization in shared storage environment. It uses EPYFQ scheduling algorithm to schedule requests from virtual disks according to their shares, and can satisfy the following three requirements demanded by performance virtualization, performance isolation, fairness and throughput. We also evaluate E-DM from the above three aspects. Our results show that E-DM has good ability of performance isolation and fairness. Besides, we can adjust the tradeoff between tight resource control and throughput of storage system through the parameter epsiv","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126110663","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
扫码关注我们
求助内容：
应助结果提醒方式：