This paper examines the unique characteristics of 'fatigue' in the context of use of social networks to stay socially connected. Guided by literature on 'fatigue' from within the domains of clinical and occupational studies, the paper uses a combination of in-depth interviews and individual activity logs gathered from members of a selected Facebook community to investigate social network fatigue. Characteristics of the phenomenon are culled from individual user experiences giving rise to negative emotions and/ or a change in activity patterns in the course of use of social networks, so as to derive a working definition of fatigue in the context.
{"title":"Characteristics of Social Network Fatigue","authors":"T. Ravindran, A. Chua, D. Goh","doi":"10.1109/ITNG.2013.66","DOIUrl":"https://doi.org/10.1109/ITNG.2013.66","url":null,"abstract":"This paper examines the unique characteristics of 'fatigue' in the context of use of social networks to stay socially connected. Guided by literature on 'fatigue' from within the domains of clinical and occupational studies, the paper uses a combination of in-depth interviews and individual activity logs gathered from members of a selected Facebook community to investigate social network fatigue. Characteristics of the phenomenon are culled from individual user experiences giving rise to negative emotions and/ or a change in activity patterns in the course of use of social networks, so as to derive a working definition of fatigue in the context.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"154 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":"126933598","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}
Network on chip (NoC) provides a network-based interconnect infrastructure that facilitates the communications among a slew of function cores in a modern System-on-chip (SoC) design. Apart from topology, switching technique and routing strategy adopted in an NoC, flow control scheme that regulates the packet injection rates is another determining factor that impacts the NoC efficiency. In this paper, we propose a Feedback-Based end-to-end congestion control scheme that supports Wireless NoC to make adjustment automatically' upon receiving a feedback message, the source node will adjust its packet size and transmission rate accordingly. Besides, an arbitration optimization strategy, fast-forward scheme is imported to assign higher priority to the downstream flits at the same input port and to the same next output port, thus lighten the resource waste caused by the rest communication tasks. Finally, simulation results indicate the superiority.
{"title":"Flow Control Mechanism for Wireless Network-on-Chip","authors":"Ling Wang, Zhen Wang, Yingtao Jiang","doi":"10.1109/ITNG.2013.81","DOIUrl":"https://doi.org/10.1109/ITNG.2013.81","url":null,"abstract":"Network on chip (NoC) provides a network-based interconnect infrastructure that facilitates the communications among a slew of function cores in a modern System-on-chip (SoC) design. Apart from topology, switching technique and routing strategy adopted in an NoC, flow control scheme that regulates the packet injection rates is another determining factor that impacts the NoC efficiency. In this paper, we propose a Feedback-Based end-to-end congestion control scheme that supports Wireless NoC to make adjustment automatically' upon receiving a feedback message, the source node will adjust its packet size and transmission rate accordingly. Besides, an arbitration optimization strategy, fast-forward scheme is imported to assign higher priority to the downstream flits at the same input port and to the same next output port, thus lighten the resource waste caused by the rest communication tasks. Finally, simulation results indicate the superiority.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"28 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":"123006085","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}
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}
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}
Hanshang Li, Ling Wang, S. Pang, Massood Towhidnejad
Quad-rotor-typed UAV can perform multiple targets detection effectively by its controllability and agility. In this study, the ground multiple targets detection with stochastic distances between the different targets is considered. A target position is described as a two-dimensional coordinate. The all positions' coordinates and the start-point coordinate of UAV are the sources of the algorithm. After some calculating, the algorithm should direct the UAV fly over all targets with the shortest flight line. The algorithm produces an anticipated flight plan based on genetic algorithm, and considered the characteristics of quadrotor. It has a high performance in environment with few interference factors and can be used in a quad-rotor-typed UAV without GPS or any other polarizing means.
{"title":"Path-Finding Algorithm for Ground Multiple Sensor Nodes Detection of Quad-rotor-typed UAV","authors":"Hanshang Li, Ling Wang, S. Pang, Massood Towhidnejad","doi":"10.1109/ITNG.2013.80","DOIUrl":"https://doi.org/10.1109/ITNG.2013.80","url":null,"abstract":"Quad-rotor-typed UAV can perform multiple targets detection effectively by its controllability and agility. In this study, the ground multiple targets detection with stochastic distances between the different targets is considered. A target position is described as a two-dimensional coordinate. The all positions' coordinates and the start-point coordinate of UAV are the sources of the algorithm. After some calculating, the algorithm should direct the UAV fly over all targets with the shortest flight line. The algorithm produces an anticipated flight plan based on genetic algorithm, and considered the characteristics of quadrotor. It has a high performance in environment with few interference factors and can be used in a quad-rotor-typed UAV without GPS or any other polarizing means.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"109 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":"127076893","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}
Using the general guidelines for online teaching and learning as a backdrop, we have investigated best practices that are effective specifically in the context of computer science courses that involve extensive programming and hands-on laboratory explorations. In this paper, we describe our preliminary effort in this direction. More specifically, we describe the strategy we have used in planning, designing, developing, delivering, and assessing the best practices for a course in programming languages.
{"title":"Online Teaching and Learning Strategies for Programming-intensive Courses","authors":"V. Gudivada, R. Agrawal, Chunbo Chu","doi":"10.1109/ITNG.2013.142","DOIUrl":"https://doi.org/10.1109/ITNG.2013.142","url":null,"abstract":"Using the general guidelines for online teaching and learning as a backdrop, we have investigated best practices that are effective specifically in the context of computer science courses that involve extensive programming and hands-on laboratory explorations. In this paper, we describe our preliminary effort in this direction. More specifically, we describe the strategy we have used in planning, designing, developing, delivering, and assessing the best practices for a course in programming languages.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"7 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":"127775361","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}
Blind signature-based electronic voting is the simplest paradigm for implementing remote voting platforms due to the fact that it does not employ complicated zero-knowledge proofs. Unfortunately, the existence of a trusted entity (the "Authentication Server") that, in case of corruption, would be able to cast indistinguishable fake votes reduces the acceptance of the paradigm in non fully trusted environments. Trust on the system can be increased by splitting this entity into of a set of parties that are unlikely to collaborate in a dishonest manner. Nevertheless, this technique increases the risk of failure of some of them causing a service interruption during the voting period. Better fault tolerance is provided by proposals which permit to anticipate the interaction with the distributed authentication server before the voting period begins, so that, in case of failure, there is a broad time margin for system restoration. Previous proposals following this approach have been proven to be cryptographically weak or just provide individual verifiability. In this paper, a system that employs blind certificates is presented. Unlike previous proposals, it provides universal verifiability and permits to detect double voting without putting voters' privacy at risk.
{"title":"Blind Certificates for Secure Electronic Voting","authors":"Víctor Mateu, F. Sebé, M. Valls","doi":"10.1109/ITNG.2013.11","DOIUrl":"https://doi.org/10.1109/ITNG.2013.11","url":null,"abstract":"Blind signature-based electronic voting is the simplest paradigm for implementing remote voting platforms due to the fact that it does not employ complicated zero-knowledge proofs. Unfortunately, the existence of a trusted entity (the \"Authentication Server\") that, in case of corruption, would be able to cast indistinguishable fake votes reduces the acceptance of the paradigm in non fully trusted environments. Trust on the system can be increased by splitting this entity into of a set of parties that are unlikely to collaborate in a dishonest manner. Nevertheless, this technique increases the risk of failure of some of them causing a service interruption during the voting period. Better fault tolerance is provided by proposals which permit to anticipate the interaction with the distributed authentication server before the voting period begins, so that, in case of failure, there is a broad time margin for system restoration. Previous proposals following this approach have been proven to be cryptographically weak or just provide individual verifiability. In this paper, a system that employs blind certificates is presented. Unlike previous proposals, it provides universal verifiability and permits to detect double voting without putting voters' privacy at risk.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"9 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":"116328084","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 adequate 3D visualization is important part of computer simulation systems for recognition of material structures, particularly, in identification of electrical properties of materials by Electrical Tomography. To identify distribution of electrical permittivity inside some space structures we apply General Ray (GR) method and fast algorithm constructed by the author before for the plane case. For this we consider the space domain as assemblage of plane slices. Computer simulation of this 3D scheme is realized as MATLAB software and justified by numerical experiments on examples, related with Electrical Tomography.
{"title":"3D Visualization of Space Distribution of Electrical Characteristics in Compound Structures Reconstructed by General Ray Method","authors":"A. Grebénnikov","doi":"10.1109/ITNG.2013.115","DOIUrl":"https://doi.org/10.1109/ITNG.2013.115","url":null,"abstract":"The adequate 3D visualization is important part of computer simulation systems for recognition of material structures, particularly, in identification of electrical properties of materials by Electrical Tomography. To identify distribution of electrical permittivity inside some space structures we apply General Ray (GR) method and fast algorithm constructed by the author before for the plane case. For this we consider the space domain as assemblage of plane slices. Computer simulation of this 3D scheme is realized as MATLAB software and justified by numerical experiments on examples, related with Electrical Tomography.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"s3-39 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":"130161260","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
扫码关注我们
求助内容：
应助结果提醒方式：