Pub Date : 2011-11-14DOI: 10.1109/ICIMU.2011.6122766
A. Taherinia, M. Jamzad
In this paper, we used image inpainting as a means for reconstruction of small damaged portions of a watermarked image so that the hidden watermark is not detectable afterwards. Our new watermarking attack algorithm extends the exemplar-based inpainting method, and then we apply it to intended noisy watermarked images to alter the watermark detection process. Our approach is completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. The average PSNR/SSIM of the watermarked image after applying the proposed attack is more than 35/0.98 and the average NC for extracted watermark is lowers than 0.5, so theoretically, the watermark is not detectable.
{"title":"EWA: An exemplar-based watermarking attack","authors":"A. Taherinia, M. Jamzad","doi":"10.1109/ICIMU.2011.6122766","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122766","url":null,"abstract":"In this paper, we used image inpainting as a means for reconstruction of small damaged portions of a watermarked image so that the hidden watermark is not detectable afterwards. Our new watermarking attack algorithm extends the exemplar-based inpainting method, and then we apply it to intended noisy watermarked images to alter the watermark detection process. Our approach is completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. The average PSNR/SSIM of the watermarked image after applying the proposed attack is more than 35/0.98 and the average NC for extracted watermark is lowers than 0.5, so theoretically, the watermark is not detectable.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128586306","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122735
N. Tahir, K. A. Noordin
WiMAX is known as high speed network access and has a wide coverage. Although scheduling of the scarce wireless resources is important, however it has been left as an open issue for WiMAX. In this paper, we developed a heuristic approach to schedule various type of uplink traffic for IEEE802.16 while satisfying QoS requirements and providing fairness towards other services or users regardless of the physical layer condition. The proposed scheduler will aggregate minimum requirement of each type of services to avoid packet drop and distribute the remaining bandwidth using the round robin technique. Therefore this method is simple with low computational load yet manages to satisfy each user in demand. The analytical model is validated using Matlab programming to evaluate the performance of proposed method.
{"title":"Adaptive resource allocation scheme for uplinks in IEEE 802.16 systems","authors":"N. Tahir, K. A. Noordin","doi":"10.1109/ICIMU.2011.6122735","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122735","url":null,"abstract":"WiMAX is known as high speed network access and has a wide coverage. Although scheduling of the scarce wireless resources is important, however it has been left as an open issue for WiMAX. In this paper, we developed a heuristic approach to schedule various type of uplink traffic for IEEE802.16 while satisfying QoS requirements and providing fairness towards other services or users regardless of the physical layer condition. The proposed scheduler will aggregate minimum requirement of each type of services to avoid packet drop and distribute the remaining bandwidth using the round robin technique. Therefore this method is simple with low computational load yet manages to satisfy each user in demand. The analytical model is validated using Matlab programming to evaluate the performance of proposed method.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125435669","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122750
A. Joshi, D. Saini
In wireless communication, to attain high throughput and better transmission quality. Orthogonal Frequency Division Multiplexing (OFDM) is one of the techniques for parallel transmission. It is used for a various services such as asymmetric digital subscriber lines, very-high speed digital subscriber lines, digital video and audio broadcasting, and wide local area network standards such as IEEE 802.11a, IEEE 802.11g, and European telecommunication standard institute (ETSI). However in fading environments the bit error rate (BER) increases. The performance can be improved by using some kind of channel coding. This form of OFDM is called coded-OFDM (COFDM). In this paper our aim is to analyze and compare the performance of COFDM using Turbo codes {with Log-MAP (Maximum A Posteriori) decoding} and Reed Solomon (RS) code with 1/2 and 2/3 convolution codes (CC) as channel coding techniques in Rayleigh, Rician & Nakagami fading environments. The performance parameter is BER and the mapping schemes used are BPSK, QPSK, 16-QAM and 64-QAM. All other parameters are as per IEEE 802.11a specifications.
在无线通信中，达到高吞吐量和较好的传输质量。正交频分复用(OFDM)是并行传输的一种技术。它用于各种业务，如非对称数字用户线路、超高速数字用户线路、数字视频和音频广播，以及IEEE 802.11a、IEEE 802.11g和欧洲电信标准协会(ETSI)等广域局域网标准。然而，在衰落环境下，误码率(BER)增加。通过使用某种信道编码可以提高性能。这种形式的OFDM称为编码OFDM (COFDM)。在本文中，我们的目的是分析和比较使用Turbo码{Log-MAP (Maximum A Posteriori)解码}和Reed Solomon码(RS)与1/2和2/3卷积码(CC)作为信道编码技术的COFDM在Rayleigh，专家和Nakagami衰落环境中的性能。性能参数为误码率，使用的映射方案有BPSK、QPSK、16-QAM和64-QAM。其他参数均按照IEEE 802.11a规范执行。
{"title":"Performance analysis of coded-OFDM with RS-CC and Turbo codes in various fading environment","authors":"A. Joshi, D. Saini","doi":"10.1109/ICIMU.2011.6122750","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122750","url":null,"abstract":"In wireless communication, to attain high throughput and better transmission quality. Orthogonal Frequency Division Multiplexing (OFDM) is one of the techniques for parallel transmission. It is used for a various services such as asymmetric digital subscriber lines, very-high speed digital subscriber lines, digital video and audio broadcasting, and wide local area network standards such as IEEE 802.11a, IEEE 802.11g, and European telecommunication standard institute (ETSI). However in fading environments the bit error rate (BER) increases. The performance can be improved by using some kind of channel coding. This form of OFDM is called coded-OFDM (COFDM). In this paper our aim is to analyze and compare the performance of COFDM using Turbo codes {with Log-MAP (Maximum A Posteriori) decoding} and Reed Solomon (RS) code with 1/2 and 2/3 convolution codes (CC) as channel coding techniques in Rayleigh, Rician & Nakagami fading environments. The performance parameter is BER and the mapping schemes used are BPSK, QPSK, 16-QAM and 64-QAM. All other parameters are as per IEEE 802.11a specifications.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126809839","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122747
A. Nayyar, F. Bashir, Ubaid-Ur-Rehman, Z. Hamid
The increase in the usefulness of WSNs, have lead to the transmission of multimedia content over these networks. This has escorted to the concept of Wireless Multimedia Sensor networks (WMSNs). Due to resource constrained structure of WSNs, special attention is required to route data in these networks. In this paper, we propose a novel routing protocol for WMSNs which establishes paths on the basis of traffic load, hop count and node energy. The protocol aims to find completely or partially disjoint paths for routing multimedia traffic with relatively minimum distance. Simulation results have shown that the proposed protocol is capable of finding intelligent path such that it increases throughput and avoid creation of network holes near the sink.
{"title":"Intelligent routing protocol for Multimedia Sensor networks","authors":"A. Nayyar, F. Bashir, Ubaid-Ur-Rehman, Z. Hamid","doi":"10.1109/ICIMU.2011.6122747","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122747","url":null,"abstract":"The increase in the usefulness of WSNs, have lead to the transmission of multimedia content over these networks. This has escorted to the concept of Wireless Multimedia Sensor networks (WMSNs). Due to resource constrained structure of WSNs, special attention is required to route data in these networks. In this paper, we propose a novel routing protocol for WMSNs which establishes paths on the basis of traffic load, hop count and node energy. The protocol aims to find completely or partially disjoint paths for routing multimedia traffic with relatively minimum distance. Simulation results have shown that the proposed protocol is capable of finding intelligent path such that it increases throughput and avoid creation of network holes near the sink.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123809820","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122724
Abbas Arghavani, E. Ahmadi, A. Haghighat
In centralized algorithm for mutual exclusion, one process is elected as a coordinator. Whenever a process wants to go to critical section, it sends a request message to the coordinator and asks for permission. The election of coordinator is an important problem in distributed systems. After a failure occurs in the system, it is necessary to reelect a new leader as a coordinator. The bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. But this algorithm often needs a lot of message passing to find out which process should be a new coordinator. In this paper we are going to propose an optimized method for the bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm has fewer message passing and is more efficient.
{"title":"Improved bully election algorithm in distributed systems","authors":"Abbas Arghavani, E. Ahmadi, A. Haghighat","doi":"10.1109/ICIMU.2011.6122724","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122724","url":null,"abstract":"In centralized algorithm for mutual exclusion, one process is elected as a coordinator. Whenever a process wants to go to critical section, it sends a request message to the coordinator and asks for permission. The election of coordinator is an important problem in distributed systems. After a failure occurs in the system, it is necessary to reelect a new leader as a coordinator. The bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. But this algorithm often needs a lot of message passing to find out which process should be a new coordinator. In this paper we are going to propose an optimized method for the bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm has fewer message passing and is more efficient.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116305335","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122740
T. A. Alvar, R. Atan
Efficiency of codes developed is always an issue in software development. Software can be said to be of good quality if the measurable features of the software can be quantitatively checked for adoption of standards or following certain set rules. Software metrics can therefore come into play in the sense of helping to measure certain characteristics of software. The issue and factors pertaining to efficiency of a code will be addressed by software metrics. Existing tools that are used to analyze several software metrics have come a long way in helping to assess this very important part of software development. This paper described how software metrics can be used in analyzing efficiency of the developed code in early stage of development. A tool (algorithm analyzer) was developed to enable analyze a given code to check its efficiency level and produce efficiency reports based on the analysis. The system is able to help the code checking whilst maintaining the standards of coding for its users. With the reports that are generated it would be easy for users to determine the efficiency of their object oriented codes.
{"title":"Algorithm analyzer to check the efficiency of codes","authors":"T. A. Alvar, R. Atan","doi":"10.1109/ICIMU.2011.6122740","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122740","url":null,"abstract":"Efficiency of codes developed is always an issue in software development. Software can be said to be of good quality if the measurable features of the software can be quantitatively checked for adoption of standards or following certain set rules. Software metrics can therefore come into play in the sense of helping to measure certain characteristics of software. The issue and factors pertaining to efficiency of a code will be addressed by software metrics. Existing tools that are used to analyze several software metrics have come a long way in helping to assess this very important part of software development. This paper described how software metrics can be used in analyzing efficiency of the developed code in early stage of development. A tool (algorithm analyzer) was developed to enable analyze a given code to check its efficiency level and produce efficiency reports based on the analysis. The system is able to help the code checking whilst maintaining the standards of coding for its users. With the reports that are generated it would be easy for users to determine the efficiency of their object oriented codes.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134167686","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122745
L. Soo, E. Yeoh, S. Ho
This paper proposes a revised architecture for Service Oriented Architecture (SOA) e-learning system to enhance the reusability of the Learning Objects (LOs) by providing a personalized recommendation model (searching and ranking processes) which is having a shorter processing time, comparing with other approaches. The model counts the similarity degree between the learning objects and the search conditions given by users. The LOs with higher similarity degrees will then be ranked by referring to user's preference history records. Those LOs which are more closed with the user's preference record will be ranked higher in the search result list. The preference record is stored in database to record the details of LOs which are selected by user in the past. As the literature review, some different existing approaches based on recommendation models have been analyzed and compared with each other. Among those existing model, some approaches are focusing on personalized recommendation, while some approaches are focusing on improving the efficiency of the searching and ranking processes. Our contribution is to propose an idea of a recommendation model that is personalized and at the same time, the model should have a shorter processing time. Prototype system will be implemented in future to show the contribution.
{"title":"Searching & ranking Learning Objects in a Service Oriented Architecture for e-learning","authors":"L. Soo, E. Yeoh, S. Ho","doi":"10.1109/ICIMU.2011.6122745","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122745","url":null,"abstract":"This paper proposes a revised architecture for Service Oriented Architecture (SOA) e-learning system to enhance the reusability of the Learning Objects (LOs) by providing a personalized recommendation model (searching and ranking processes) which is having a shorter processing time, comparing with other approaches. The model counts the similarity degree between the learning objects and the search conditions given by users. The LOs with higher similarity degrees will then be ranked by referring to user's preference history records. Those LOs which are more closed with the user's preference record will be ranked higher in the search result list. The preference record is stored in database to record the details of LOs which are selected by user in the past. As the literature review, some different existing approaches based on recommendation models have been analyzed and compared with each other. Among those existing model, some approaches are focusing on personalized recommendation, while some approaches are focusing on improving the efficiency of the searching and ranking processes. Our contribution is to propose an idea of a recommendation model that is personalized and at the same time, the model should have a shorter processing time. Prototype system will be implemented in future to show the contribution.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810659","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122720
Omaima N. A. Al-Allaf
Artificial neural networks (ANNs) especially Backpropagation Neural Network (BPNN) was used largely in image processing. The backpropagation neural network algorithm (BP) was used for training the BPNN for image compression/decompression. The BP requires long time to train the BPNN with small error. Therefore, in this research, a three layered BPNN was designed for building image compression system. The Fast backpropagation neural network algorithm (FBP) was used for training the designed BPNN to reduce the training time (convergence time) of BPNN as possible as. Many techniques were used to improve the use of FBP for BPNN training. This is done by using different architecture of BPNN by changing the number of input layer neurons and number of hidden layer neurons. Also we trained the BPNN with different FBP parameters. Finally, FBP results such as compression ratio (CR) and peak signal to noise ratio (PSNR) are computed and compared with BP results. From the results, we noticed that the use of FBP improve the BPNN training by reducing the convergence time of image compression learning process.
{"title":"Fast Backpropagation Neural Network algorithm for reducing convergence time of BPNN image compression","authors":"Omaima N. A. Al-Allaf","doi":"10.1109/ICIMU.2011.6122720","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122720","url":null,"abstract":"Artificial neural networks (ANNs) especially Backpropagation Neural Network (BPNN) was used largely in image processing. The backpropagation neural network algorithm (BP) was used for training the BPNN for image compression/decompression. The BP requires long time to train the BPNN with small error. Therefore, in this research, a three layered BPNN was designed for building image compression system. The Fast backpropagation neural network algorithm (FBP) was used for training the designed BPNN to reduce the training time (convergence time) of BPNN as possible as. Many techniques were used to improve the use of FBP for BPNN training. This is done by using different architecture of BPNN by changing the number of input layer neurons and number of hidden layer neurons. Also we trained the BPNN with different FBP parameters. Finally, FBP results such as compression ratio (CR) and peak signal to noise ratio (PSNR) are computed and compared with BP results. From the results, we noticed that the use of FBP improve the BPNN training by reducing the convergence time of image compression learning process.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128952157","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122773
M. F. Tuysuz, H. A. Mantar
Real-time applications such as VoIP, video-conference or online games are delay-sensitive multimedia applications and require relatively small delay and small delay variation. Recently, IEEE 802.11 WLANs have reached an important stage and have become a common technology for wireless access due to its low cost, ease of deployment and mobility support. Its new standard, EDCA, has the ability to accommodate real-time traffic and provide relatively small delay. However, it cannot achieve small delay variation due to the burst feature of its backoff mechanism after a collision or a frame error. Since the real-time services such as Voice over IP (VoIP) has a delay constraint to guarantee a QoS, a fast retransmission scheme for corrupted frames is required. In this paper, we propose a new fast retransmission mechanism for VoIP frames to reduce the delay and delay variation. Then, we integrate our scheme with an Adaptive Jitter Buffer (AJB) algorithm to optimize end-to-end QoS performance. Simulation results indicate that proposed fast retransmission scheme reduces not only delay, delay variation and dropping probability of frames, but it also helps the AJB to support QoS maintaining voice quality at high level on EDCA-based WLANs.
{"title":"Fast retransmission mechanism and end to end QoS support for VoIP applications over IEEE 802.11e WLANs","authors":"M. F. Tuysuz, H. A. Mantar","doi":"10.1109/ICIMU.2011.6122773","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122773","url":null,"abstract":"Real-time applications such as VoIP, video-conference or online games are delay-sensitive multimedia applications and require relatively small delay and small delay variation. Recently, IEEE 802.11 WLANs have reached an important stage and have become a common technology for wireless access due to its low cost, ease of deployment and mobility support. Its new standard, EDCA, has the ability to accommodate real-time traffic and provide relatively small delay. However, it cannot achieve small delay variation due to the burst feature of its backoff mechanism after a collision or a frame error. Since the real-time services such as Voice over IP (VoIP) has a delay constraint to guarantee a QoS, a fast retransmission scheme for corrupted frames is required. In this paper, we propose a new fast retransmission mechanism for VoIP frames to reduce the delay and delay variation. Then, we integrate our scheme with an Adaptive Jitter Buffer (AJB) algorithm to optimize end-to-end QoS performance. Simulation results indicate that proposed fast retransmission scheme reduces not only delay, delay variation and dropping probability of frames, but it also helps the AJB to support QoS maintaining voice quality at high level on EDCA-based WLANs.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128733349","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 : 2011-11-01DOI: 10.1109/ICIMU.2011.6122717
S. Ismail, M. S. Ahmad
Social intelligence has been coined by authors in many aspects, with one of them being the sociability characteristics of a software agent in performing tasks over social network. This concept has been expanded from personal knowledge management (PKM) frameworks using agent mediation, where intelligent agents are assigned with tasks to assist their human counterparts. In recent studies, PKM processes are understood to be a series of getting knowledge, analysing/understanding knowledge, sharing/publishing knowledge and connecting to others for knowledge over the Internet and social network. The critical issue of this concept involves identifying and ‘locating’ knowledge experts for further enlightenment of one's personal knowledge. Taking into considerations the advantages of social network and the similarities between PKM processes and Nonaka's SECI model, the emergence of social intelligence are investigated in this paper by analysing the responses from a questionnaire survey on PKM processes over the social network. This paper also discusses the limitations of this research vis-à-vis the current situation where e-mail is still seen as the only reliable way to manage personal knowledge. It then recommends future works in the realm of social intelligence, involving software agents.
{"title":"Emergence of social intelligence in social network: A quantitative analysis for agent-mediated PKM processes","authors":"S. Ismail, M. S. Ahmad","doi":"10.1109/ICIMU.2011.6122717","DOIUrl":"https://doi.org/10.1109/ICIMU.2011.6122717","url":null,"abstract":"Social intelligence has been coined by authors in many aspects, with one of them being the sociability characteristics of a software agent in performing tasks over social network. This concept has been expanded from personal knowledge management (PKM) frameworks using agent mediation, where intelligent agents are assigned with tasks to assist their human counterparts. In recent studies, PKM processes are understood to be a series of getting knowledge, analysing/understanding knowledge, sharing/publishing knowledge and connecting to others for knowledge over the Internet and social network. The critical issue of this concept involves identifying and ‘locating’ knowledge experts for further enlightenment of one's personal knowledge. Taking into considerations the advantages of social network and the similarities between PKM processes and Nonaka's SECI model, the emergence of social intelligence are investigated in this paper by analysing the responses from a questionnaire survey on PKM processes over the social network. This paper also discusses the limitations of this research vis-à-vis the current situation where e-mail is still seen as the only reliable way to manage personal knowledge. It then recommends future works in the realm of social intelligence, involving software agents.","PeriodicalId":102808,"journal":{"name":"ICIMU 2011 : Proceedings of the 5th international Conference on Information Technology & Multimedia","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129101866","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
扫码关注我们
求助内容：
应助结果提醒方式：