Many job applications on the Web provide only simple Boolean comparison using only basic information requirements (i.e., degree, age) for searching and matching jobs to candidates. The net effect is too many 'hits'. We showed that personality is an important factor for the hiring process and satisfaction of employers and employees. In designing better filters for searching and matching a job application on the Web, we considered this factor with general job requirements and then combined it with our matching process. We have tested our model using data obtained from applicants who applied for jobs with a company in Thailand. The results show that we are able to give a better match than that achieved using basic qualifications only.
{"title":"Recruitment filtering with personality-job fit model","authors":"Surattana Supjarerndee, Yaowadee Temtanapat, Utomporn Phalavonk","doi":"10.1109/ITCC.2002.1000358","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000358","url":null,"abstract":"Many job applications on the Web provide only simple Boolean comparison using only basic information requirements (i.e., degree, age) for searching and matching jobs to candidates. The net effect is too many 'hits'. We showed that personality is an important factor for the hiring process and satisfaction of employers and employees. In designing better filters for searching and matching a job application on the Web, we considered this factor with general job requirements and then combined it with our matching process. We have tested our model using data obtained from applicants who applied for jobs with a company in Thailand. The results show that we are able to give a better match than that achieved using basic qualifications only.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134045281","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000361
Anthony G. Nguyen, Jenq-Neng Hwang
We present a Smooth Pursuit Eye Movement (SPEM) coding scheme to control the encoder generated variable bit rate (VBR) data over a constant bit rate (CBR) channel for real-time streaming video applications. This proposed rate control integrates both frame and block layer rate control to regulate the bit rate using the combination of feedforward control, feedbackward control, and model-based approaches together with characteristics of human visual perception. As a result, our proposed SPEM rate control method encodes the video sequence with less frame skipping and with higher encoded video quality compared to TMN8, which is currently implemented in the UBC H263+ codec.
{"title":"SPEM online rate control for realtime streaming video","authors":"Anthony G. Nguyen, Jenq-Neng Hwang","doi":"10.1109/ITCC.2002.1000361","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000361","url":null,"abstract":"We present a Smooth Pursuit Eye Movement (SPEM) coding scheme to control the encoder generated variable bit rate (VBR) data over a constant bit rate (CBR) channel for real-time streaming video applications. This proposed rate control integrates both frame and block layer rate control to regulate the bit rate using the combination of feedforward control, feedbackward control, and model-based approaches together with characteristics of human visual perception. As a result, our proposed SPEM rate control method encodes the video sequence with less frame skipping and with higher encoded video quality compared to TMN8, which is currently implemented in the UBC H263+ codec.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116123932","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000371
M. Sharifi, M. Fathy, M. Mahmoudi
Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. This paper introduces a new classification of most important and commonly used edge detection algorithms, namely ISEF, Canny, Marr-Hildreth, Sobel, Kirsch, Lapla1 and Lapla2. Five categories are included in our classification, and then advantages and disadvantages of some available algorithms within this category are discussed. A representative group containing the above seven algorithms are the implemented in C++ and compared subjectively, using 30 images out of 100 images. Two sets of images resulting from the application of those algorithms are then presented. It is shown that under noisy conditions, ISEF, Canny, Marr-Hildreth, Kirsch, Sobel, Lapla2, Lapla1 exhibit better performance, respectively.
{"title":"A classified and comparative study of edge detection algorithms","authors":"M. Sharifi, M. Fathy, M. Mahmoudi","doi":"10.1109/ITCC.2002.1000371","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000371","url":null,"abstract":"Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. This paper introduces a new classification of most important and commonly used edge detection algorithms, namely ISEF, Canny, Marr-Hildreth, Sobel, Kirsch, Lapla1 and Lapla2. Five categories are included in our classification, and then advantages and disadvantages of some available algorithms within this category are discussed. A representative group containing the above seven algorithms are the implemented in C++ and compared subjectively, using 30 images out of 100 images. Two sets of images resulting from the application of those algorithms are then presented. It is shown that under noisy conditions, ISEF, Canny, Marr-Hildreth, Kirsch, Sobel, Lapla2, Lapla1 exhibit better performance, respectively.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124483437","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000404
F. Furfaro
Recent research has investigated the problem of querying semi-structured data and data which can be represented by means of graphs (e.g. object-oriented data, XML data, etc.). Typically queries on graph-like data, called path queries, are expressed by means of regular expressions denoting paths in the graph. The result of a path query is the set of nodes reachable by means of a path expressed by a specified regular expression. In this paper we investigate the problem of extracting a subgraph satisfying a given property from a given graph representing some information. We propose a new form of queries, called graph queries, whose answers are (marked) graphs having a particular structure, extracted from the source graph. We show that a simple form of graph grammar can be profitably used to define graph queries. The result of a graph query, using a grammar G over a database D, is a subgraph of D 'matching' a graph derived from G.
{"title":"Querying semi-structured data with graph grammars","authors":"F. Furfaro","doi":"10.1109/ITCC.2002.1000404","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000404","url":null,"abstract":"Recent research has investigated the problem of querying semi-structured data and data which can be represented by means of graphs (e.g. object-oriented data, XML data, etc.). Typically queries on graph-like data, called path queries, are expressed by means of regular expressions denoting paths in the graph. The result of a path query is the set of nodes reachable by means of a path expressed by a specified regular expression. In this paper we investigate the problem of extracting a subgraph satisfying a given property from a given graph representing some information. We propose a new form of queries, called graph queries, whose answers are (marked) graphs having a particular structure, extracted from the source graph. We show that a simple form of graph grammar can be profitably used to define graph queries. The result of a graph query, using a grammar G over a database D, is a subgraph of D 'matching' a graph derived from G.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122488596","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000442
Gaurang Pateland, M. Tabrizi
In this paper, we present the development of a multimedia system for the real-time delivery of online courses. The system provides the instructor with a real-life environment to teach in a manner similar to a classroom. The instructor's video, audio, hand-writing, drawing and slide presentations are synchronized and streamed, and at the same time the students can view the lectures online in a simulated classroom environment. One of the main strengths of this system is that the instructor's lectures can be archived for future usage by the students. The students can interrupt the teacher and are also given the opportunity to ask questions.
{"title":"E-Class - a multimedia and Web based distance learning system","authors":"Gaurang Pateland, M. Tabrizi","doi":"10.1109/ITCC.2002.1000442","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000442","url":null,"abstract":"In this paper, we present the development of a multimedia system for the real-time delivery of online courses. The system provides the instructor with a real-life environment to teach in a manner similar to a classroom. The instructor's video, audio, hand-writing, drawing and slide presentations are synchronized and streamed, and at the same time the students can view the lectures online in a simulated classroom environment. One of the main strengths of this system is that the instructor's lectures can be archived for future usage by the students. The students can interrupt the teacher and are also given the opportunity to ask questions.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122754570","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000385
D. Rigas, D. Memery
The paper describes experiments that investigated the use of auditory stimuli (speech and non-speech sound) to communicate data in two information systems. These experiments were performed under a multimedia stock control system and a multimedia e-mail tool. Experiments using the multimedia stock control information system investigated rhythms and timbre to communicate windows and their associated functions as well as the simultaneous rise of speech and sound to communicate a large amount of information to users. Experiments using the multimedia e-mail tool investigated the use of tunes and short pitch sequences with visual stimuli to communicate information in browsing e-mail data. The paper also integrates experimental results front both systems and discusses the incorporation of auditory stimuli in interactive audio-visual or multimedia information systems. Auditory stimuli helped to communicate, complement or reinforce information that users received via the visual channel. These auditory technologies could also benefit visually impaired users of such systems. Results also indicated that the simultaneous use of sound and speech can be useful in the design of interactive multimedia information systems. The inclusion of auditory stimuli (including speech) in the design of information systems has the potential to maximise the volume of information communicated to users.
{"title":"Utilising audio-visual stimuli in interactive information systems: a two domain investigation on auditory metaphors","authors":"D. Rigas, D. Memery","doi":"10.1109/ITCC.2002.1000385","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000385","url":null,"abstract":"The paper describes experiments that investigated the use of auditory stimuli (speech and non-speech sound) to communicate data in two information systems. These experiments were performed under a multimedia stock control system and a multimedia e-mail tool. Experiments using the multimedia stock control information system investigated rhythms and timbre to communicate windows and their associated functions as well as the simultaneous rise of speech and sound to communicate a large amount of information to users. Experiments using the multimedia e-mail tool investigated the use of tunes and short pitch sequences with visual stimuli to communicate information in browsing e-mail data. The paper also integrates experimental results front both systems and discusses the incorporation of auditory stimuli in interactive audio-visual or multimedia information systems. Auditory stimuli helped to communicate, complement or reinforce information that users received via the visual channel. These auditory technologies could also benefit visually impaired users of such systems. Results also indicated that the simultaneous use of sound and speech can be useful in the design of interactive multimedia information systems. The inclusion of auditory stimuli (including speech) in the design of information systems has the potential to maximise the volume of information communicated to users.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122035420","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000441
Zohreh Nazeri, Jianping Zhang
This paper describes our latest experiment with application of data mining to analyzing severe weather impacts on National Airspace System (NAS) performance. We show the importance of data preparation and feature extraction in our work. Two types of data - weather and air traffic data - were used in this experiment. Weather data are represented as binary images. A severe-weather day for air traffic is represented as a set of severe-weather regions, each with a set of weather- and traffic-related features. The set of severe-weather regions for each day was first converted into a vector of attribute values, and then classification, regression and clustering were applied to the data. Initial results were encouraging, while later results were improved and impressive. Meaningful classification rules were generated and the clusters generated for weather-traffic days were clearly correlated with NAS performance.
{"title":"Mining aviation data to understand impacts of severe weather on airspace system performance","authors":"Zohreh Nazeri, Jianping Zhang","doi":"10.1109/ITCC.2002.1000441","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000441","url":null,"abstract":"This paper describes our latest experiment with application of data mining to analyzing severe weather impacts on National Airspace System (NAS) performance. We show the importance of data preparation and feature extraction in our work. Two types of data - weather and air traffic data - were used in this experiment. Weather data are represented as binary images. A severe-weather day for air traffic is represented as a set of severe-weather regions, each with a set of weather- and traffic-related features. The set of severe-weather regions for each day was first converted into a vector of attribute values, and then classification, regression and clustering were applied to the data. Initial results were encouraging, while later results were improved and impressive. Meaningful classification rules were generated and the clusters generated for weather-traffic days were clearly correlated with NAS performance.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122068058","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000436
F. Bodendorf, S. Uelpenich
Knowledge management is very important in the consulting business. On the one hand knowledge is the crucial factor of production that differentiates consulting companies from their competitors. On the other hand knowledge management is a consulting service that can be sold to other companies. A holistic approach for the introduction and establishment of knowledge management in consulting companies is presented that covers changes in organization, roles, processes and information technology. It focuses on an innovative approach to capturing implicit knowledge with intelligent software agents.
{"title":"Management of explicit and implicit knowledge in consulting companies","authors":"F. Bodendorf, S. Uelpenich","doi":"10.1109/ITCC.2002.1000436","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000436","url":null,"abstract":"Knowledge management is very important in the consulting business. On the one hand knowledge is the crucial factor of production that differentiates consulting companies from their competitors. On the other hand knowledge management is a consulting service that can be sold to other companies. A holistic approach for the introduction and establishment of knowledge management in consulting companies is presented that covers changes in organization, roles, processes and information technology. It focuses on an innovative approach to capturing implicit knowledge with intelligent software agents.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128056195","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000363
Wenjun Zeng, Jiangtao Wen, M. Severa
Summary form only given. We present a framework for access control of standard-compliant compressed video and audio bitstreams for entertainment purposes. This includes format compliant selective encryption and compliance-preserving secure spatial shuffling. The approach leverages well-known encryption algorithms, has low complexity, and maintains standard-compliance of the encrypted bitstream. The standard compliance feature guarantees the inheritance of many error resiliency properties of the video and audio compression standards, and works with many existing network bandwidth adaptation and error control techniques that have been developed for standard-compliant compressed video/audio, thus making it especially suitable for Internet commerce and wireless multimedia applications. Standard compliance also allows subsequent signal processing techniques to be applied to the encrypted bitstream. The approach is also capable of providing layered tradeoffs between security, complexity, delay, bit overhead, etc. We demonstrate the effectiveness of the proposed framework by applying it to MPEG-4 video bitstreams and MPEG-4 AAC audio bitstreams. The proposed framework has been adopted into MPEG-4 IPMP (Intellectual Property Management and Protection) extension Committee Draft.
{"title":"Format-compliant selective scrambling for multimedia access control","authors":"Wenjun Zeng, Jiangtao Wen, M. Severa","doi":"10.1109/ITCC.2002.1000363","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000363","url":null,"abstract":"Summary form only given. We present a framework for access control of standard-compliant compressed video and audio bitstreams for entertainment purposes. This includes format compliant selective encryption and compliance-preserving secure spatial shuffling. The approach leverages well-known encryption algorithms, has low complexity, and maintains standard-compliance of the encrypted bitstream. The standard compliance feature guarantees the inheritance of many error resiliency properties of the video and audio compression standards, and works with many existing network bandwidth adaptation and error control techniques that have been developed for standard-compliant compressed video/audio, thus making it especially suitable for Internet commerce and wireless multimedia applications. Standard compliance also allows subsequent signal processing techniques to be applied to the encrypted bitstream. The approach is also capable of providing layered tradeoffs between security, complexity, delay, bit overhead, etc. We demonstrate the effectiveness of the proposed framework by applying it to MPEG-4 video bitstreams and MPEG-4 AAC audio bitstreams. The proposed framework has been adopted into MPEG-4 IPMP (Intellectual Property Management and Protection) extension Committee Draft.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126383854","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000446
Roberto Basili, M. Pazienza, Fabio Massimo Zanzotto
The need for managing similar documents in different languages is increasing with the growing amount of electronic information that is available in documents of the same type (e.g. news streams). This paper proposes a viable approach to information access, emphasising the hypertextual paradigm in a multilingual framework. This task of processing/structuring text so that cross-lingual hypertext links are generated is called multilingual authoring (MA). Methods from natural language processing, especially information extraction, to both monolingual authoring and MA are described, and a general architecture for MA is defined. The effectiveness of the proposed approach is discussed using the description of the NAMIC (News Agencies Multilingual Information Categorisation) prototype system.
{"title":"Web-based information access: multilingual automatic authoring","authors":"Roberto Basili, M. Pazienza, Fabio Massimo Zanzotto","doi":"10.1109/ITCC.2002.1000446","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000446","url":null,"abstract":"The need for managing similar documents in different languages is increasing with the growing amount of electronic information that is available in documents of the same type (e.g. news streams). This paper proposes a viable approach to information access, emphasising the hypertextual paradigm in a multilingual framework. This task of processing/structuring text so that cross-lingual hypertext links are generated is called multilingual authoring (MA). Methods from natural language processing, especially information extraction, to both monolingual authoring and MA are described, and a general architecture for MA is defined. The effectiveness of the proposed approach is discussed using the description of the NAMIC (News Agencies Multilingual Information Categorisation) prototype system.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125029272","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
扫码关注我们
求助内容：
应助结果提醒方式：