We have measured the affective value of 14 different varieties of drum-rhythm patterns by applying the affective value scale of music (AVSM). The results that we obtained, from a single-factor analysis of variance, a multivariate analysis of variance, and a correlation analysis, suggest that the number of snare-drum beats (high pitch) and bass-drum beats (low pitch) in one measure influences the affective value in respect of elation, lightness, and solemnity. An increased number of snare-drum beats in one measure leads to an increase in the affective value of elation (described as cheerful and bright), as well as the affective value of lightness (described as light and restless). In addition, the results revealed that an increased number of bass-drum beats in one measure leads to an increase in the affective value of solemnity (described as solemn and dignified).
{"title":"Measurement and Classification of the Affective Value of Drum Rhythm Patterns","authors":"Yuta Kurotaki, H. Shiizuka","doi":"10.1109/INCoS.2011.116","DOIUrl":"https://doi.org/10.1109/INCoS.2011.116","url":null,"abstract":"We have measured the affective value of 14 different varieties of drum-rhythm patterns by applying the affective value scale of music (AVSM). The results that we obtained, from a single-factor analysis of variance, a multivariate analysis of variance, and a correlation analysis, suggest that the number of snare-drum beats (high pitch) and bass-drum beats (low pitch) in one measure influences the affective value in respect of elation, lightness, and solemnity. An increased number of snare-drum beats in one measure leads to an increase in the affective value of elation (described as cheerful and bright), as well as the affective value of lightness (described as light and restless). In addition, the results revealed that an increased number of bass-drum beats in one measure leads to an increase in the affective value of solemnity (described as solemn and dignified).","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124584960","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}
Typical problems related to the application of proportional fairness are sparsity of the relation with increasing dimension, and the operator confusion problem. Here, we propose a new fairness relation derived from proportional fairness to handle these problems. The design principle behind this relation is relational unsorting: if there is a relation x(R)y between elements x and y from n-dimensional Euclidian space, the unsorted relation x(uR)y holds whenever there is a permutation x* of the elements of x for which x*(R)y holds. We apply this concept to proportional fairness, study the properties of the new relation, contrast with another relation based on over-sorting proportional fairness, and provide simulations to demonstrate the ease of ordered proportional fairness for meta-heuristic search.
{"title":"Unsorting the Proportional Fairness Relation","authors":"M. Köppen, Kaori Yoshida, M. Tsuru","doi":"10.1109/INCoS.2011.159","DOIUrl":"https://doi.org/10.1109/INCoS.2011.159","url":null,"abstract":"Typical problems related to the application of proportional fairness are sparsity of the relation with increasing dimension, and the operator confusion problem. Here, we propose a new fairness relation derived from proportional fairness to handle these problems. The design principle behind this relation is relational unsorting: if there is a relation x(R)y between elements x and y from n-dimensional Euclidian space, the unsorted relation x(uR)y holds whenever there is a permutation x* of the elements of x for which x*(R)y holds. We apply this concept to proportional fairness, study the properties of the new relation, contrast with another relation based on over-sorting proportional fairness, and provide simulations to demonstrate the ease of ordered proportional fairness for meta-heuristic search.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014320","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}
Yulong Shen, Qingqi Pei, Ning Xi, Jianfeng Ma, Qijian Xu, H. Yin
With the fast growth of various mobile terminals, the heterogeneous terminals that have different capabilities and resources are required and mixed in the deployment. Using this feature, we can improve the routing protocol. The available routing protocols for mobile Ad Hoc networks are designed mainly for homogeneous wireless networks. The heterogeneous wireless networks are now needed urgently in many important applications. However, rare dedicated routing protocols are available yet for mixed deployment scenarios for heterogeneous nodes. In this paper, such a protocol, namely Hybrid Grid Routing Protocol (HGRP), is proposed. The main idea of HGRP is to properly divide the network deployment area into grids according to the location, each of which contains one backbone routing node and some ordinary nodes. The key design issues of this new protocol, including grid division, local routing within one grid, and global routing among grids, will be introduced. Extensive ns-2 based simulation results indicate that in comparison with adopting AODV and ZRP protocols directly for routing in a heterogeneous wireless networks, applying the new HGRP protocol can offer us the advantages of a lower routing cost and lower energy consumption.
{"title":"HGRP: Hybrid Grid Routing Protocol for Heterogeneous Hierarchical Wireless Networks","authors":"Yulong Shen, Qingqi Pei, Ning Xi, Jianfeng Ma, Qijian Xu, H. Yin","doi":"10.1109/INCoS.2011.100","DOIUrl":"https://doi.org/10.1109/INCoS.2011.100","url":null,"abstract":"With the fast growth of various mobile terminals, the heterogeneous terminals that have different capabilities and resources are required and mixed in the deployment. Using this feature, we can improve the routing protocol. The available routing protocols for mobile Ad Hoc networks are designed mainly for homogeneous wireless networks. The heterogeneous wireless networks are now needed urgently in many important applications. However, rare dedicated routing protocols are available yet for mixed deployment scenarios for heterogeneous nodes. In this paper, such a protocol, namely Hybrid Grid Routing Protocol (HGRP), is proposed. The main idea of HGRP is to properly divide the network deployment area into grids according to the location, each of which contains one backbone routing node and some ordinary nodes. The key design issues of this new protocol, including grid division, local routing within one grid, and global routing among grids, will be introduced. Extensive ns-2 based simulation results indicate that in comparison with adopting AODV and ZRP protocols directly for routing in a heterogeneous wireless networks, applying the new HGRP protocol can offer us the advantages of a lower routing cost and lower energy consumption.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116000963","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 extended power consumption laxity-based (EPCLB) algorithm is discussed for reducing the total power consumption of servers in general type applications in this paper. However, each time a load balancer receives a new request, the load balancer has to collect the state on computation and transmission laxities of processes and traffic in each server and estimate the power consumption to perform the request. Since the state of each server might be changed during estimation to perform the request, it is difficult to correctly estimate the power consumption. In this paper, we improve the EPCLB algorithm so that the total power consumption of servers and the communication overhead of a load balancer can be reduced. We evaluate the improved EPCLB (IEPCLB) algorithm compared with the EPCLB and round-robin (RR) algorithms.
{"title":"Evaluation of the Improved EPCLB Algorithm for Distributed Applications","authors":"T. Enokido, M. Takizawa","doi":"10.1109/INCoS.2011.88","DOIUrl":"https://doi.org/10.1109/INCoS.2011.88","url":null,"abstract":"The extended power consumption laxity-based (EPCLB) algorithm is discussed for reducing the total power consumption of servers in general type applications in this paper. However, each time a load balancer receives a new request, the load balancer has to collect the state on computation and transmission laxities of processes and traffic in each server and estimate the power consumption to perform the request. Since the state of each server might be changed during estimation to perform the request, it is difficult to correctly estimate the power consumption. In this paper, we improve the EPCLB algorithm so that the total power consumption of servers and the communication overhead of a load balancer can be reduced. We evaluate the improved EPCLB (IEPCLB) algorithm compared with the EPCLB and round-robin (RR) algorithms.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116938531","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 discusses future Near Field Communication (NFC) directions focusing on its communication protocols, by which a contact less IC-card can become a part of the future network infrastructure. The current standardized handshake protocol can be improved in terms of performance by the proposed methods keeping the backward compatibility to the standards. The improvement is obtained by combining the plural layers of communication, and is confirmed by the analysis and simulation.
{"title":"Protocol Enhancement for Near Field Communication (NFC): Future Direction and Cross-Layer Approach","authors":"H. Sakai, A. Arutaki","doi":"10.1109/INCoS.2011.139","DOIUrl":"https://doi.org/10.1109/INCoS.2011.139","url":null,"abstract":"This paper discusses future Near Field Communication (NFC) directions focusing on its communication protocols, by which a contact less IC-card can become a part of the future network infrastructure. The current standardized handshake protocol can be improved in terms of performance by the proposed methods keeping the backward compatibility to the standards. The improvement is obtained by combining the plural layers of communication, and is confirmed by the analysis and simulation.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139910","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 rising of services and applications, are delivered from the cloud over to the next-generation networks now. Smart Travel design to help traveler capture the moment emotion memory and process all this data around user, and turn it into not just helpful information, or even personalized knowledge. Our system is also designed to develop the tourism industries could appealing to different customer segments, a new opportunity of business model, and provide of these innovative and desirable communications, information and entertainment applications and services. In this paper, we introduce a new ubiquitous tourism system based on SNS, IoT, and UGC, which we call it as Smart-Travel system. According to the cloud-based service¡¦s needs, we design a new way to look up the travel information. By thronging smart-phone, GPS, Google map, and AR, we provide a whole new experience in traveling for mobile phone users.
{"title":"A Smart-Travel System Based on Social Network Service for Cloud Environment","authors":"J. C. Hung, V. Hsu, Yu-Bing Wang","doi":"10.1109/INCoS.2011.38","DOIUrl":"https://doi.org/10.1109/INCoS.2011.38","url":null,"abstract":"The rising of services and applications, are delivered from the cloud over to the next-generation networks now. Smart Travel design to help traveler capture the moment emotion memory and process all this data around user, and turn it into not just helpful information, or even personalized knowledge. Our system is also designed to develop the tourism industries could appealing to different customer segments, a new opportunity of business model, and provide of these innovative and desirable communications, information and entertainment applications and services. In this paper, we introduce a new ubiquitous tourism system based on SNS, IoT, and UGC, which we call it as Smart-Travel system. According to the cloud-based service¡¦s needs, we design a new way to look up the travel information. By thronging smart-phone, GPS, Google map, and AR, we provide a whole new experience in traveling for mobile phone users.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227575","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 proposes an efficient contents sharing strategy using differences between their versions in Peer-to-Peer (P2P) networks. In this strategy, when a user requests a content item, he/she can get it by retrieving the other version of the content item and the difference from the requested version of the item, if the obtaining cost of the requested version of the content item is expensive. Furthermore, each content item is divided into several small blocks in order to be stored in the storages of peers without small and futile empty spaces.
{"title":"Efficient Contents Sharing Using Differences between Versions in Peer-to-Peer Networks","authors":"Toshinobu Hayashi, S. Sugawara, Y. Ishibashi","doi":"10.1109/INCoS.2011.80","DOIUrl":"https://doi.org/10.1109/INCoS.2011.80","url":null,"abstract":"This paper proposes an efficient contents sharing strategy using differences between their versions in Peer-to-Peer (P2P) networks. In this strategy, when a user requests a content item, he/she can get it by retrieving the other version of the content item and the difference from the requested version of the item, if the obtaining cost of the requested version of the content item is expensive. Furthermore, each content item is divided into several small blocks in order to be stored in the storages of peers without small and futile empty spaces.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125719395","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}
Miguel Ángel Conde González, F. García-Peñalvo, M. A. Forment
Achieving success in the application of Information and Communications Technology to teaching and learning processes can be challenging. One possible reason for this is the failure to take into account the student as end-user when implementing technologies. In particular, student requirements to access different sources of information and collaborate with other students during their learning can be constrained by the nature of institutional technology which presents barriers to integrating formal and informal learning: students do not only learn in the institutional context but from their experiences throughout the course of daily life. Institutional Learning Management Systems are not enough to meet these needs for increased integration of informal learning, technological practice and formal learning. The efforts to develop effective Personal Learning Environments attempt to solve this, providing a space where students can use the tools they want. But this presents a problem with regard to the management and measurement of learning success. This paper poses some interoperability scenarios to allow the assessment of the personalized informal activity, and in this way, obtain measurable information about the advantages of personalization in Learning.
{"title":"Interoperability Scenarios to Measure Informal Learning Carried Out in PLEs","authors":"Miguel Ángel Conde González, F. García-Peñalvo, M. A. Forment","doi":"10.1109/INCOS.2011.104","DOIUrl":"https://doi.org/10.1109/INCOS.2011.104","url":null,"abstract":"Achieving success in the application of Information and Communications Technology to teaching and learning processes can be challenging. One possible reason for this is the failure to take into account the student as end-user when implementing technologies. In particular, student requirements to access different sources of information and collaborate with other students during their learning can be constrained by the nature of institutional technology which presents barriers to integrating formal and informal learning: students do not only learn in the institutional context but from their experiences throughout the course of daily life. Institutional Learning Management Systems are not enough to meet these needs for increased integration of informal learning, technological practice and formal learning. The efforts to develop effective Personal Learning Environments attempt to solve this, providing a space where students can use the tools they want. But this presents a problem with regard to the management and measurement of learning success. This paper poses some interoperability scenarios to allow the assessment of the personalized informal activity, and in this way, obtain measurable information about the advantages of personalization in Learning.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126417749","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}
Igli Tafa, E. Beqiri, Hakik Paci, Elinda Kajo, A. Xhuvani
In this paper the authors evaluate the CPU Consumption, Memory Utilization and Transfer Time between 5 Hypervisors XEN-PV, XEN-HVM, OpenVZ, KVM-FV and KVM-PV by using FTP and HTTP approaches. All the results are compared with the Real Environment. From the experimental results, the authors have concluded that OpenVZ and XEN-PV have better performance than other hypervisors. The worse performance is for KVM Hypervisor. In our paper we have used some scripts in order to evaluate the performance of these Hypervisors
{"title":"The Evaluation of Transfer Time, CPU Consumption and Memory Utilization in XEN-PV, XEN-HVM, OpenVZ, KVM-FV and KVM-PV Hypervisors Using FTP and HTTP Approaches","authors":"Igli Tafa, E. Beqiri, Hakik Paci, Elinda Kajo, A. Xhuvani","doi":"10.1109/INCoS.2011.164","DOIUrl":"https://doi.org/10.1109/INCoS.2011.164","url":null,"abstract":"In this paper the authors evaluate the CPU Consumption, Memory Utilization and Transfer Time between 5 Hypervisors XEN-PV, XEN-HVM, OpenVZ, KVM-FV and KVM-PV by using FTP and HTTP approaches. All the results are compared with the Real Environment. From the experimental results, the authors have concluded that OpenVZ and XEN-PV have better performance than other hypervisors. The worse performance is for KVM Hypervisor. In our paper we have used some scripts in order to evaluate the performance of these Hypervisors","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122657118","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}
Takuro Inoue, A. Aikebaier, T. Enokido, M. Takizawa
The electric power consumption of servers hasto be reduced in information systems in order to realize green societies. In information systems, clients issue requests to servers and the servers spend electric power to handle the requests. We have to reduce the power consumption of servers since servers mainly consume electric power compared with clients. There are computation (CP), communication (CM), and storage (ST) types of applications to be performed on servers. In CP and CM applications, CPU and communication resources are mainly consumed, respectively. In this paper, we consider ST applications where storage drives are manipulated on a server. First, we measure the power consumption of a server to perform types of ST application processes, C, R, and W processes which just compute, read, and write, respectively. Then, we discuss a power consumption model of a server by abstracting most factors dominating the power consumption of the server from the experimental results. Here, the power consumption rate o a server is maximum if at least one process is performed. The maximum power consumption rate of a server depends on types of processes concurrently performed on the server.
{"title":"Energy Efficient Distributed Systems for Storage Servers","authors":"Takuro Inoue, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/INCoS.2011.84","DOIUrl":"https://doi.org/10.1109/INCoS.2011.84","url":null,"abstract":"The electric power consumption of servers hasto be reduced in information systems in order to realize green societies. In information systems, clients issue requests to servers and the servers spend electric power to handle the requests. We have to reduce the power consumption of servers since servers mainly consume electric power compared with clients. There are computation (CP), communication (CM), and storage (ST) types of applications to be performed on servers. In CP and CM applications, CPU and communication resources are mainly consumed, respectively. In this paper, we consider ST applications where storage drives are manipulated on a server. First, we measure the power consumption of a server to perform types of ST application processes, C, R, and W processes which just compute, read, and write, respectively. Then, we discuss a power consumption model of a server by abstracting most factors dominating the power consumption of the server from the experimental results. Here, the power consumption rate o a server is maximum if at least one process is performed. The maximum power consumption rate of a server depends on types of processes concurrently performed on the server.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124800906","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
扫码关注我们
求助内容：
应助结果提醒方式：