{"title":"Link Structure Ranking Algorithm for Trading Networks","authors":"Andri Mirzal","doi":"10.1109/CISIS.2009.27","DOIUrl":"https://doi.org/10.1109/CISIS.2009.27","url":null,"abstract":"Ranking algorithms based on link structure of the network are well-known methods in web search engines to improve the quality of the searches. The most famous ones are PageRank and HITS. PageRank uses probability of a random surfer to visit a page as the score of that page, and HITS instead of produces one score, proposes using two scores, authority and hub scores. In this paper, we introduce a new link structure ranking algorithm for trading network based on the differences between trading network and WWW network in the links addition process, a process that known to be the foundation of PageRank and HITS formulation. In the last section, we describe the using of proposed algorithm as a tool for network clustering in addition to its original function as a ranking method.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"73 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130683","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":"Data Replication Preserving Semantic Relationship on a Single Wireless Channel","authors":"Song-Yi Yi, Heonshik Shin","doi":"10.1109/CISIS.2009.169","DOIUrl":"https://doi.org/10.1109/CISIS.2009.169","url":null,"abstract":"There have been various broadcast schemes based either on mobile users' data access frequencies or on the semantic relations of data.In this paper, we present a data broadcast scheme based both on the semantic relationship and the access probabilities. The broadcast scheme we propose generates a broadcast sequence according to the semantic relationship and replicates popular data items several times according to the data access probabilities. We show our broadcast scheme is efficient through performance evaluations.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121354625","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}
Makoto Ikeda, L. Barolli, M. Hiyama, G. Marco, Tao Yang, A. Durresi
{"title":"Performance Evaluation of Link Quality Extension in Multihop Wireless Mobile Ad-hoc Networks","authors":"Makoto Ikeda, L. Barolli, M. Hiyama, G. Marco, Tao Yang, A. Durresi","doi":"10.1109/CISIS.2009.101","DOIUrl":"https://doi.org/10.1109/CISIS.2009.101","url":null,"abstract":"Recently, Mobile Ad-hoc Networks (MANET) are continuing to attract the attention for their potential use in several fields. Most of the work has been done in simulation, because a simulator can give a quick and inexpensive understanding of protocols and algorithms. However, experimentation in the real world are very important to verify the simulation results and to revise the models implemented in the simulator. In this paper, we present the implementation and analysis of our testbed considering the Link Quality Window Size (LQWS) parameter for Optimized Link State Routing (OLSR) protocol. We investigate the effect of mobility in the throughput of a MANET. The mobile nodes move toward the destination at a regular speed. When the mobile nodes arrive at the corner, they stop for about three seconds. In our experiments, we consider two cases: only one node is moving (mobile node)and two nodes (intermediate nodes) are moving at the same time. We assess the performance of our testbed in terms of throughput, round trip time, jitter and packet loss. From our experiments, we found that throughput of TCP was improved by reducing LQWS.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442535","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":"Distributed Parallel Groebner Bases Computation","authors":"Heinz Kredel","doi":"10.1109/CISIS.2009.109","DOIUrl":"https://doi.org/10.1109/CISIS.2009.109","url":null,"abstract":"This paper considers the implementation of parallel Gröbner bases algorithms on distributed memory parallel computers like todays high performance computing clusters (HPC) in the Java computer algebra library (JAS). The implementation of Gröbner bases algorithms is part of the essential building blocks for any computation in algebraic geometry. There are various implementations of these algorithms in procedural programming languages. Our aim is an implementation in a modern object oriented programming language with generic data types, as it is provided by Java programming language. The proposed middle-ware uses a distributed list for the communication of the reduction bases and a distributed thread pool for running the reduction engines in different computers. Java object serialization is used to encode polynomial objects for network transport via Java networking facilities.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116574445","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}
Zhenghui Wang, Tianyin Xu, Zhuzhong Qian, Sanglu Lu
{"title":"A Parameter-Based Scheme for Service Composition in Pervasive Computing Environment","authors":"Zhenghui Wang, Tianyin Xu, Zhuzhong Qian, Sanglu Lu","doi":"10.1109/CISIS.2009.50","DOIUrl":"https://doi.org/10.1109/CISIS.2009.50","url":null,"abstract":"Pervasive computing, the new computing paradigm aiming at providing services anywhere at anytime, poses great challenges on dynamic service composition. Existing service composition methods can hardly meet the requirements of dynamic characteristic and heterogeneity in pervasive computing environment. In this paper, we propose a parameter-based service model to accurately describe pervasive services. Based on the model, pervasive services are aggregated in a two-layer graph according to both semantic and syntactic information of the input and output parameters. Moreover, we design a novel service composition scheme to accomplish the user task while satisfy the QoS requirements. Both theoretical analysis and simulation experiments show that this service composition mechanism is effective in pervasive environment.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122610465","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 Multi-Dip Interface with Water","authors":"Michihiro Ikeda, Norimasa Nagira, M. Hirakawa","doi":"10.1109/CISIS.2009.149","DOIUrl":"https://doi.org/10.1109/CISIS.2009.149","url":null,"abstract":"Thanks to GUI, computers became usable by the people who don’t have a plenty of knowledge about them. Future interfaces should provide features that people are willing to use computers or, more definitely, computing capabilities. A pleasant nature would be the key to success.In this paper we present a multi-dip interface that makes use of total internal reflection (TIR) as a technique for sensing hand gestures under water in a tub. The water also serves as a display of computer-generated information. Neither lighting conditions in surroundings nor graphic images being projected on the water interfere with hand region detection. The system gets true hand gesture information at high spatial and temporal resolutions. Besides, the depth position of a fingertip dipped in the water can be obtained as well as its spatial position. Application of the multi-dip interface to drawing, language learning, and some others is presented.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684488","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":"Experimental Study of Multithreading to Improve Memory Hierarchy Performance of Multi-core Processors for Scientific Applications","authors":"Enes Bajrovic, E. Mehofer","doi":"10.1109/CISIS.2009.110","DOIUrl":"https://doi.org/10.1109/CISIS.2009.110","url":null,"abstract":"In this paper we study performance characteristics and parallelization strategies for recently shipped, powerful multi-core processors - IBM Power6 and Sun T2 Plus - for high-end scientific computing. Central aspect is data locality. First, we investigate the impacts of good and bad data locality by modifying data accesses. Next, we study the impact of multithreading with respect to data locality based on the data-parallel programming approach. The level of parallelism is increased by assigning multiple threads onto one core in order to hide processor stalls caused by bad data locality. We measure the impacts of data locality and multithreading in terms of execution times and bandwidth for synthetic micro-benchmarks, a matrix multiplication kernel, and an application from Bioinformatics. The results indicate that substantial performance improvements can be obtained with minor effort by utilizing multithreading.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122883862","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":"Models for P2P Multi-Source Streaming","authors":"A. Nemati, T. Enokido, M. Takizawa","doi":"10.1109/CISIS.2009.158","DOIUrl":"https://doi.org/10.1109/CISIS.2009.158","url":null,"abstract":"In peer-to-peer (P2P) overlay networks, multimedia objects are distributed in peers and source peers transmit a multimedia object to receiver peers. In this paper, we would like to discuss how multiples source peers deliver multimedia objects to receiver peers in a streaming model so that enough quality of service (QoS) required is supported in presence of QoS change. A multimedia object is realized in a sequence of primitive objects which are units of transmission at the P2P overlay layer. The receiver peer is required to receive primitive objects of the multimedia object with enough QoS, e.g. no primitive object loss. We discuss types of multi-source streaming (MSS) models where a receiver peer can receive primitive objects of a multimedia object from multiple source peers which can support enough QoS.There are serial and parallel types of MSS models. In the serial MSS model, a receiver peer receives each primitive object from one of the source peers at a time. If a current source peer is expected to support lower QoS than required or not to support a succeeding primitive object, another source peer starts sending primitive objects. In the parallel MSS model, multiple source peers in parallel send primitive object units to the receiver peer. A primitive object is redundantly sent by multiple source peers or non-redundantly sent by a source peer. Here the throughput and reliability can be increased.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131469875","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 Web Services Orchestration Solution for Semantic Multimedia Indexing and Retrieval","authors":"Mihaela Brut, F. Sèdes, Ana-Maria Manzat","doi":"10.1109/CISIS.2009.180","DOIUrl":"https://doi.org/10.1109/CISIS.2009.180","url":null,"abstract":"In this article we are presenting a solution for the problem of combining various indexation algorithms in order to acquire a semantic multimedia indexation and to provide responses to the user complex queries. The challenge of this problem concerns the big heterogeneity of the multimedia indexation algorithms and the weak semantic aspect they address. Our solution considers a generic interface for the indexation algorithms, an implementation as Web services, as well as a semantic description in terms of WSMO (Web Service Modeling Ontology) of their functionality and orchestration. Original contribution of the article concerns the idea of organizing the various multimedia metadata types into a generic structure,used to express the user queries, the algorithms' generic interface, as well as the algorithms' WSMO metadata. This approach facilitates the definition of algorithm combination rules, and enables the reduction of the multimedia retrieval task to a metadata matching process.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121838462","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}
M. Gaeta, V. Loia, Stefano Paolozzi, Pierluigi Ritrovato, Mario Veniero
{"title":"Towards an Architectural Pattern for Automatic Web Service Discovery and Selection in Business Marketplace","authors":"M. Gaeta, V. Loia, Stefano Paolozzi, Pierluigi Ritrovato, Mario Veniero","doi":"10.1109/CISIS.2009.126","DOIUrl":"https://doi.org/10.1109/CISIS.2009.126","url":null,"abstract":"The success of today enterprises depends on their capability to respond on demand to challenging customers' request. At the same time, the enterprise marketplace is characterized by high dynamicity and heterogeneous requests. This makes difficult to provide in house cost-effective services able to meet them and, in many cases, the only solution is to aggregate different services at this purpose. In this context, the availability of an efficient service discovery mechanism is a key feature in order to enable the sketched context. In this paper, we present an architectural pattern for web service discovery following the principle of separation of concerns and based on the definition of discovery queries driven by the customers' needs.","PeriodicalId":377538,"journal":{"name":"2009 International Conference on Complex, Intelligent and Software Intensive Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133810069","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}