{"title":"Design a Portable Bio-Sensing System for Glucose Measurement","authors":"Jui-Lin Lai, Han-ning Wu, Hung-Hsi Chang, Rong-Jian Chen","doi":"10.1109/CISIS.2011.20","DOIUrl":"https://doi.org/10.1109/CISIS.2011.20","url":null,"abstract":"In the paper, the electrochemical sensor consists of the potantiostat with glucose test strip electrode and the automatic test system to readout the electronic signal related to the concentration of Glucose is proposed. The structure of an Op-based potentiostat is improved, analyzed, and implemented. The working operations are very complicated, and having some processing property. These performances will directly influence to oxidation-reduction reaction through the cyclic voltammetry bounded from 0.4V to-1.4V is applied on the three-electrode. The readout circuit of potentiostat is successfully designed and simulated by HSPICE. The readout data is automatically accessed by the NI DAQ card and the coordinated Lab view programming the test schedule to control the related instrumentation with GPIP to obtain the experiment result for various glucose concentrations. The glucose detection system associated with the improved Op-based potentiostat and an automatic test system is realized. The objective of this paper was to investigate the improved OP-based three-electrode potentiostat used in electrochemical glucose biosensor system to obtain more accuracy the measurement results. The experiment result show that the potentiostat is produced more linearity output range of voltage from 4.4V to 0.6V corresponding to the measured concentration of glucose due to 50-600mg/dl range, respectively. The architecture of the potentiostat can be intergraded for VLSI design. There have a great potential in the portable bio-detection system for the health-care and bio-medicine applications.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"52 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":"130754661","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}
Yohei Nosaka, Tao Yang, Gjergji Mino, L. Barolli, F. Xhafa, A. Durresi
{"title":"Comparison Evaluation of Single and Multi Mobile Events Wireless Sensor Networks Using AODV Protocol","authors":"Yohei Nosaka, Tao Yang, Gjergji Mino, L. Barolli, F. Xhafa, A. Durresi","doi":"10.1109/CISIS.2011.33","DOIUrl":"https://doi.org/10.1109/CISIS.2011.33","url":null,"abstract":"In this paper, we evaluate the performance of WSNs for single and multi mobile events using Two Ray Ground radio model and AODV protocol. We consider good put and routing efficiency metrics to evalute the performance of WSN. The simulation results have shown that for single mobile event, the good put is better than multi mobile events when the number of sensor nodes is higher. In case of boids model, the good put of multi mobile events is better than single mobile event. In case of random model, the RE of single mobile event is better than multi mobile events. The RE of multi mobile events is better than single mobile event in case of boids model.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"187 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":"133578181","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}
Jongryool Kim, JongWon Kim, KeyongTae Kim, Soo-Hyung Lee, Wontae Kim, Seungmin Park
{"title":"Simulating Reliable Real-Time Data Distribution for UAV-aided Tactical Networks","authors":"Jongryool Kim, JongWon Kim, KeyongTae Kim, Soo-Hyung Lee, Wontae Kim, Seungmin Park","doi":"10.1109/CISIS.2011.110","DOIUrl":"https://doi.org/10.1109/CISIS.2011.110","url":null,"abstract":"CPS (cyber-physical system) is a kind of system that exhibits a tight combination of system computation and physical elements. This tight integration of computing and physical elements is achievable depending on the performance of reliable data communication among CPS nodes. To support the domain-specific quality requirements of reliable real-time CPS networking, we should deploy a network-adaptive reliable data distribution scheme while paying extra attention to the incurring computational complexity of selected error control modules. In this paper, by taking the example of reliable real-time data distribution for UAV(unmanned aviation vehicle)-aided tactical networks, we discuss how to build a simulation environment that can evaluate the tradeoff of CPS networking performance and resource consumption (in terms of computing and networking resources). To validate the appropriateness of constructed simulation environment, we apply specific error control building blocks on the resource-constrained multi-level hierarchical UAV-aided tactical WiMax networks and evaluate their performance and resource consumption.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"46 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":"133439643","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}
Tadateru Ohkawara, A. Aikebaier, Makoto Ikeda, T. Enokido, M. Takizawa
{"title":"Quorum-based Synchronization Protocol of Object Replicas in Scalable Distributed Systems","authors":"Tadateru Ohkawara, A. Aikebaier, Makoto Ikeda, T. Enokido, M. Takizawa","doi":"10.1109/CISIS.2011.63","DOIUrl":"https://doi.org/10.1109/CISIS.2011.63","url":null,"abstract":"Information systems are getting scalable like cloud computing systems and peer-to-peer (P2P) overlay networks. In information systems, resource objects like databases are distributed and replicated in order to increase the performance, reliability, and availability. In this paper, we consider multimedia objects like movies which are characterized in terms of not only data structure like part of relations of objects but also quality of service (QoS) like frame rate. A pair of replicas may have the same content but different level of QoS. Thus, kinds of replicas of a multimedia object are distributed. Replicas of an object are partially ordered in terms of newness of contents and QoS parameters, while replicas are just totally ordered in traditional quorum theories. We classify operations on an object to three types I, O, IO types of operations with respect to whether or not data and QoS are read and written in the object. We define a quorum for each type of operation. We discuss how to synchronize multiple replicas on the basis of the quorum concept in scalable distributed systems.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"9 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":"117208022","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}
Eiji Aoki, Tatsuya Kikuchi, K. Korida, N. Yoshiyama, Yuki Shibata, Masaya Takahashi, M. Takenaka
{"title":"Study on the Social Networking System of Disaster Prevention Using Smart Phones","authors":"Eiji Aoki, Tatsuya Kikuchi, K. Korida, N. Yoshiyama, Yuki Shibata, Masaya Takahashi, M. Takenaka","doi":"10.1109/CISIS.2011.116","DOIUrl":"https://doi.org/10.1109/CISIS.2011.116","url":null,"abstract":"In this study based on the keywords of disaster prevention, social networking service(SNS), smart phones, and I consider to combine organically, to use disaster prevention \"trust\" and \"human relations\" in the deepening in the region. In the event of disasters such as earthquakes, the question of are in good to the scene of the regional information is accurate, the question of which mutual assistance among neighbors until the arrival of rescue teams, the question of which understanding the circumstance yourself to use existing disaster management system, these questions are have to resolve as background. To minimize the damage of the disaster to prepare for disasters is prevention. I hypothesize, not just disaster drill once a year, the question of which daily basis activity of neighborhood might have lead to the idea of cooperation work, the question of which the smart phones might be expected, and also smart phones are highly affinity with SNS, the idea of user -- friendly touch screen viewing in an emergency. How can I share information, consider what can be done to rescue them how to take advantage of features were verified through experiments.","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":"128153359","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":"Towards an Understanding of Peer Rationality and Collective Intelligence","authors":"Richard Hill, N. Antonopoulos, N. Bessis","doi":"10.1109/CISIS.2011.62","DOIUrl":"https://doi.org/10.1109/CISIS.2011.62","url":null,"abstract":"We re-examine the concept of peer autonomy from an agent-oriented perspective and identify rational behaviours that can be embedded within complex P2P networks. Emergent behaviour is considered in relation to the environmental conditions presented by P2P networks, and we propose a classification of social characteristics that facilitate the mapping and subsequent exchange of peer experiences between nodes.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"29 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":"126391195","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":"Engineering SLS Algorithms for Statistical Relational Models","authors":"M. Biba, F. Xhafa, F. Esposito, S. Ferilli","doi":"10.1109/CISIS.2011.82","DOIUrl":"https://doi.org/10.1109/CISIS.2011.82","url":null,"abstract":"We present high performing SLS algorithms for learning and inference in Markov Logic Networks (MLNs). MLNs are a state-of-the-art representation formalism that integrates first-order logic and probability. Learning MLNs structure is hard due to the combinatorial space of candidates caused by the expressive power of first-order logic. We present current work on the development of algorithms for learning MLNs, based on the Iterated Local Search (ILS) metaheuristic. Experiments in real-world domains show that the proposed approach improves accuracy and learning time over the existing state-of-the-art algorithms. Moreover, MAP and conditional inference in MLNs are hard computational tasks too. This paper presents two algorithms for these tasks based on the Iterated Robust Tabu Search (IRoTS) schema. The first algorithm performs MAP inference by performing a RoTS search within a ILS iteration. Extensive experiments show that it improves over the state-of the-art algorithm in terms of solution quality and inference times. The second algorithm combines IRoTS with simulated annealing for conditional inference and we show through experiments that it is faster than the current state-of-the-art algorithm maintaining the same inference quality.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"358 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":"122735605","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 Hybrid Method of Propensity Scales and Support Vector Machine in a Linear Epitope Prediction","authors":"Hsin-Wei Wang, Ya-Chi Lin, Tun-Wen Pai, Pei-Wen Tsai, Hao-Teng Chang","doi":"10.1109/CISIS.2011.89","DOIUrl":"https://doi.org/10.1109/CISIS.2011.89","url":null,"abstract":"An epitope activates B cells to amplify and induce antibodies which can neutralize the foreign molecules, particles and pathogens. It also plays a crucial role in developing synthetic peptides for vaccination. Identification of epitopes using biological screening approaches is time consuming and high cost. Therefore, bioinformatics approaches are developed to enhance the speed of identifying the epitopes and conserve time. Herein, a combinatorial methodology based on physico-chemical properties and SVM (Support Vector Machine) techniques was proposed to address the aim of this study. Datasets of epitope and non epitope segments with 2, 3 and 4 residues in length were trained and applied as statistical features of SVM. After training, three datasets including one curated and two public ones were employed to evaluate the performance of the proposed system which was also compared with four existing LE predictors, BepiPred, ABCpred, BCPred and FBCPred. Our proposed system has presented better specificity, accuracy, and positive prediction value (PPV) in most testing cases. High specificity and PPV of a linear epitope prediction can lead to an efficient and effective design on biological experiments.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"113 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":"133566134","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 Proposal of Fixed Backoff-time Switching Method by Link Activation Rate for Wireless Mesh Networks","authors":"S. Tajima, N. Funabiki, T. Higashino","doi":"10.1109/CISIS.2011.108","DOIUrl":"https://doi.org/10.1109/CISIS.2011.108","url":null,"abstract":"As an inexpensive and scalable access network to the Internet, we have extensively studied the Wireless Internet-access Mesh Network (WIMNET) that is composed of multiple access points (APs) connected through wireless links. Because most traffic in WIMNET passes through the gateway (GW) to the Internet, the links around the GW are much crowded so that they should be activated with higher priorities than others. In this paper, we propose the Fixed Back off-time Switching (CSMA-FBS) method for WIMNET using the CSMA/CA protocol to improve the performance by giving necessary activation chances to such links. Before starting communications, the target link activation rate and the active/passive back off-times for collision avoidance are calculated from the expected traffic load for each link. During communications, these back off-times are switched by comparing the actual link activation rate with the target one. By assigning different fixed values to these back off-times, the conflicts among the interfered links can be avoided. Through extensive simulations using two types of network topologies, we verify the effectiveness of our proposal.","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":"133571555","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}
I. Tsuneizumi, A. Aikebaier, Makoto Ikeda, T. Enokido, M. Takizawa
{"title":"A Scalable Communication Protocol for Multi-layered Groups","authors":"I. Tsuneizumi, A. Aikebaier, Makoto Ikeda, T. Enokido, M. Takizawa","doi":"10.1109/CISIS.2011.68","DOIUrl":"https://doi.org/10.1109/CISIS.2011.68","url":null,"abstract":"A group of peers are required to cooperate with each other in distributed applications on P2P overlay networks. In order to realize a scalable P2P group, messages are causally ordered by taking advantage of linear time (LT) and physical time (PT) since message length is O(1) in this paper. In this paper, we newly discuss a multi-layered model to realize a scalable group. A group is hierarchically decomposed into subgroups and every peer is in a leaf peer. We present how to order messages by using PT and LT in a multi-layered group. We evaluate the multi-layered group protocol in terms of the group information size and delay time among peers compared with a flat group.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"94 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":"115134887","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}