Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.
{"title":"Relational similarity model for suggesting friends in online social networks","authors":"Miraj Mohajireen, Charith Ellepola, Madura Perera, Indika Kahanda, Upulee Kanewala","doi":"10.1109/ICIINFS.2011.6038090","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038090","url":null,"abstract":"Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130309882","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-10-10DOI: 10.1109/ICIINFS.2011.6038063
Shuvra Chakraborty
This paper presents a fingerprint matching system which uses eight directional Gabor filter bank, a popular method for enhancing poor quality image, to capture global and local information available in the fingerprints. A new region of interest has been experimented for feature vector compaction. Here, feature vectors are extracted from the directional representation of enhanced image. Matching is extremely fast as it computes only Euclidian difference between feature vectors to compute matching score. Feature vector requires least memory as compared to traditional minutiae based approach as it stores only 64 intensity values. This filter-bank approach has been tested on 800 images of DB1_a of FVC 2002 and 77.125% images are accepted correctly.
{"title":"An optimized fingerprint matcher","authors":"Shuvra Chakraborty","doi":"10.1109/ICIINFS.2011.6038063","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038063","url":null,"abstract":"This paper presents a fingerprint matching system which uses eight directional Gabor filter bank, a popular method for enhancing poor quality image, to capture global and local information available in the fingerprints. A new region of interest has been experimented for feature vector compaction. Here, feature vectors are extracted from the directional representation of enhanced image. Matching is extremely fast as it computes only Euclidian difference between feature vectors to compute matching score. Feature vector requires least memory as compared to traditional minutiae based approach as it stores only 64 intensity values. This filter-bank approach has been tested on 800 images of DB1_a of FVC 2002 and 77.125% images are accepted correctly.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125575448","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-10-10DOI: 10.1109/ICIINFS.2011.6038089
Lahiru Samarakoon, S. Kumarawadu, K. Pulasinghe
This paper describes a closed domain question answering system which can be used as the first step in automating a customer helpdesk of a commercial organization. Even though there has been an increasing interest in data-driven methods over the past decade to achieve more natural human-machine interactions, such methods require a large amount of manually labeled representative data on how user converses with a machine. However, this is a strong requirement that is difficult to be satisfied in the early phase of system development. The knowledge-based approach that we present here is aimed at maximally making use of the user experience available with the customer services representatives (CSRs) in the organization and hence not relying on application data. The approach takes into account the syntactic, lexical, and morphological variations, as well as a way of synonym transduction that is allowed to vary over the systems knowledgebase. The query understanding method, which is based on a ranking algorithm and a pattern writing process, takes into account the intent, context, and content components of natural language meaning as well as the word order. A genetic algorithm-based method is presented for regularly updating the ranking parameters to adapt to changes in the nature of users' queries over time. We present an evaluation of our system deployed in a real-world enterprise helpdesk environment at Exetel Pty Ltd., Australia.
{"title":"Automated question answering for customer helpdesk applications","authors":"Lahiru Samarakoon, S. Kumarawadu, K. Pulasinghe","doi":"10.1109/ICIINFS.2011.6038089","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038089","url":null,"abstract":"This paper describes a closed domain question answering system which can be used as the first step in automating a customer helpdesk of a commercial organization. Even though there has been an increasing interest in data-driven methods over the past decade to achieve more natural human-machine interactions, such methods require a large amount of manually labeled representative data on how user converses with a machine. However, this is a strong requirement that is difficult to be satisfied in the early phase of system development. The knowledge-based approach that we present here is aimed at maximally making use of the user experience available with the customer services representatives (CSRs) in the organization and hence not relying on application data. The approach takes into account the syntactic, lexical, and morphological variations, as well as a way of synonym transduction that is allowed to vary over the systems knowledgebase. The query understanding method, which is based on a ranking algorithm and a pattern writing process, takes into account the intent, context, and content components of natural language meaning as well as the word order. A genetic algorithm-based method is presented for regularly updating the ranking parameters to adapt to changes in the nature of users' queries over time. We present an evaluation of our system deployed in a real-world enterprise helpdesk environment at Exetel Pty Ltd., Australia.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125590135","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-10-10DOI: 10.1109/ICIINFS.2011.6038077
A. Subashini, N. Kodikara
A method for the off-line recognition of Tamil handwriting characters based on local feature extraction is investigated. In the proposed method each pre-processed character is represented by a set of local SIFT feature vectors. From a large set of SIFT descriptors, the key idea is to create a codebook for each character using K-means clustering algorithm. K-means is an optimisation algorithm but this algorithm takes very long time to converge. We construct an initial codebook by using the Linde Buzo and Gray (LBG) algorithm so that the convergence time for K-means is reduced considerably. Target character is recognised into one of twenty categories by k-nearest neighbour classification. An average recognition rate of 87% on the character level has been achieved in experiments using six thousand training and two thousand testing images of twenty selected characters. Further study may include more characters and more samples being recognised with better classifier.
{"title":"A novel SIFT-based codebook generation for handwritten Tamil character recognition","authors":"A. Subashini, N. Kodikara","doi":"10.1109/ICIINFS.2011.6038077","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038077","url":null,"abstract":"A method for the off-line recognition of Tamil handwriting characters based on local feature extraction is investigated. In the proposed method each pre-processed character is represented by a set of local SIFT feature vectors. From a large set of SIFT descriptors, the key idea is to create a codebook for each character using K-means clustering algorithm. K-means is an optimisation algorithm but this algorithm takes very long time to converge. We construct an initial codebook by using the Linde Buzo and Gray (LBG) algorithm so that the convergence time for K-means is reduced considerably. Target character is recognised into one of twenty categories by k-nearest neighbour classification. An average recognition rate of 87% on the character level has been achieved in experiments using six thousand training and two thousand testing images of twenty selected characters. Further study may include more characters and more samples being recognised with better classifier.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116104351","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-10-10DOI: 10.1109/ICIINFS.2011.6038086
G. Rajakaruna, K. D. Saminda, H. K. S. R.C. Kumara, P. Athukorala, W. Wijayaweera, A. Karunananda
Ontology is becoming popular as a powerful way to structure the knowledge sources for complex systems. Modeling of evolvable ontologies turns out to be a research challenge for many decades. This paper presents how the agent technology can be used to update their ontologies while they are in execution. This solution has been designed to work on a primitive ontology at the beginning. Interaction among the agents updates the ontology as per the user intervention. Protégé and JADE have been used to implement the evolvable ontology and the agents respectively. The solution also uses mobile technology to synchronize the end user communication when the desired users are not connected on to the system at a required time. This amounts to minimize resource utilization by the agent, and also to enable notifications to the inactive team members in a timely manner. The system has been used to organize an exhibition, and shown the power of evolving ontology to communicate previously unseen aspects and also to incorporate emergent needs of a planning task in general. Our solution has been able to effectively update ontologies of end users before they come for a formal meeting.
{"title":"Agent technology to model evolvable ontologies","authors":"G. Rajakaruna, K. D. Saminda, H. K. S. R.C. Kumara, P. Athukorala, W. Wijayaweera, A. Karunananda","doi":"10.1109/ICIINFS.2011.6038086","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038086","url":null,"abstract":"Ontology is becoming popular as a powerful way to structure the knowledge sources for complex systems. Modeling of evolvable ontologies turns out to be a research challenge for many decades. This paper presents how the agent technology can be used to update their ontologies while they are in execution. This solution has been designed to work on a primitive ontology at the beginning. Interaction among the agents updates the ontology as per the user intervention. Protégé and JADE have been used to implement the evolvable ontology and the agents respectively. The solution also uses mobile technology to synchronize the end user communication when the desired users are not connected on to the system at a required time. This amounts to minimize resource utilization by the agent, and also to enable notifications to the inactive team members in a timely manner. The system has been used to organize an exhibition, and shown the power of evolving ontology to communicate previously unseen aspects and also to incorporate emergent needs of a planning task in general. Our solution has been able to effectively update ontologies of end users before they come for a formal meeting.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132681984","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-10-10DOI: 10.1109/ICIINFS.2011.6038046
Ramanujam Sarathi, R. Karpagam
The tracking phenomenon is basically a carbonaceous process, which occurs at the surface of the insulating material during operation. Epoxy nanocomposites have high tracking resistance. Tracking studies were carried out by adopting IEC-587 standards. An attempt has been made to characterize the UHF signal radiated due to discharges during tracking studies. Percentage of clay content in epoxy nanocomposites has not showed any variation in UHF signal generated. It is observed that surface discharges radiates UHF signal with its frequency content lies in the range of 1–3 GHz and at the time of tracking it is in the range of 1–2 GHz. Zero span analysis of UHF signal by using spectrum analyser could help one to identify the point of transition from surface discharge to tracking condition.
{"title":"Understanding the tracking phenomena in epoxy nanocomposites adopting UHF technique","authors":"Ramanujam Sarathi, R. Karpagam","doi":"10.1109/ICIINFS.2011.6038046","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038046","url":null,"abstract":"The tracking phenomenon is basically a carbonaceous process, which occurs at the surface of the insulating material during operation. Epoxy nanocomposites have high tracking resistance. Tracking studies were carried out by adopting IEC-587 standards. An attempt has been made to characterize the UHF signal radiated due to discharges during tracking studies. Percentage of clay content in epoxy nanocomposites has not showed any variation in UHF signal generated. It is observed that surface discharges radiates UHF signal with its frequency content lies in the range of 1–3 GHz and at the time of tracking it is in the range of 1–2 GHz. Zero span analysis of UHF signal by using spectrum analyser could help one to identify the point of transition from surface discharge to tracking condition.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259068","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-10-10DOI: 10.1109/ICIINFS.2011.6038126
N. Kumaresan, M. Subbiah, R. Karthigaivel
Single-phase inductor alternators have been shown to be suitable for use with renewable energy electric conversion systems for small power applications. Since both the field and the ac output winding are on the stator, these alternators, in respect of construction and maintenance, have all the advantages of self-excited induction generators presently being employed with renewable energy sources. An attempt has been made in this paper to modify the stator winding design of conventional inductor alternators, to reduce the field power requirement by reducing the number of field winding coils and also to feed this winding by self-excitation, so that their suitability for the proposed applications could be further enhanced. Taking the induced EMF of a conventional single-phase inductor alternator as the bench mark value, the EMF of the new design is calculated and compared. Such calculations are made by determining the EMF of each coil separately, which leads to the assessment of the number of possible parallel paths of the ac output winding. A simple microcontroller based MOSFET chopper circuit has been developed for the filed current control of the inductor alternator. Test results obtained on an alternator wound with the proposed winding design are presented. A dc motor for initial test purposes and then a bio-mass gasifier based diesel engine to demonstrate the application with renewable energy sources, have been used as prime-movers for the alternator.
{"title":"Single-phase self-excited inductor alternators for renewable energy electric conversion systems","authors":"N. Kumaresan, M. Subbiah, R. Karthigaivel","doi":"10.1109/ICIINFS.2011.6038126","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038126","url":null,"abstract":"Single-phase inductor alternators have been shown to be suitable for use with renewable energy electric conversion systems for small power applications. Since both the field and the ac output winding are on the stator, these alternators, in respect of construction and maintenance, have all the advantages of self-excited induction generators presently being employed with renewable energy sources. An attempt has been made in this paper to modify the stator winding design of conventional inductor alternators, to reduce the field power requirement by reducing the number of field winding coils and also to feed this winding by self-excitation, so that their suitability for the proposed applications could be further enhanced. Taking the induced EMF of a conventional single-phase inductor alternator as the bench mark value, the EMF of the new design is calculated and compared. Such calculations are made by determining the EMF of each coil separately, which leads to the assessment of the number of possible parallel paths of the ac output winding. A simple microcontroller based MOSFET chopper circuit has been developed for the filed current control of the inductor alternator. Test results obtained on an alternator wound with the proposed winding design are presented. A dc motor for initial test purposes and then a bio-mass gasifier based diesel engine to demonstrate the application with renewable energy sources, have been used as prime-movers for the alternator.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552033","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-10-10DOI: 10.1109/ICIINFS.2011.6038113
M. Firdhous, O. Ghazali, S. Hassan
Cloud computing has been considered the new computing paradigm that would make the computing a utility. With the widespread acceptance of cloud computing, computing resources including computational power, storage, development platform and applications will be available as services. Hitherto computing resources were considered capital items and customers used to pay for these resources as for any other product. Cloud computing changes all these and consumers will pay only for what is consumed similar to other services or utilities. When cloud computing becomes more popular, different vendors would provide different services at different levels of qualities and prices. Hence customers will have to identify the differences in quality offered by different service providers and need to select the right service provider based on their requirements. A trust management system will match the service providers and the customers based on the requirements customers and the capabilities of service providers. In this paper, the authors propose a trust management system along with a trust evolution mechanism that can be used to measure the performance of services based on the response time of systems. The proposed mechanism formulates trust scores for different service level requirements based on assurance (confidence) levels. Hence this mechanism is suitable for managing multiple service levels against single trust score for all the service levels. Also the proposed mechanism is adaptive as it continuously modifies the scores based on the performance of the system. The proposed mechanism has been tested in a simulated environment and the results are found to be satisfactory.
{"title":"A trust computing mechanism for cloud computing with multilevel thresholding","authors":"M. Firdhous, O. Ghazali, S. Hassan","doi":"10.1109/ICIINFS.2011.6038113","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038113","url":null,"abstract":"Cloud computing has been considered the new computing paradigm that would make the computing a utility. With the widespread acceptance of cloud computing, computing resources including computational power, storage, development platform and applications will be available as services. Hitherto computing resources were considered capital items and customers used to pay for these resources as for any other product. Cloud computing changes all these and consumers will pay only for what is consumed similar to other services or utilities. When cloud computing becomes more popular, different vendors would provide different services at different levels of qualities and prices. Hence customers will have to identify the differences in quality offered by different service providers and need to select the right service provider based on their requirements. A trust management system will match the service providers and the customers based on the requirements customers and the capabilities of service providers. In this paper, the authors propose a trust management system along with a trust evolution mechanism that can be used to measure the performance of services based on the response time of systems. The proposed mechanism formulates trust scores for different service level requirements based on assurance (confidence) levels. Hence this mechanism is suitable for managing multiple service levels against single trust score for all the service levels. Also the proposed mechanism is adaptive as it continuously modifies the scores based on the performance of the system. The proposed mechanism has been tested in a simulated environment and the results are found to be satisfactory.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114160757","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-10-10DOI: 10.1109/ICIINFS.2011.6038042
Chaminda Namal Senarathne, Shanaka Ransiri, Pushpika Arangala, Asanka Balasooriya, C. De Silva
This paper presents a new algorithm for Image Registration and Stitching. The algorithm is designed to be extremely efficient and fast in its execution and is intended for use in stitching images extracted from a video stream of a camera. This algorithm is not universally applicable to all the image registration and stitching problems. It is customized to be used to generate single images of surfaces such as a conveyor belt or undercarriage of vehicles, which cannot be captured by a single photo. The algorithm works by extracting edges of the two images to be registered. Then it selects a reference section from the first image and search in the second image where it finds the best match for that section. The best match is the east difference score. The section in the second image which gives the least difference score is then identified as the registration point between the two images. The speed of the algorithm is improved by using heuristics to restrict the search space in the second image. We present full details of how the extraction of the heuristic is done from the inputs and how it drastically reduces the execution time of the algorithm. The paper also contains a full section on comparing our algorithm with a set of existing algorithms. Our algorithm outperforms the existing ones for all the common image sizes.
{"title":"A faster image registration and stitching algorithm","authors":"Chaminda Namal Senarathne, Shanaka Ransiri, Pushpika Arangala, Asanka Balasooriya, C. De Silva","doi":"10.1109/ICIINFS.2011.6038042","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038042","url":null,"abstract":"This paper presents a new algorithm for Image Registration and Stitching. The algorithm is designed to be extremely efficient and fast in its execution and is intended for use in stitching images extracted from a video stream of a camera. This algorithm is not universally applicable to all the image registration and stitching problems. It is customized to be used to generate single images of surfaces such as a conveyor belt or undercarriage of vehicles, which cannot be captured by a single photo. The algorithm works by extracting edges of the two images to be registered. Then it selects a reference section from the first image and search in the second image where it finds the best match for that section. The best match is the east difference score. The section in the second image which gives the least difference score is then identified as the registration point between the two images. The speed of the algorithm is improved by using heuristics to restrict the search space in the second image. We present full details of how the extraction of the heuristic is done from the inputs and how it drastically reduces the execution time of the algorithm. The paper also contains a full section on comparing our algorithm with a set of existing algorithms. Our algorithm outperforms the existing ones for all the common image sizes.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376232","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-10-10DOI: 10.1109/ICIINFS.2011.6038127
P. Binduhewa
Traffic light controlled pedestrian crossings are implemented to ensure the safety of pedestrians. This paper presents two methods to reduce the energy consumption of a traffic light system implemented to control the pedestrian crossing. Energy saving is gained by means of new operating sequences for the traffic lamps. Analytical results are presented to compare the energy saving achieved with alternative methods, when compared with standard operating method. Energy storage capacity reduction, when the traffic light system is powered by a photovoltaic panel, is also presented.
{"title":"Alternative operation methods to reduce the energy demand of a traffic light controlled pedestrian crossing","authors":"P. Binduhewa","doi":"10.1109/ICIINFS.2011.6038127","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038127","url":null,"abstract":"Traffic light controlled pedestrian crossings are implemented to ensure the safety of pedestrians. This paper presents two methods to reduce the energy consumption of a traffic light system implemented to control the pedestrian crossing. Energy saving is gained by means of new operating sequences for the traffic lamps. Analytical results are presented to compare the energy saving achieved with alternative methods, when compared with standard operating method. Energy storage capacity reduction, when the traffic light system is powered by a photovoltaic panel, is also presented.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122154431","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
扫码关注我们
求助内容：
应助结果提醒方式：