Andrés F. Solano, C. Collazos, Cristian Rusu, Luis Merchán
The evaluation of the usability of an interactive system is one of the most important steps in the user-centered design approach. Usability evaluation methods are quite diverse and many of them may be used to evaluate Interactive Digital Television (iTV) applications. Questions arise when deciding which method and/or combination of methods give more (relevant) information. Three iTV applications have been evaluated, applying several usability evaluation methods. Based on the effectiveness and efficiency of these methods, this paper proposes a methodology to evaluate the usability of iTV applications.
{"title":"Evaluating the Usability of Interactive Digital Television Applications","authors":"Andrés F. Solano, C. Collazos, Cristian Rusu, Luis Merchán","doi":"10.1109/ITNG.2013.24","DOIUrl":"https://doi.org/10.1109/ITNG.2013.24","url":null,"abstract":"The evaluation of the usability of an interactive system is one of the most important steps in the user-centered design approach. Usability evaluation methods are quite diverse and many of them may be used to evaluate Interactive Digital Television (iTV) applications. Questions arise when deciding which method and/or combination of methods give more (relevant) information. Three iTV applications have been evaluated, applying several usability evaluation methods. Based on the effectiveness and efficiency of these methods, this paper proposes a methodology to evaluate the usability of iTV applications.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134443597","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 this paper, we present our continuous work on designing an algorithm to find nearest neighbors to given queries. In our previous work, we analyze the situation that there are multiple queries with different level of importance, and define a weight for each query point. We also propose an algorithm to find nearest neighbors to multiple queries with weights and enhanced our algorithm based on query point distribution. In this paper we analyze the data distribution on various dimensions, and apply the shrinking concept for the improvement and enhancement of our multi-query search approach.
{"title":"Similarity Search Problem Research on Multi-dimensional Data Sets","authors":"Yong Shi, Brian Graham","doi":"10.1109/ITNG.2013.72","DOIUrl":"https://doi.org/10.1109/ITNG.2013.72","url":null,"abstract":"In this paper, we present our continuous work on designing an algorithm to find nearest neighbors to given queries. In our previous work, we analyze the situation that there are multiple queries with different level of importance, and define a weight for each query point. We also propose an algorithm to find nearest neighbors to multiple queries with weights and enhanced our algorithm based on query point distribution. In this paper we analyze the data distribution on various dimensions, and apply the shrinking concept for the improvement and enhancement of our multi-query search approach.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128506329","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 the a priori L2 error analysis of the finite element method (FEM), the Aubin-Nitsche trick is often used. Usually, the convergence order of the L2 error estimates by the Aubin-Nitsche trick is one order higher than the H01 error estimates. As is well known, the convergence order obtained by this technique depends on the shape of the domain because it is dependent on the regularity of solutions for the associated dual problem on the same domain. In this paper, we introduce a technique for getting the optimal order L2 error estimates on the L-shaped domain without Aubin-Nitsche trick. From the numerical evidence based on the guaranteed computations, we could still expect that such a domain dependency is not essential.
{"title":"Some Remarks on the Optimal Error Estimates for the Finite Element Method on the L-Shaped Domain","authors":"T. Kinoshita, M. Nakao","doi":"10.1109/ITNG.2013.30","DOIUrl":"https://doi.org/10.1109/ITNG.2013.30","url":null,"abstract":"In the a priori L2 error analysis of the finite element method (FEM), the Aubin-Nitsche trick is often used. Usually, the convergence order of the L2 error estimates by the Aubin-Nitsche trick is one order higher than the H01 error estimates. As is well known, the convergence order obtained by this technique depends on the shape of the domain because it is dependent on the regularity of solutions for the associated dual problem on the same domain. In this paper, we introduce a technique for getting the optimal order L2 error estimates on the L-shaped domain without Aubin-Nitsche trick. From the numerical evidence based on the guaranteed computations, we could still expect that such a domain dependency is not essential.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130649059","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}
Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this paper, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose an algorithm for identifying redundant nodes. We test the performance of proposed filtering algorithm on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.
{"title":"Node Filtering and Face Routing for Sensor Network","authors":"L. Gewali, Umang Amatya","doi":"10.1109/ITNG.2013.106","DOIUrl":"https://doi.org/10.1109/ITNG.2013.106","url":null,"abstract":"Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this paper, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose an algorithm for identifying redundant nodes. We test the performance of proposed filtering algorithm on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130213357","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. Dubey, Sujata Bhatia, M. Hanmandlu, S. Vasikarla
A new multilevel thresholding technique using bacterial foraging is proposed for the first time for the segmentation of masses in digital mammograms. The optimal thresholds are found by maximizing Kapur's entropy and also Otsu's thresholding function using BF algorithm. The performance of the proposed algorithm has been evaluated on 20 malignant mammogram images and the results are promising.
{"title":"Breast Cancer Segmentation Using Bacterial Foraging Algorithm","authors":"R. Dubey, Sujata Bhatia, M. Hanmandlu, S. Vasikarla","doi":"10.1109/ITNG.2013.88","DOIUrl":"https://doi.org/10.1109/ITNG.2013.88","url":null,"abstract":"A new multilevel thresholding technique using bacterial foraging is proposed for the first time for the segmentation of masses in digital mammograms. The optimal thresholds are found by maximizing Kapur's entropy and also Otsu's thresholding function using BF algorithm. The performance of the proposed algorithm has been evaluated on 20 malignant mammogram images and the results are promising.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125361807","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}
Undergraduate CS courses involve a range of design and development experiences which are often brought together in a comprehensive way as a capstone project in a student's senior year. The goal of a capstone experience is to help students demonstrate that they can integrate various CS skills they have been taught in a practical way. The importance of being able to apply what a student has learned in a practical way as a student prepares to graduate and enter the workforce cannot be overstated. We have developed a Capstone Course project where students build a social networking application using ASP.NET MVC to integrate skills learned in Programming Principles, Software Engineering, Database Design and Web Design courses. And we believe this type of project can serve as a model that can be applied in many different schools and contexts. Because the MVC pattern is used, each part of the system is modular, with the model, the view and the controller requiring different sets of skills. Students can apply their skills to implementing the entire framework themselves as it is presented to them, or they can redesign portions of the framework and integrate their redesign into the original architecture. Either way, students experience the integration of a wide variety of skills in a compelling way since they are doing so while building a social networking application that they can test on their friends.
{"title":"Teaching Students to Design and Implement Social Networks Using MVC as a Capstone Experience","authors":"A. Shaw","doi":"10.1109/ITNG.2013.137","DOIUrl":"https://doi.org/10.1109/ITNG.2013.137","url":null,"abstract":"Undergraduate CS courses involve a range of design and development experiences which are often brought together in a comprehensive way as a capstone project in a student's senior year. The goal of a capstone experience is to help students demonstrate that they can integrate various CS skills they have been taught in a practical way. The importance of being able to apply what a student has learned in a practical way as a student prepares to graduate and enter the workforce cannot be overstated. We have developed a Capstone Course project where students build a social networking application using ASP.NET MVC to integrate skills learned in Programming Principles, Software Engineering, Database Design and Web Design courses. And we believe this type of project can serve as a model that can be applied in many different schools and contexts. Because the MVC pattern is used, each part of the system is modular, with the model, the view and the controller requiring different sets of skills. Students can apply their skills to implementing the entire framework themselves as it is presented to them, or they can redesign portions of the framework and integrate their redesign into the original architecture. Either way, students experience the integration of a wide variety of skills in a compelling way since they are doing so while building a social networking application that they can test on their friends.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125590101","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}
White box cryptography deals with content protection scenarios where software decrypts some contents, using a secret key (embedded in the code in some obfuscated way), while the adversary has access to the code and its execution. Obviously, performance is slowed down by the obfuscation overheads. This paper demonstrates a method for using Intel's New AES Instructions to write decryption code without directly using the cipher key or any of the round keys in a register (or in memory). Such implementation can enjoy some of the performance benefits that the AES instructions offer. We show an example where it is more than 2.5 times faster than a lookup table based alternative.
{"title":"White Box AES Using Intel's New AES Instructions","authors":"S. Gueron","doi":"10.1109/ITNG.2013.64","DOIUrl":"https://doi.org/10.1109/ITNG.2013.64","url":null,"abstract":"White box cryptography deals with content protection scenarios where software decrypts some contents, using a secret key (embedded in the code in some obfuscated way), while the adversary has access to the code and its execution. Obviously, performance is slowed down by the obfuscation overheads. This paper demonstrates a method for using Intel's New AES Instructions to write decryption code without directly using the cipher key or any of the round keys in a register (or in memory). Such implementation can enjoy some of the performance benefits that the AES instructions offer. We show an example where it is more than 2.5 times faster than a lookup table based alternative.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021339","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}
This paper focuses on mastering the architecture development of hardware multi-processors for modern highly demanding applications. It presents the results of our analysis of the main issues to be addressed when designing multi-processors for such applications, and discusses our new multi-processor design method which developed to address these issues. We implemented the method in the form of an automatic design exploration tool. Using this tool we performed a large set of design experiments. The experiments demonstrated that without adequately addressing of the discussed design issues it is virtually impossible to construct high-quality hardware multi-processors, and that our design method adequately addresses them.
{"title":"Hardware Multi-processor Design for Highly-Demanding Applications","authors":"L. Józwiak, Y. Jan","doi":"10.1109/ITNG.2013.33","DOIUrl":"https://doi.org/10.1109/ITNG.2013.33","url":null,"abstract":"This paper focuses on mastering the architecture development of hardware multi-processors for modern highly demanding applications. It presents the results of our analysis of the main issues to be addressed when designing multi-processors for such applications, and discusses our new multi-processor design method which developed to address these issues. We implemented the method in the form of an automatic design exploration tool. Using this tool we performed a large set of design experiments. The experiments demonstrated that without adequately addressing of the discussed design issues it is virtually impossible to construct high-quality hardware multi-processors, and that our design method adequately addresses them.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726064","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}
During a penetration test there is many different tools used for every step of the test. These steps are done for every penetration test that a company performs. The tools used are focused towards a specific area of the penetration test that range from information gathering to exploitation. This paper introduces scripting certain tools that are used often to make the process more efficient and effective for both the tester and the customer.
{"title":"Improving the Efficiency and Effectiveness of Penetration Test Automation","authors":"Kevin P. Haubris, Joshua J. Pauli","doi":"10.1109/ITNG.2013.135","DOIUrl":"https://doi.org/10.1109/ITNG.2013.135","url":null,"abstract":"During a penetration test there is many different tools used for every step of the test. These steps are done for every penetration test that a company performs. The tools used are focused towards a specific area of the penetration test that range from information gathering to exploitation. This paper introduces scripting certain tools that are used often to make the process more efficient and effective for both the tester and the customer.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122165017","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}
Rice is one of the major crops feeding the world population and is one of the most substantial ingredients in the food security chain. Therefore, a reliable forecast of rice production would have a predominant impact on assessing the world food security. In this paper we develop models to forecast the wet land rice production in two provinces of Indonesia. The four-monthly data are used to construct and develop the forecasting models. To forecast the rice production, we first forecast the harvested area and the yield. We then use a mathematical model to estimate the rice production in terms of the harvested area and yield. The proposed models are used to forecast the recorded data. The error of the forecasted data are analysed to assess the efficacy of the models. The analysis of the errors shows that ARIMA(p, q, d)) and Bayesian models are the best models for forecasting harvested area and yield. However, the results clearly indicate that the optimal model for one province it not necessarily the best model for the other province.
水稻是养活世界人口的主要作物之一，也是粮食安全链中最重要的成分之一。因此，对水稻产量的可靠预测将对评估世界粮食安全产生重大影响。本文建立了印度尼西亚两个省的旱地水稻产量预测模型。利用4个月的数据构建和发展预测模型。为了预测水稻产量，我们首先预测收获面积和产量。然后，我们使用一个数学模型来估计水稻的收获面积和产量。所提出的模型用于预测记录数据。对预测数据的误差进行了分析，以评价模型的有效性。误差分析表明，ARIMA(p, q, d))和贝叶斯模型是预测收获面积和产量的最佳模型。然而，结果清楚地表明，一个省的最优模型不一定是另一个省的最佳模型。
{"title":"Forecasting Wet Land Rice Production for Food Security","authors":"Abdollahian M, Lasmini L","doi":"10.1109/ITNG.2013.92","DOIUrl":"https://doi.org/10.1109/ITNG.2013.92","url":null,"abstract":"Rice is one of the major crops feeding the world population and is one of the most substantial ingredients in the food security chain. Therefore, a reliable forecast of rice production would have a predominant impact on assessing the world food security. In this paper we develop models to forecast the wet land rice production in two provinces of Indonesia. The four-monthly data are used to construct and develop the forecasting models. To forecast the rice production, we first forecast the harvested area and the yield. We then use a mathematical model to estimate the rice production in terms of the harvested area and yield. The proposed models are used to forecast the recorded data. The error of the forecasted data are analysed to assess the efficacy of the models. The analysis of the errors shows that ARIMA(p, q, d)) and Bayesian models are the best models for forecasting harvested area and yield. However, the results clearly indicate that the optimal model for one province it not necessarily the best model for the other province.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114070596","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
扫码关注我们
求助内容：
应助结果提醒方式：