Pub Date : 2012-12-01DOI: 10.1109/ICOAC.2012.6416853
G. Mani, S. Berkovich, I. Mihai
Computer architectures are expected to change to support Exascale computing in the near future. As energy and cooling constraints limit increases in microprocessor clock speeds and number of cores, computer companies are turning to parallel programming. Nowadays, parallel programming is achieved by increasing the number of processing elements in processor cores, increasing the number of processor cores itself and complicated parallel programming where programmer has the responsibility of allocating memory and synchronizing the communication between the processing elements as well as processor cores. It becomes increasingly difficult and expensive to design and produce shared memory machines with ever increasing number of processors. Increase in the number of processors is a major disadvantage when it comes to energy consumption. In this work, we present a new architecture for processor design based on pairwise balanced combinatorial interconnection of processing and memory elements. The proposed processor uses two operand instructions, so that the set of executable machine instructions is partitioned by these pairs. This kind of partition allows parallel processing of data-independent instructions. Since this partition is done at the compile time, the architecture extracts the instruction level parallelism without run-time overheads. We analyze and confirm the performance improvements through simulations. The suggested combinatorial arrangement gives set of architectures with various degrees of performance enhancement.
{"title":"A combinatorial distributed architecture for Exascale computing","authors":"G. Mani, S. Berkovich, I. Mihai","doi":"10.1109/ICOAC.2012.6416853","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416853","url":null,"abstract":"Computer architectures are expected to change to support Exascale computing in the near future. As energy and cooling constraints limit increases in microprocessor clock speeds and number of cores, computer companies are turning to parallel programming. Nowadays, parallel programming is achieved by increasing the number of processing elements in processor cores, increasing the number of processor cores itself and complicated parallel programming where programmer has the responsibility of allocating memory and synchronizing the communication between the processing elements as well as processor cores. It becomes increasingly difficult and expensive to design and produce shared memory machines with ever increasing number of processors. Increase in the number of processors is a major disadvantage when it comes to energy consumption. In this work, we present a new architecture for processor design based on pairwise balanced combinatorial interconnection of processing and memory elements. The proposed processor uses two operand instructions, so that the set of executable machine instructions is partitioned by these pairs. This kind of partition allows parallel processing of data-independent instructions. Since this partition is done at the compile time, the architecture extracts the instruction level parallelism without run-time overheads. We analyze and confirm the performance improvements through simulations. The suggested combinatorial arrangement gives set of architectures with various degrees of performance enhancement.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127870133","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416822
S. Suman, L. Bhagyalakshmi, K. Murugan
Transmission power control is an important issue in wireless ad hoc networks due to its dependency on battery power. It is a tendency of ad hoc nodes to transmit at their maximum power level to ensure successful delivery of their packets which causes interference to other neighboring nodes. In response, the other nodes also increase their power level which creates a situation of cascading effect where all nodes drain their battery power. In this paper, the cascading effect of interference caused by neighboring nodes and its impact on battery power in wireless ad hoc networks is analyzed and a non cooperative power control game is proposed to obtain an optimum power at which the nodes can maximize their utility without compromising the quality of services. The concept of game theory is also applied to determine an optimum SNIR that is the same value for all the nodes in networks for their mutual benefit. Through the numerical examples it is shown that the proposed concept obtains the maximum utility by minimizing the transmission power.
{"title":"Non cooperative power control game for wireless ad hoc networks","authors":"S. Suman, L. Bhagyalakshmi, K. Murugan","doi":"10.1109/ICOAC.2012.6416822","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416822","url":null,"abstract":"Transmission power control is an important issue in wireless ad hoc networks due to its dependency on battery power. It is a tendency of ad hoc nodes to transmit at their maximum power level to ensure successful delivery of their packets which causes interference to other neighboring nodes. In response, the other nodes also increase their power level which creates a situation of cascading effect where all nodes drain their battery power. In this paper, the cascading effect of interference caused by neighboring nodes and its impact on battery power in wireless ad hoc networks is analyzed and a non cooperative power control game is proposed to obtain an optimum power at which the nodes can maximize their utility without compromising the quality of services. The concept of game theory is also applied to determine an optimum SNIR that is the same value for all the nodes in networks for their mutual benefit. Through the numerical examples it is shown that the proposed concept obtains the maximum utility by minimizing the transmission power.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131110153","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416803
B. Rajamanickam, M. Shanmugam
This paper describes Laser Speckle Image Pattern Correlation (LSIPC) technique, a nondestructive method for the measurement of deformation/displacement of the specimen in metrology using Fast Fourier Transform. A diffuse object is illuminated with laser light, a random interference effect known as `speckle pattern' is produced. If there is movement in the object, the speckle patterns fluctuate in intensity. These fluctuations can be used to provide information about the movement. The experimental arrangement is based on the Michelson Interferometer method. The object is a thin steel plate fastened by means of screws at four points. A screw set into the center of the plate and inducing flexure of the plate is used to produce deformation of the plate. Illumination of the plate and photography were performed along directions close to the normal. The principle of this technique is capturing of two speckle patterns of a specimen, one before deformation (Reference image) and the other after deformation/displacement (Deformed image) by a CCD camera and registered by a frame grabber. The above deterministic increment in the phase difference of the two interfering fields is displayed in the difference pattern of intensities. Small sub images are obtained by segmenting process and analyzed point wise. An algorithm has been written using Fast Fourier Transform to obtain the information about the deformation. This method consists of simple and robust optical setup to perform non invasive measurement to the sub micron level for the measurement of deformation.
{"title":"Application of Fast Fourier Transform (FFT) in Laser Speckle Image Pattern Correlation technique for the metrological measurement","authors":"B. Rajamanickam, M. Shanmugam","doi":"10.1109/ICOAC.2012.6416803","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416803","url":null,"abstract":"This paper describes Laser Speckle Image Pattern Correlation (LSIPC) technique, a nondestructive method for the measurement of deformation/displacement of the specimen in metrology using Fast Fourier Transform. A diffuse object is illuminated with laser light, a random interference effect known as `speckle pattern' is produced. If there is movement in the object, the speckle patterns fluctuate in intensity. These fluctuations can be used to provide information about the movement. The experimental arrangement is based on the Michelson Interferometer method. The object is a thin steel plate fastened by means of screws at four points. A screw set into the center of the plate and inducing flexure of the plate is used to produce deformation of the plate. Illumination of the plate and photography were performed along directions close to the normal. The principle of this technique is capturing of two speckle patterns of a specimen, one before deformation (Reference image) and the other after deformation/displacement (Deformed image) by a CCD camera and registered by a frame grabber. The above deterministic increment in the phase difference of the two interfering fields is displayed in the difference pattern of intensities. Small sub images are obtained by segmenting process and analyzed point wise. An algorithm has been written using Fast Fourier Transform to obtain the information about the deformation. This method consists of simple and robust optical setup to perform non invasive measurement to the sub micron level for the measurement of deformation.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131346594","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416867
C. Sekhar, S. Kumar, M. Subhas, R. Buyya
Support vector machine (SVM) is a pattern classification model suitable for classification and annotation of images using non-vectorial type representations of images. Varying length patterns extracted from image data correspond to sets of local feature vectors. Kernels designed for varying length patterns are called as dynamic kernels. The talk presents the issues in designing the dynamic kernel based SVMS for classification and annotation of images. Different methods for designing the dynamic kernels are presented. An intermediate matching kernel (IMK) for a pair of varying length patterns is constructed by matching the pairs of local feature vectors selected using a set of virtual feature vectors. For patterns corresponding to sets of feature vectors, a Gaussian mixture model (GMM) is used as the set of virtual feature vectors. The GMM-based IMK is considered for image processing tasks such as image classification, matching and annotation in content-based image retrieval. The talk presents results of experimental studies on image classification, annotation and retrieval of images using the kernel methods.
{"title":"Kernel methods based approaches to image classification and retrieval","authors":"C. Sekhar, S. Kumar, M. Subhas, R. Buyya","doi":"10.1109/ICOAC.2012.6416867","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416867","url":null,"abstract":"Support vector machine (SVM) is a pattern classification model suitable for classification and annotation of images using non-vectorial type representations of images. Varying length patterns extracted from image data correspond to sets of local feature vectors. Kernels designed for varying length patterns are called as dynamic kernels. The talk presents the issues in designing the dynamic kernel based SVMS for classification and annotation of images. Different methods for designing the dynamic kernels are presented. An intermediate matching kernel (IMK) for a pair of varying length patterns is constructed by matching the pairs of local feature vectors selected using a set of virtual feature vectors. For patterns corresponding to sets of feature vectors, a Gaussian mixture model (GMM) is used as the set of virtual feature vectors. The GMM-based IMK is considered for image processing tasks such as image classification, matching and annotation in content-based image retrieval. The talk presents results of experimental studies on image classification, annotation and retrieval of images using the kernel methods.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114875226","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416843
P. Kulkarni, A. Khandebharad, D. Khope, P. Chavan
The License Plate Recognition (LPR) system is one of the most important criterions of mass surveillance method. LPR systems are generally Composed of three steps namely, 1] plate extraction, 2] character Segmentation and 3] Recognition. License Plate Recognition is a crucial task due to the non-uniformity in license plates and the illumination conditions. Most of the developed techniques work under specific conditions such as image capturing angle, illumination, stationary background. All the given LPR techniques vary on the basis of processing time, required computational power and accuracy. Since the absence of any standard, these techniques are incomparable but an efficient path for specified requirements can be judged. Hence we are proposing a Novel idea of Arduino based License Plate Recognition.
{"title":"License Plate Recognition: A review","authors":"P. Kulkarni, A. Khandebharad, D. Khope, P. Chavan","doi":"10.1109/ICOAC.2012.6416843","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416843","url":null,"abstract":"The License Plate Recognition (LPR) system is one of the most important criterions of mass surveillance method. LPR systems are generally Composed of three steps namely, 1] plate extraction, 2] character Segmentation and 3] Recognition. License Plate Recognition is a crucial task due to the non-uniformity in license plates and the illumination conditions. Most of the developed techniques work under specific conditions such as image capturing angle, illumination, stationary background. All the given LPR techniques vary on the basis of processing time, required computational power and accuracy. Since the absence of any standard, these techniques are incomparable but an efficient path for specified requirements can be judged. Hence we are proposing a Novel idea of Arduino based License Plate Recognition.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936918","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416819
T. J. Singh, R. Sugumar
With the advent and acceptance of cloud computing the ability to record and account for the usage of cloud resources in a convincing and capricious way has become critical for cloud service providers and users alike. The billing process involves receiving billing records from various networks, determining the billing rates associated with the billing records, calculate the cost for each billing record, aggregating this records periodically to generate invoices, sending invoices to the customer, and collecting payments received from the customer. Traditional billing systems are not enough in terms of security capabilities or computational overhead. In this paper, we propose a secure and no obstructive billing system called THEMIS as a remedy for these limitations. The system uses a novel concept of a cloud notary authority for the supervision of billing. Moreover, to provide a falsification-resistive SLA monitoring mechanism, we devised a SLA monitoring module enhanced with a trusted platform module (TPM), called S-Mon. From the perspective of extensibility, THEMIS is moreover applicable to various target services as well to improve the accountability of each service by applying more monitoring techniques to S-Mon. The overall latency of these systems is shorter and the throughput much higher than the Public key Infrastructure.
{"title":"An extensibility of THEMIS billing system for the cloud computing environment","authors":"T. J. Singh, R. Sugumar","doi":"10.1109/ICOAC.2012.6416819","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416819","url":null,"abstract":"With the advent and acceptance of cloud computing the ability to record and account for the usage of cloud resources in a convincing and capricious way has become critical for cloud service providers and users alike. The billing process involves receiving billing records from various networks, determining the billing rates associated with the billing records, calculate the cost for each billing record, aggregating this records periodically to generate invoices, sending invoices to the customer, and collecting payments received from the customer. Traditional billing systems are not enough in terms of security capabilities or computational overhead. In this paper, we propose a secure and no obstructive billing system called THEMIS as a remedy for these limitations. The system uses a novel concept of a cloud notary authority for the supervision of billing. Moreover, to provide a falsification-resistive SLA monitoring mechanism, we devised a SLA monitoring module enhanced with a trusted platform module (TPM), called S-Mon. From the perspective of extensibility, THEMIS is moreover applicable to various target services as well to improve the accountability of each service by applying more monitoring techniques to S-Mon. The overall latency of these systems is shorter and the throughput much higher than the Public key Infrastructure.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371961","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416810
H. Lakshmi, H. Mohanty
Relational Database for its huge success in data management has been used here as a scalable repository for storing webservices in UDDI framework. The operator `join' has been used to derive service composition by matching inputs of a service to outputs of another. Adopting three modes of composability for a desired service, the possibility of having different kinds of compositions is demonstrated in form of a Composition Search Tree.
{"title":"RDBMS for service repository and composition","authors":"H. Lakshmi, H. Mohanty","doi":"10.1109/ICOAC.2012.6416810","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416810","url":null,"abstract":"Relational Database for its huge success in data management has been used here as a scalable repository for storing webservices in UDDI framework. The operator `join' has been used to derive service composition by matching inputs of a service to outputs of another. Adopting three modes of composability for a desired service, the possibility of having different kinds of compositions is demonstrated in form of a Composition Search Tree.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407539","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416801
S. Ramesh, R. Praveen, R. Indira, P. G. Kumar
Mobile Ad hoc Networks were well - thought - out as the independent deployment of mobile nodes. It is eminently said that MANET is a self configuring infra - structure less network that do not count on centralized and organized connectivity of mobile nodes. Military networks, Disaster relief efforts are some common instance of Mobile Ad hoc Networks. MANET showed the way for a new form of network namely Intermittently Connected Mobile Ad hoc Network (ICMANET) which is prominently a Delay Tolerant Network. MANET leads to ICMANET due to sparse or high mobility in the networks. The significance of such networks is that they don't ever hold a complete end-to-end connectivity between nodes. Exemplary examples of intermittent network includes Wildlife Management, Military Surveillance etc. Enormous research works attest massive possible methodologies for efficiently forwarding packets between nodes. The routing methodologies indict mostly the traditional routing protocols akin to AODV, DSR. The exigent factor of ICMANET is to route packets where such traditional protocols do not overlay a resourceful forwarding of data packets. In this paper, we put forward a survey of prevailing routing paradigms that explore techniques for routing along with virtues and shortcomings.
{"title":"A survey on routing methodologies for ICMANET","authors":"S. Ramesh, R. Praveen, R. Indira, P. G. Kumar","doi":"10.1109/ICOAC.2012.6416801","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416801","url":null,"abstract":"Mobile Ad hoc Networks were well - thought - out as the independent deployment of mobile nodes. It is eminently said that MANET is a self configuring infra - structure less network that do not count on centralized and organized connectivity of mobile nodes. Military networks, Disaster relief efforts are some common instance of Mobile Ad hoc Networks. MANET showed the way for a new form of network namely Intermittently Connected Mobile Ad hoc Network (ICMANET) which is prominently a Delay Tolerant Network. MANET leads to ICMANET due to sparse or high mobility in the networks. The significance of such networks is that they don't ever hold a complete end-to-end connectivity between nodes. Exemplary examples of intermittent network includes Wildlife Management, Military Surveillance etc. Enormous research works attest massive possible methodologies for efficiently forwarding packets between nodes. The routing methodologies indict mostly the traditional routing protocols akin to AODV, DSR. The exigent factor of ICMANET is to route packets where such traditional protocols do not overlay a resourceful forwarding of data packets. In this paper, we put forward a survey of prevailing routing paradigms that explore techniques for routing along with virtues and shortcomings.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129290764","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416852
A. Safia, T. Mala
Collaborative E-Learning is an environment where in learners learn through interaction among peer group mates using computers. Evaluating learners in terms of collaboration capabilities in a collaborative e-learning session can be quantified based on several parameters. These parameters include learner's contribution in the collaborative e-learning sessions; collaboration history of a learner in collaborative e-learning sessions and the level of knowledge of the learner in the group in which he participates. In respect to this finding the More Knowledgeable Other (MKO) person refers to someone who has a better understanding and higher ability level than other learners, with respect to a particular task, process, or concept. He can make others learn effectively. By finding out the MKO it is possible to form effective and efficient group where in learner's learning capabilities in a group can be enhanced so that the peers in the group participate to maximum extent and there is an increase in knowledge level. In this paper, a fuzzy model is introduced to find out an MKO using an intelligent inference system to improve learner's learning capabilities in terms of a proposed metric called fuzzy associative matrix. This matrix can be utilized to guide the collaborative e-learning system for finding out the MKO as the best choice for very effective collaborative e-learning. Simulation study using NetLogo has been carried out to evaluate the performance of the proposed strategy. Simulation results show that the proposed strategy provides an optimal solution in ascertaining an MKO among peers in collaborative E-learning environments.
{"title":"Ascertaining the More Knowledgeable Other among peers in collaborative e-learning environment","authors":"A. Safia, T. Mala","doi":"10.1109/ICOAC.2012.6416852","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416852","url":null,"abstract":"Collaborative E-Learning is an environment where in learners learn through interaction among peer group mates using computers. Evaluating learners in terms of collaboration capabilities in a collaborative e-learning session can be quantified based on several parameters. These parameters include learner's contribution in the collaborative e-learning sessions; collaboration history of a learner in collaborative e-learning sessions and the level of knowledge of the learner in the group in which he participates. In respect to this finding the More Knowledgeable Other (MKO) person refers to someone who has a better understanding and higher ability level than other learners, with respect to a particular task, process, or concept. He can make others learn effectively. By finding out the MKO it is possible to form effective and efficient group where in learner's learning capabilities in a group can be enhanced so that the peers in the group participate to maximum extent and there is an increase in knowledge level. In this paper, a fuzzy model is introduced to find out an MKO using an intelligent inference system to improve learner's learning capabilities in terms of a proposed metric called fuzzy associative matrix. This matrix can be utilized to guide the collaborative e-learning system for finding out the MKO as the best choice for very effective collaborative e-learning. Simulation study using NetLogo has been carried out to evaluate the performance of the proposed strategy. Simulation results show that the proposed strategy provides an optimal solution in ascertaining an MKO among peers in collaborative E-learning environments.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866438","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416815
S. Vigneshwari, M. Aramudhan
Web personalization has become the recent trend in the internet era. There are various means for web personalization. On such approach is by creating ontologies and personalizing the web. Ontologies play an important role in the creation of the semantic web. In this paper a novel approach has been proposed for creation of user profiling ontologies(UPO) which is useful for personalizing the web. In this approach a cross ontology mechanism has been applied. The user queries are continuously monitored. Then the stemming process takes place and important keywords are extracted and the frequently visited web pages are ranked. Based on this UPO is automatically generated. Here ontology mapping mechanism is followed for mapping the UPO with that of the global ontology and thus the web pages are personalized which are compatible to user queries. Data samples are collected and the results show a good improvement using this approach.
{"title":"A novel approach for personalizing the web using user profiling ontologies","authors":"S. Vigneshwari, M. Aramudhan","doi":"10.1109/ICOAC.2012.6416815","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416815","url":null,"abstract":"Web personalization has become the recent trend in the internet era. There are various means for web personalization. On such approach is by creating ontologies and personalizing the web. Ontologies play an important role in the creation of the semantic web. In this paper a novel approach has been proposed for creation of user profiling ontologies(UPO) which is useful for personalizing the web. In this approach a cross ontology mechanism has been applied. The user queries are continuously monitored. Then the stemming process takes place and important keywords are extracted and the frequently visited web pages are ranked. Based on this UPO is automatically generated. Here ontology mapping mechanism is followed for mapping the UPO with that of the global ontology and thus the web pages are personalized which are compatible to user queries. Data samples are collected and the results show a good improvement using this approach.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115011694","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
扫码关注我们
求助内容：
应助结果提醒方式：