In this paper we propose a model of the evolution of a market with linear utilities in the presence of both local and global social interactions. In the scenario considered, there is a market consisting of buyers and divisible goods. In consecutive time periods, the decision of a buyer is affected by the consumption plan of his neighbors and by a global signal, the distribution of actions of all agents. Moreover, we assume that the market prices and the allocation of the goods are stabilized by the law of supply and demand. We simulate the model, along with a market equilibria algorithm, and we investigate the long time behavior of the system. Specifically, we analyze the distribution of the prices and the market share of the products, when the configuration of the network is Erdos-Renyi and Scale-free graph. The experimental results show that the long time behavior of the system is not always static. The long time states depict a periodic pattern and are sensitive to a) the initial agents' beliefs, b) the weights that each agent assigns to the local and the global factor respectively and c)the degree distribution of the nodes in the network.
{"title":"Diffusion in Social Networks and Market Stability","authors":"Nikos Salamanos, Dimitris Konstantopoulos","doi":"10.1109/INCoS.2011.76","DOIUrl":"https://doi.org/10.1109/INCoS.2011.76","url":null,"abstract":"In this paper we propose a model of the evolution of a market with linear utilities in the presence of both local and global social interactions. In the scenario considered, there is a market consisting of buyers and divisible goods. In consecutive time periods, the decision of a buyer is affected by the consumption plan of his neighbors and by a global signal, the distribution of actions of all agents. Moreover, we assume that the market prices and the allocation of the goods are stabilized by the law of supply and demand. We simulate the model, along with a market equilibria algorithm, and we investigate the long time behavior of the system. Specifically, we analyze the distribution of the prices and the market share of the products, when the configuration of the network is Erdos-Renyi and Scale-free graph. The experimental results show that the long time behavior of the system is not always static. The long time states depict a periodic pattern and are sensitive to a) the initial agents' beliefs, b) the weights that each agent assigns to the local and the global factor respectively and c)the degree distribution of the nodes in the network.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"76 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130603000","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}
Achieving network connectivity and user coverage are among the most important objectives in Wireless Mesh Networks (WMNs). These objectives are formulated as optimization problems, which unfortunately cannot be solved to optimality due to their computational hardness nature. Heuristic methods have thus been considered for such optimization problem aiming to compute near optimal solutions in reasonable amount of time. One family of heuristic methods known for their efficiency is that of local search algorithms. The methods in this family explore the solution space through a path of solutions, visited during the search process. Among methods of this family, Tabu Search (TS) has shown its superiority due to advanced mechanisms to overcome getting stuck into local optima. In this paper we present the implementation and evaluation of TS for the problem of mesh router node placement in WMNs, formulated as a bi-objective optimization problem. The optimization model consists in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage. The experimental evaluation showed the efficiency of TS in solving a variety of problem instances generated using different distributions for the mesh client nodes in WMNs.
{"title":"A Tabu Search Algorithm for Efficient Node Placement in Wireless Mesh Networks","authors":"F. Xhafa, C. Sánchez, Admir Barolli, M. Takizawa","doi":"10.1109/INCOS.2011.44","DOIUrl":"https://doi.org/10.1109/INCOS.2011.44","url":null,"abstract":"Achieving network connectivity and user coverage are among the most important objectives in Wireless Mesh Networks (WMNs). These objectives are formulated as optimization problems, which unfortunately cannot be solved to optimality due to their computational hardness nature. Heuristic methods have thus been considered for such optimization problem aiming to compute near optimal solutions in reasonable amount of time. One family of heuristic methods known for their efficiency is that of local search algorithms. The methods in this family explore the solution space through a path of solutions, visited during the search process. Among methods of this family, Tabu Search (TS) has shown its superiority due to advanced mechanisms to overcome getting stuck into local optima. In this paper we present the implementation and evaluation of TS for the problem of mesh router node placement in WMNs, formulated as a bi-objective optimization problem. The optimization model consists in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage. The experimental evaluation showed the efficiency of TS in solving a variety of problem instances generated using different distributions for the mesh client nodes in WMNs.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"25 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129664386","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 order to practically examine a new type of class, in which cooperative learning is taken into consideration, we designed and built a classroom. This classroom, in which furniture and a flexible ICT basis are both designed reconfigurable, supports much more complex interactions between learners than in a traditional classroom. Two months' observation of the activities in the classroom shows that many aspects of the reconfigurations have encouraged complex interactions within cooperative learning.
{"title":"Design and Implementation of a Dynamic Reconfigurable Classroom for Cooperative Learning","authors":"Hideki Kondo, H. Narahara","doi":"10.1109/INCoS.2011.72","DOIUrl":"https://doi.org/10.1109/INCoS.2011.72","url":null,"abstract":"In order to practically examine a new type of class, in which cooperative learning is taken into consideration, we designed and built a classroom. This classroom, in which furniture and a flexible ICT basis are both designed reconfigurable, supports much more complex interactions between learners than in a traditional classroom. Two months' observation of the activities in the classroom shows that many aspects of the reconfigurations have encouraged complex interactions within cooperative learning.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063572","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}
Kwangjin Bae, Sungjin Kim, Yongoo Lee, I. You, Kangbin Yim, Taeho Son
Recently, several severe cyber attacks to commercial networks and their systems have been found more frequently compared to the last half decade. According to the analysis results from the experts, most of the attacks had similar approach to reach their goal: compromising the web server and bridging to the storage server instead of direct penetrating through the firewalls within the intranet. Because web servers are usually easier to compromise than other insiders in the server farm, this unwanted approach would be common for hackers. This means that the servers in the secured server farm became unsafe and the storage server has no exception. Because of the reason, this paper introduces the concept of the secondary backup and proposes a consequent framework.
{"title":"Insider Threats are Getting Worse within Industries: Isolated Secondary Backup Required","authors":"Kwangjin Bae, Sungjin Kim, Yongoo Lee, I. You, Kangbin Yim, Taeho Son","doi":"10.1109/INCoS.2011.165","DOIUrl":"https://doi.org/10.1109/INCoS.2011.165","url":null,"abstract":"Recently, several severe cyber attacks to commercial networks and their systems have been found more frequently compared to the last half decade. According to the analysis results from the experts, most of the attacks had similar approach to reach their goal: compromising the web server and bridging to the storage server instead of direct penetrating through the firewalls within the intranet. Because web servers are usually easier to compromise than other insiders in the server farm, this unwanted approach would be common for hackers. This means that the servers in the secured server farm became unsafe and the storage server has no exception. Because of the reason, this paper introduces the concept of the secondary backup and proposes a consequent framework.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126007190","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}
H. Maeda, Hiroyuki Terashima, Yongmei Zhang, T. Shinohara
Propagation and filtering characteristics of two dimensional pillar-type photonic crystal wave guide with hexagonal resonator were experimentally demonstrated. Measurement was done by using a scale model in microwave frequency with lattice period P=26.5 mm, diameter of pillar phi=7.5 mm and its dielectric constant epsilon_r=36.0 around 4 GHz. First, single isolated wave guide was set up by using line-defect in array of pillars. After confirming wave guide operation in frequency range between 3.6 and 4.2 GHz, a hexagonal resonator which have side length of 4P along with center of resonator wave guide, was situated between a pair of input/output wave guides. The hexagonal resonator showed frequency dependent transmission characteristics to output ports at frequencies corresponding to lambda_g as propagating wave. Applying good separation characteristics with respect to input frequency, this resonator circuit is available for signal drop device for wavelength division multiplexing (WDM) system.
{"title":"Hexagonal Resonator in Two Dimensional Photonic Crystal Structure","authors":"H. Maeda, Hiroyuki Terashima, Yongmei Zhang, T. Shinohara","doi":"10.1109/INCoS.2011.99","DOIUrl":"https://doi.org/10.1109/INCoS.2011.99","url":null,"abstract":"Propagation and filtering characteristics of two dimensional pillar-type photonic crystal wave guide with hexagonal resonator were experimentally demonstrated. Measurement was done by using a scale model in microwave frequency with lattice period P=26.5 mm, diameter of pillar phi=7.5 mm and its dielectric constant epsilon_r=36.0 around 4 GHz. First, single isolated wave guide was set up by using line-defect in array of pillars. After confirming wave guide operation in frequency range between 3.6 and 4.2 GHz, a hexagonal resonator which have side length of 4P along with center of resonator wave guide, was situated between a pair of input/output wave guides. The hexagonal resonator showed frequency dependent transmission characteristics to output ports at frequencies corresponding to lambda_g as propagating wave. Applying good separation characteristics with respect to input frequency, this resonator circuit is available for signal drop device for wavelength division multiplexing (WDM) system.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126732069","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 propose an experimental implementation of activity recognition feature on the activity information gathering system named ALKAN. In this experiment, we develop activity recognition algorithm using machine learning on server system, and port it onto client system on mobile phone. We also confirmed the feasibility of real-time activity recognition with actual mobile phone.
{"title":"Implementation of Activity Recognition from Accelerometers on Mobile Phones","authors":"Go Hirakawa, T. Nwe, Yuichi Hattori, Sozo Inoue","doi":"10.1109/INCoS.2011.103","DOIUrl":"https://doi.org/10.1109/INCoS.2011.103","url":null,"abstract":"In this paper, we propose an experimental implementation of activity recognition feature on the activity information gathering system named ALKAN. In this experiment, we develop activity recognition algorithm using machine learning on server system, and port it onto client system on mobile phone. We also confirmed the feasibility of real-time activity recognition with actual mobile phone.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"4 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113972553","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 IMS (IP Multimedia Subsystem) can provide multimedia services between heterogeneous wireless networks. But the efficiency of the service session handoff will bring a significant impact to user experience. For the integration of heterogeneous wireless networks, we propose a SIP-based multimedia service session handoff method named MS2HM. To reduce the handoff delay between heterogeneous wireless networks, the MS2HM uses the methods of advance registration and old-new address temporary matching. We modeled the node processing delay and network transmission delay, and analyze the total delay and the packet loss rate of the MS2HM. The MS2HM can meet the low delay and low packet loss rate requirements of IMS service session handoff between heterogeneous wireless networks, and ensure the QoS of the IMS services.
{"title":"MS2HM: A Multimedia Service Session Handoff Method between Heterogeneous Wireless Networks","authors":"Yulong Shen, Zhiwei Zhang, Jianfeng Ma, Qingqi Pei, Qijian Xu, H. Yin","doi":"10.1109/INCoS.2011.121","DOIUrl":"https://doi.org/10.1109/INCoS.2011.121","url":null,"abstract":"The IMS (IP Multimedia Subsystem) can provide multimedia services between heterogeneous wireless networks. But the efficiency of the service session handoff will bring a significant impact to user experience. For the integration of heterogeneous wireless networks, we propose a SIP-based multimedia service session handoff method named MS2HM. To reduce the handoff delay between heterogeneous wireless networks, the MS2HM uses the methods of advance registration and old-new address temporary matching. We modeled the node processing delay and network transmission delay, and analyze the total delay and the packet loss rate of the MS2HM. The MS2HM can meet the low delay and low packet loss rate requirements of IMS service session handoff between heterogeneous wireless networks, and ensure the QoS of the IMS services.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131661202","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 recent years, there have been to studied to construct a new network infrastructure for accepting evolved network technology. There is a research of controlling the network by "Flow". Flow is used a combination of layers of L4 from L2, to identify the communication network traffic. High Performance Packet Processing Engine (HPPPE), that FUJITSU developed, is one of the next generation packet processing engine. This system can process data from low-layer up to high-layer according to the format of the data being used per service. HPPPE provides service functions as add-on. In Saga University, user authentication system for using network named Open gate has been developed and used widely from 2001. In this study, we have developed network user authentication gateway system like Open gate using "HPPPE". This system determines using the network and ending the network based on "Flow".
{"title":"Development of Network User Authentication Gateway System Using \"High Performance Packet Processing Engine\"","authors":"Yuki Wakamizu, M. Otani, Kenzi Watanabe","doi":"10.1109/INCoS.2011.4","DOIUrl":"https://doi.org/10.1109/INCoS.2011.4","url":null,"abstract":"In recent years, there have been to studied to construct a new network infrastructure for accepting evolved network technology. There is a research of controlling the network by \"Flow\". Flow is used a combination of layers of L4 from L2, to identify the communication network traffic. High Performance Packet Processing Engine (HPPPE), that FUJITSU developed, is one of the next generation packet processing engine. This system can process data from low-layer up to high-layer according to the format of the data being used per service. HPPPE provides service functions as add-on. In Saga University, user authentication system for using network named Open gate has been developed and used widely from 2001. In this study, we have developed network user authentication gateway system like Open gate using \"HPPPE\". This system determines using the network and ending the network based on \"Flow\".","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"132 S225","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113972681","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}
Wireless networks have become increasingly popular. They can provide mobile users with ubiquitous communication capability and information access regardless of locations. In this paper, we evaluate the throughput of wireless multihop networks by simulations. For simulations, we used ns-3 network simulator considering Ad hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV) routing protocols. We also evaluate the average throughput, the average packets received rate and the percentage of Constant Bit Rate (CBR) for different area sizes and different number of nodes. The evaluation results show that OLSR has the best performance than other protocols for smaller area.
{"title":"Mobile Ad-hoc Network Routing Protocols Performance Evaluation Using NS-3 Simulator","authors":"Makoto Ikeda, M. Hiyama, Elis Kulla, L. Barolli","doi":"10.1109/INCoS.2011.119","DOIUrl":"https://doi.org/10.1109/INCoS.2011.119","url":null,"abstract":"Wireless networks have become increasingly popular. They can provide mobile users with ubiquitous communication capability and information access regardless of locations. In this paper, we evaluate the throughput of wireless multihop networks by simulations. For simulations, we used ns-3 network simulator considering Ad hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV) routing protocols. We also evaluate the average throughput, the average packets received rate and the percentage of Constant Bit Rate (CBR) for different area sizes and different number of nodes. The evaluation results show that OLSR has the best performance than other protocols for smaller area.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"342 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124230311","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 development of information systems which simulate disaster preparedness and mitigation activities requires integration of large amount of data from different diversified data sources. The goal of our work is to provide an effective way to integrate such different, distributed data sources that would bring them into a standardized and exchangeable common data format and then to publish them as Linked Open Data (LOD). We describe different sets of published data sources and how they are interconnected with other sources in the LOD cloud in order to develop an information system which simulates disaster mitigation processes. Examples are provided in order to demonstrate the benefits of this system to vulnerable people and emergency management teams as well as other organizations involved in disaster management.
{"title":"Linked Data in Disaster Mitigation and Preparedness","authors":"Thushari Silva, V. Wuwongse, H. Sharma","doi":"10.1109/INCoS.2011.113","DOIUrl":"https://doi.org/10.1109/INCoS.2011.113","url":null,"abstract":"The development of information systems which simulate disaster preparedness and mitigation activities requires integration of large amount of data from different diversified data sources. The goal of our work is to provide an effective way to integrate such different, distributed data sources that would bring them into a standardized and exchangeable common data format and then to publish them as Linked Open Data (LOD). We describe different sets of published data sources and how they are interconnected with other sources in the LOD cloud in order to develop an information system which simulates disaster mitigation processes. Examples are provided in order to demonstrate the benefits of this system to vulnerable people and emergency management teams as well as other organizations involved in disaster management.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428372","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
扫码关注我们
求助内容：
应助结果提醒方式：