2011 International Conference on Complex, Intelligent, and Software Intensive Systems最新文献

{"title":"Performance Evaluation of FACS-MP CAC System Priority Algorithm for Wireless Cellular Networks","authors":"Taku Ikebata, Gjergji Mino, L. Barolli, F. Xhafa, A. Durresi, A. Koyama","doi":"10.1109/CISIS.2011.49","DOIUrl":"https://doi.org/10.1109/CISIS.2011.49","url":null,"abstract":"Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum, and multimedia traffic characteristics. In our previous work, we implemented a fuzzy based CAC system called FACS-MP, which consider many priorities. In this paper, we evaluate by simulations the performance of priority algorithm which is part of FACS-MP system. From the simulations results, we conclude that the FACS-MP make a good differentiation of different services based on different priorities.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123828764","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}

{"title":"Replication-Based Information Sharing in Multi-Agent System for Monitoring the Internet","authors":"M. Kasper, G. Dobrowolski","doi":"10.1109/CISIS.2011.79","DOIUrl":"https://doi.org/10.1109/CISIS.2011.79","url":null,"abstract":"The especially oriented communication layer of a multi-agent system is proposed which provides a base for coordination of the agents' activities. Necessary coordination information is stored in spread over the network data bases which should be appropriately synchronized. The original Theta replication method is applied for the purpose. The article contains: presentation of Theta method, description of the communication layer of IBIS monitoring system as well as preliminary evaluation of the proposed solution.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121475188","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}

{"title":"Meeting of Randomly Moving Messages in a Mobile ad-hoc Network","authors":"A. Bui, D. Sohier","doi":"10.1109/CISIS.2011.73","DOIUrl":"https://doi.org/10.1109/CISIS.2011.73","url":null,"abstract":"The mobility of ad hoc networks requires solutions that are adaptive to topological changes. Random walks offer a topology-adaptive traversal scheme that can be used in such a context. In random walk based distributed algorithms, topology changes are no fault, which leaves two major fault types (i) the absence of token in the system, (ii) the presence of more than one token in the system. In this paper, we focus on the presence of several token. When a node owns two tokens at a time, it deletes one of them and sends only one token. The purpose of this paper is to give an algorithm to compute the average time for several tokens to meet and be merged, hence the stabilization time of a random walk circulation when several tokens are present.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"65 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904309","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}

{"title":"An Algorithm for Reducing the Total Power Consumption Based on the Computation and Transmission Rates","authors":"T. Enokido, A. Aikebaier, M. Takizawa","doi":"10.1109/CISIS.2011.41","DOIUrl":"https://doi.org/10.1109/CISIS.2011.41","url":null,"abstract":"In information systems, it is critical to reduce the total electrical power consumption of computers and networks in order to realize the digital ecosystems and the green IT technologies. In the extended power consumption laxity-based (EPCLB) algorithm, a server is selected in a set of servers so as to not only satisfy deadline constraint but also reduce the total power consumption of servers in general types of applications. However, each time a load balancer receives a new request, the load balancer has to collect status of each server and calculate the estimated power consumption to perform the request. The load balancer spends large computation and communication overhead to estimate the power consumption if the number of clients is increased. In addition, since the status of each server might be changed during the estimation process, it is difficult to correctly estimate the power consumption. In this paper, we newly propose a CTRB (computation and transmission rate based) algorithm to select a server in a set of possible servers so that the total power consumption of servers and the overhead of a load balancer can be reduced. We evaluate the CTRB algorithm in terms of the power consumption of servers and the overhead of a load balancer compared with the EPCLB and traditional round-robin (RR) algorithms.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124862026","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}

{"title":"Path Tree: Document Synopsis for XPath Query Selectivity Estimation","authors":"M. Alrammal, G. Hains, Mohamed Zergaoui","doi":"10.1109/CISIS.2011.53","DOIUrl":"https://doi.org/10.1109/CISIS.2011.53","url":null,"abstract":"XML is one of the most important standards for manipulating data on the Internet. However, querying large volumes of XML data represents a bottleneck for several computationally intensive applications. A solution is to pre-process the document in streaming mode with resources approximately proportional to document depth and query selectivity. Limited processing space can then accommodate much larger documents. But the actual savings vary so much as to make them unpredictable. To overcome this limitation of stream-processing we propose a new application of the path tree synopsis data structure. Such a synopsis provides a succinct description of the original document with low computational overhead and high accuracy for processing tasks like selectivity estimation and query answer approximation. In this paper, we formally define the path tree synopsis, informally introduced by [1] and used by [25], and propose a new streaming algorithm to construct it. We also present an online stream-querying system able to estimate the cost for a given query before answering it accurately. The core algorithm is adapted from cite{Gou:Eff} LQ, we apply it to path tree traversal, cost estimation, query processing and even optimizations.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423219","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}

{"title":"Networked Baseball Cheering System Based on Tangible Media","authors":"Changhyeon Lee, Yong-Moo Kwon","doi":"10.1109/CISIS.2011.104","DOIUrl":"https://doi.org/10.1109/CISIS.2011.104","url":null,"abstract":"our research focuses on developing Virtual Supporting System (VSS). In this paper, we implement tangible baseball supporting system on virtual world. In virtual world, Second Life, Croquet, Wonderland, etc. we can enjoy shopping, watching movie, dancing and so on. In this paper, we discuss about collaborative supporting method among virtual world users and sensory effect using wearable hap tic devices and smart-phone. Also, we developed avatar control, motion based cheering and chatting using smart phone and wiimote. The main idea of this paper is to extend virtual world's mean by adding collaborative group cheerleading and hap tic devices.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233679","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}

{"title":"Agent-based Modelling of Social Organisations","authors":"J. Kozlak, Anna Zygmunt","doi":"10.1109/CISIS.2011.76","DOIUrl":"https://doi.org/10.1109/CISIS.2011.76","url":null,"abstract":"In the paper, the model of the society represented by a social network and the model of a multi-agent system built on the basis of this, is presented. The particular aim of the system is to predict the evolution of a society and an analysis of the communities that appear, their characteristic features and reasons for coming into being. As an example of application, an analysis was made of a social portal which makes it possible to offer and reserve places in rooms for travelling tourists.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120960521","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}

{"title":"A Cooperative Training Support System Balancing Mutual Encourage and Burden of Two Learners","authors":"Yueting Li, Junbo Wang, Lei Jing, Zixue Cheng, Hiroshi Oki, Xianzhi Ye","doi":"10.1109/CISIS.2011.23","DOIUrl":"https://doi.org/10.1109/CISIS.2011.23","url":null,"abstract":"With the progress of sensing, computing, communication technologies, ubiquitous computing becomes a hot topic in the research field, by which various kinds of services can be provided to satisfy users. Ubiquitous learning as one application of ubiquitous computing is playing a very important role in our daily life. Training is a kind of learning in ubiquitous environment. During the whole training process, the performance of a learner in a series of units may change with patterns: progress, plateau, and decline. Therefore, it is necessary to apply different support strategies to adapt to different states of the learner. In the previous work, a mutual adaptive support based on one learner model was proposed. However one learner model may sometime make the learner lose his/her motivation easily, since each learner does the training independently. There is a need to propose support for group training which is used to let learners do training and improve themselves together. But in the current models for group training, most of them focus on cooperative and competitive training but ignore balance feeling of connection and burden of learners. Feeling of connection is very important in group training since it can give learners continuing motivation by exchanging information. However it also may bring burden to learners due to frequency, volume and content of exchanged information. So an effective mechanism is needed to balance the feeling of burden and connection of multiple learners. To this end, we propose a new support method for a pair of learners to solve the problem. In this paper, firstly, we calculate how much a learner affects the other learner. Then we design an algorithm to judge the feeling of connection and burden from the other leaner. Finally, due to different feeling of connection and burden, various support strategies are designed to support learners. We have implemented our support method in a typing game and shown the method can balance the feeling of connection and burden.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573216","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}

{"title":"Development of a Video Streaming Module for Moodle","authors":"Kenzi Watanabe, T. Umezu, M. Otani","doi":"10.1504/IJSSC.2012.049999","DOIUrl":"https://doi.org/10.1504/IJSSC.2012.049999","url":null,"abstract":"We have developed a video streaming module for Moodle. This module adds three functions into Moodle. The one is an uploading function for recorded video files to Moodle. The second is a video format converting function. This function can convert from 14 major video formats to Flash format, automatically. The third is a video playing function. This module works as an activity module in Moodle. We have recorded lectures of a subject through one semester. We have provided recorded videos as a material for lecture reviewing of students via Moodle. Results of a questionnaire show the videos are good materials for review.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203543","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}

{"title":"Using Machine Learning Techniques for Modelling and Simulation of Metabolic Networks","authors":"M. Biba, F. Xhafa, F. Esposito, S. Ferilli","doi":"10.1109/CISIS.2011.22","DOIUrl":"https://doi.org/10.1109/CISIS.2011.22","url":null,"abstract":"Metabolomics is increasingly becoming an important field. The fundamental task in this area is to measure and interpret complex time and condition dependent parameters such as the activity or flux of metabolites in cells, their concentration, tissues elements and other biosamples. The careful study of all these elements has led to important insights in the functioning of metabolism. Recently, however, there is a growing interest towards an intagrated approach to studying biological systems. This is the main goal in Systems Biology where a combined investigation of several components of a biological system is thought to produce a thorough understanding of such systems. Metabolic networks are not only structurally complex but behave also in a stochastic fashion. Therefore, it is necessary to express structure and handle uncertainty to construct complete dynamics of these networks. In this paper we describe how stochastic modeling and simulation can be performed in a symbolic-statistical machine learning (ML) framework. We show that symbolic ML deals with structural and relational complexity while statistical ML provides principled approaches to uncertainty modeling. Learning is used to analyze traces of biochemical reactions and model the dynamicity through parameter learning, while inference is used to produce stochastic simulation of the network.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567322","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}