Elica Campochiaro, Riccardo Casatta, P. Cremonesi, R. Turrin
Recommender systems are used to suggest customized products to users. Most recommender algorithms create collaborative models by taking advantage of web user profiles. In the last years, in the area of recommender systems, the Netflix contest has been very attractive for the researchers. However, many recent papers on recommender systems present results evaluated with the methodology used in the Netflix contest in domains where the objectives are different from the contest (e.g., top-N recommendation task). In this paper we do not propose new recommender algorithms but, rather, we compare different aspects of the official Netflix contest methodology based on RMSE and holdout with methodologies based on k-fold and classification accuracy metrics.We show, with case studies, that different evaluation methodologies lead to totally contrasting conclusions about the quality of recommendations.
{"title":"Do Metrics Make Recommender Algorithms?","authors":"Elica Campochiaro, Riccardo Casatta, P. Cremonesi, R. Turrin","doi":"10.1109/WAINA.2009.127","DOIUrl":"https://doi.org/10.1109/WAINA.2009.127","url":null,"abstract":"Recommender systems are used to suggest customized products to users. Most recommender algorithms create collaborative models by taking advantage of web user profiles. In the last years, in the area of recommender systems, the Netflix contest has been very attractive for the researchers. However, many recent papers on recommender systems present results evaluated with the methodology used in the Netflix contest in domains where the objectives are different from the contest (e.g., top-N recommendation task). In this paper we do not propose new recommender algorithms but, rather, we compare different aspects of the official Netflix contest methodology based on RMSE and holdout with methodologies based on k-fold and classification accuracy metrics.We show, with case studies, that different evaluation methodologies lead to totally contrasting conclusions about the quality of recommendations.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116870817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Expected Hop Count (EHC) of a computer communication network has so far been computed for network models that consider only device or link failure, but not both. We introduce an Augmented Ordered Multi-valued Decision Diagram (OMDD-A) to obtain the EHC of a network in which both devices and links may fail. The OMDD-A approach can compute the EHC of a 2´100 grid network with 299 paths, which is unsolvable using existing techniques. We show that OMDD-A generates significantly fewer nodes than the corresponding ordered binary decision diagram, leading to large reductions in processing time.
{"title":"Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem","authors":"J. Herrmann, S. Soh, Geoff A. W. West, S. Rai","doi":"10.1109/WAINA.2009.124","DOIUrl":"https://doi.org/10.1109/WAINA.2009.124","url":null,"abstract":"The Expected Hop Count (EHC) of a computer communication network has so far been computed for network models that consider only device or link failure, but not both. We introduce an Augmented Ordered Multi-valued Decision Diagram (OMDD-A) to obtain the EHC of a network in which both devices and links may fail. The OMDD-A approach can compute the EHC of a 2´100 grid network with 299 paths, which is unsolvable using existing techniques. We show that OMDD-A generates significantly fewer nodes than the corresponding ordered binary decision diagram, leading to large reductions in processing time.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114862480","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}
Patricia Morreale, F. Qi, P. Croft, George Chang, Justin Czarnik, Nick Doell, Jhon Espin, Ryan Suleski
Sensor networks have been deployed for a range of rural and environmental applications. Well-regarded for the volume and range of data which can be obtained, wireless sensor network applications capable of using the data gathered have not been fully realized, particularly in urban settings. Street CORNERS is a wireless sensor network application which supports the contextual presentation of data gathered from an urban setting. The Street CORNERS application offers real-time data display, and provides support for predictive algorithms suitable for anticipating, detecting, and defending urban communities, among others, from environmental threats such as declining air quality and urban flash floods. Street CORNERS is presented in two parts. The network design and deployment is outlined, followed by a discussion of the design of the network application, which is involved in data pre-processing and the contextual presentation of the data gathered for trend identification.
{"title":"Street CORNERS: Real-Time Contextual Representation of Sensor Network Data for Environmental Trend Identification","authors":"Patricia Morreale, F. Qi, P. Croft, George Chang, Justin Czarnik, Nick Doell, Jhon Espin, Ryan Suleski","doi":"10.1109/WAINA.2009.67","DOIUrl":"https://doi.org/10.1109/WAINA.2009.67","url":null,"abstract":"Sensor networks have been deployed for a range of rural and environmental applications. Well-regarded for the volume and range of data which can be obtained, wireless sensor network applications capable of using the data gathered have not been fully realized, particularly in urban settings. Street CORNERS is a wireless sensor network application which supports the contextual presentation of data gathered from an urban setting. The Street CORNERS application offers real-time data display, and provides support for predictive algorithms suitable for anticipating, detecting, and defending urban communities, among others, from environmental threats such as declining air quality and urban flash floods. Street CORNERS is presented in two parts. The network design and deployment is outlined, followed by a discussion of the design of the network application, which is involved in data pre-processing and the contextual presentation of the data gathered for trend identification.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123676500","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}
With the growing demands for computer network communication, it becomes increasingly important to secure the data flow path. The existing research related to security mechanisms only focuses on securing the flow of information in the communication networks. There is a lack of work on improving the performance of networks to meet quality of service (QoS) constrains for various applications. The security mechanisms work by encryption and decryption of the information, but do not consider the optimised use of the network resources. In this paper we propose a Secure Call Admission Control (SCAC) for Multiclass Internet Services (MIS) to combine between security and quality of service. Our proposed Secure Call Admission Control for multiclass internet services enhanced with Malicious Packets Filter (MPF) is a set of technologies and solutions. It enforces security policy and bandwidth compliance on all devices seeking to access network computing resources, in order to limit damage from emerging security threats and to allow network access only to compliant and trusted endpoint devices. This SCAC also provides support for quality of service. High-level simulations and the related results are provided to show the properties of the SCAC.
{"title":"Performance Evaluation of Secure Call Admission Control for Multiclass Internet Services","authors":"A. Al-Haj, J. Mellor, I. Awan","doi":"10.1109/WAINA.2009.80","DOIUrl":"https://doi.org/10.1109/WAINA.2009.80","url":null,"abstract":"With the growing demands for computer network communication, it becomes increasingly important to secure the data flow path. The existing research related to security mechanisms only focuses on securing the flow of information in the communication networks. There is a lack of work on improving the performance of networks to meet quality of service (QoS) constrains for various applications. The security mechanisms work by encryption and decryption of the information, but do not consider the optimised use of the network resources. In this paper we propose a Secure Call Admission Control (SCAC) for Multiclass Internet Services (MIS) to combine between security and quality of service. Our proposed Secure Call Admission Control for multiclass internet services enhanced with Malicious Packets Filter (MPF) is a set of technologies and solutions. It enforces security policy and bandwidth compliance on all devices seeking to access network computing resources, in order to limit damage from emerging security threats and to allow network access only to compliant and trusted endpoint devices. This SCAC also provides support for quality of service. High-level simulations and the related results are provided to show the properties of the SCAC.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115718849","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}
In grid-based routing protocol, one node in a grid is elected as the grid leader. However, in the traditional grid leader election, nodes consume extra energy for election, especially in a high node density environment. In this paper, we propose a triangular power saving routing protocol with power balance (TPSPB) to address this issue. In TPSPB, a grid leader is elected directly without sending control packets as in the traditional grid leader election. Moreover, the proposed triangular route discovery in TPSPB could save more energy for nodes to transmit packets and prolong the network lifetime.
{"title":"Triangular Power Saving Routing Protocol with Power Balance in Mobile Ad Hoc Networks","authors":"Yi-Chao Wu, Chiu-Ching Tuan, Po-Chun Chen","doi":"10.1109/WAINA.2009.35","DOIUrl":"https://doi.org/10.1109/WAINA.2009.35","url":null,"abstract":"In grid-based routing protocol, one node in a grid is elected as the grid leader. However, in the traditional grid leader election, nodes consume extra energy for election, especially in a high node density environment. In this paper, we propose a triangular power saving routing protocol with power balance (TPSPB) to address this issue. In TPSPB, a grid leader is elected directly without sending control packets as in the traditional grid leader election. Moreover, the proposed triangular route discovery in TPSPB could save more energy for nodes to transmit packets and prolong the network lifetime.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129855459","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}
Least Square (LS) channel estimation has been widely used in OFDM (Orthogonal Frequency Division Multiplexing) and OFDMA (Orthogonal Frequency Division Multiplexing Access) systems. However, it's rather sensitive to Guassian white noise. In this paper, we present a new algorithm which deals with the LS estimation results through wavelet shrinkage denoising based on Stein’s unbiased risk estimation (SURE) criterion. This algorithm can effectively remove the influence of noise in the channels and minimize the estimation risk. Consequently, the sensitivity to noise of LS estimation is diminished. Simulation in the scenario of IEEE802.16 downlink transmission shows that the proposed algorithm has significant advantage over LS and modified LS estimators.
{"title":"Improved Channel Estimation Using Wavelet Denoising for OFDM and OFDMA Systems","authors":"Xue Wang, Linjing Zhao, Jiandong Li","doi":"10.1109/WAINA.2009.51","DOIUrl":"https://doi.org/10.1109/WAINA.2009.51","url":null,"abstract":"Least Square (LS) channel estimation has been widely used in OFDM (Orthogonal Frequency Division Multiplexing) and OFDMA (Orthogonal Frequency Division Multiplexing Access) systems. However, it's rather sensitive to Guassian white noise. In this paper, we present a new algorithm which deals with the LS estimation results through wavelet shrinkage denoising based on Stein’s unbiased risk estimation (SURE) criterion. This algorithm can effectively remove the influence of noise in the channels and minimize the estimation risk. Consequently, the sensitivity to noise of LS estimation is diminished. Simulation in the scenario of IEEE802.16 downlink transmission shows that the proposed algorithm has significant advantage over LS and modified LS estimators.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125544790","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}
In wireless sensor node battery power and memory is available in limited amount. The computing devices available in the sensor nodes are not capable enough to execute complex algorithm. Moreover, several retransmissions of data packets are done to compensate lost packet due to buffer overflow. The algorithm of buffer management policies of conventional data network cannot be applied in sensor network, because they are too complex to be implemented in low computation capable sensor nodes. There are many aspect of this paper, firstly we proposed to classify the packets into different categories and then we proposed the prioritized buffer management policy for different category uniquely. Currently, the CMU priority queue system available with the default DSR algorithm is being used in wireless sensor network. Our analysis and simulation studies show that our policies can be used to save all critically important packets. The other results indicate that our proposed algorithm outperform the CMU priority queue management available with DSR protocol.
{"title":"Prioritized Buffer Management Policy for Wireless Sensor Nodes","authors":"Weihuan Shu, K. Padmanabh, Puneet Gupta","doi":"10.1109/WAINA.2009.131","DOIUrl":"https://doi.org/10.1109/WAINA.2009.131","url":null,"abstract":"In wireless sensor node battery power and memory is available in limited amount. The computing devices available in the sensor nodes are not capable enough to execute complex algorithm. Moreover, several retransmissions of data packets are done to compensate lost packet due to buffer overflow. The algorithm of buffer management policies of conventional data network cannot be applied in sensor network, because they are too complex to be implemented in low computation capable sensor nodes. There are many aspect of this paper, firstly we proposed to classify the packets into different categories and then we proposed the prioritized buffer management policy for different category uniquely. Currently, the CMU priority queue system available with the default DSR algorithm is being used in wireless sensor network. Our analysis and simulation studies show that our policies can be used to save all critically important packets. The other results indicate that our proposed algorithm outperform the CMU priority queue management available with DSR protocol.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128654274","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}
R. Higa, Kosuke Matsubara, T. Okamawari, Saneyasu Yamaguchi, M. Oguchi
iSCSI has a problem of drastic performance deterioration in the case of longer-latency. Thus, we have optimized iSCSI remote storage access through multiple layers. As a result, when RTT is 32ms, performance of the optimized iSCSI has achieved quadruple of that of the default iSCSI. Moreover, we have constructed the model of iSCSI sequential access and analyzed the factor of iSCSI performance deterioration.
{"title":"Optimization of iSCSI Remote Storage Access through Multiple Layers","authors":"R. Higa, Kosuke Matsubara, T. Okamawari, Saneyasu Yamaguchi, M. Oguchi","doi":"10.1109/WAINA.2009.61","DOIUrl":"https://doi.org/10.1109/WAINA.2009.61","url":null,"abstract":"iSCSI has a problem of drastic performance deterioration in the case of longer-latency. Thus, we have optimized iSCSI remote storage access through multiple layers. As a result, when RTT is 32ms, performance of the optimized iSCSI has achieved quadruple of that of the default iSCSI. Moreover, we have constructed the model of iSCSI sequential access and analyzed the factor of iSCSI performance deterioration.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"47 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007652","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}
Guanchen Chen, Matthew F. Johnson, Pavan Roy Marupally, Naveen K. Singireddy, Xin Yin, V. Paruchuri
Cyber-squatting is fast becoming a threat to the future viability of Internet commerce. Fraudulent abuse of domain name registration is at the core of cybersquatting. By registering domain names similar to famous brands, cybersquatters lure consumers into purchasing counterfeit products, cause them to reveal their personally identifiable information, and expose themselves to spyware. Typosquatting is registering domain names that are typographical mistakes on popular and common domains. To the best of our knowledge, no solution has been proposed to thwart typosquatting. In this paper, we propose and implement Anti Typo Squatting Tool (ATST), an extension to Internet browsers that could detect and warn users of any possible typos. Through extensive analysis and evaluation, we show that ATST can detect up to 85% of user typos. Further, ATST is lightweight, and is able to check for typos and provide possible suggestions in as little as 300ms.
{"title":"Combating Typo-Squatting for Safer Browsing","authors":"Guanchen Chen, Matthew F. Johnson, Pavan Roy Marupally, Naveen K. Singireddy, Xin Yin, V. Paruchuri","doi":"10.1109/WAINA.2009.98","DOIUrl":"https://doi.org/10.1109/WAINA.2009.98","url":null,"abstract":"Cyber-squatting is fast becoming a threat to the future viability of Internet commerce. Fraudulent abuse of domain name registration is at the core of cybersquatting. By registering domain names similar to famous brands, cybersquatters lure consumers into purchasing counterfeit products, cause them to reveal their personally identifiable information, and expose themselves to spyware. Typosquatting is registering domain names that are typographical mistakes on popular and common domains. To the best of our knowledge, no solution has been proposed to thwart typosquatting. In this paper, we propose and implement Anti Typo Squatting Tool (ATST), an extension to Internet browsers that could detect and warn users of any possible typos. Through extensive analysis and evaluation, we show that ATST can detect up to 85% of user typos. Further, ATST is lightweight, and is able to check for typos and provide possible suggestions in as little as 300ms.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758098","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}
Matthew Smith, C. Schridde, Björn Agel, Bernd Freisleben
In this paper, an identity-based key agreement system for mobile telephony in GSM and UMTS networks is presented. The use of telephone numbers as public keys allows the system to piggyback much of the security overhead for key management to the existing GSM or UMTS infrastructure. The proposed approach offers solutions to the problems of multi-domain key generation, key distribution, multi-domain public parameter distribution and inter-domain key agreement.
{"title":"Identity-Based Cryptography for Securing Mobile Phone Calls","authors":"Matthew Smith, C. Schridde, Björn Agel, Bernd Freisleben","doi":"10.1109/WAINA.2009.167","DOIUrl":"https://doi.org/10.1109/WAINA.2009.167","url":null,"abstract":"In this paper, an identity-based key agreement system for mobile telephony in GSM and UMTS networks is presented. The use of telephone numbers as public keys allows the system to piggyback much of the security overhead for key management to the existing GSM or UMTS infrastructure. The proposed approach offers solutions to the problems of multi-domain key generation, key distribution, multi-domain public parameter distribution and inter-domain key agreement.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115737845","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
扫码关注我们
求助内容：
应助结果提醒方式：