2013 16th International Conference on Network-Based Information Systems最新文献

筛选
英文 中文
Workflow-Based Composite Job Scheduling for Decentralized Distributed Systems 基于工作流的分散分布式系统复合作业调度
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.97
Nasi Tantitharanukul, J. Natwichai, P. Boonma
{"title":"Workflow-Based Composite Job Scheduling for Decentralized Distributed Systems","authors":"Nasi Tantitharanukul, J. Natwichai, P. Boonma","doi":"10.1109/NBiS.2013.97","DOIUrl":"https://doi.org/10.1109/NBiS.2013.97","url":null,"abstract":"The development of distributed systems has been accelerated in this recent years through the development of P2P, grid, and cloud computing. Nevertheless, job scheduling is still a major challenge for distributed system design and implementation. Such issue can be more complex when dealing with workflow-based composite jobs, i.e. each job has multiple tasks with dependencies between them. In this paper we prove that, when task dependency in such kind of jobs is pre-defined with workflow templates, finding minimal execution time for multiple jobs is an NP-complete problem. So, we propose a heuristic algorithm for this problem. The experimental results show that this algorithm can find near optimal solutions to the problem with a polynomial computation time.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1981 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130298380","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}
引用次数: 5
A Reputation Aggregation Method Considering File Request Distribution and Peer Behavior in Unstructured P2P Networks 非结构化P2P网络中考虑文件请求分布和对等体行为的声誉聚合方法
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.27
Hiroki Ushikubo, Sonoko Takeda, H. Shigeno
{"title":"A Reputation Aggregation Method Considering File Request Distribution and Peer Behavior in Unstructured P2P Networks","authors":"Hiroki Ushikubo, Sonoko Takeda, H. Shigeno","doi":"10.1109/NBiS.2013.27","DOIUrl":"https://doi.org/10.1109/NBiS.2013.27","url":null,"abstract":"In order to establish secure file-sharing in unstructured peer-to-peer networks, reputation aggregation methods are now focused on. In these methods, each peer calculates reputation values which denote the reliability and safety of peers participating in P2P networks. When peers exchange files, they can avoid transacting with the malicious peers by reference to reputation values. Reputation aggregation methods, however, have a problem that file requests concentrate on partial peers with high reputation values. In the existing method, file requests are distributed by making partial peers whose reputation values are high to some extent more likely to be selected temporarily. Although, there are tactical malicious peers providing not only inauthentic but also authentic files in each transaction. And the existing method do not consider the problem that the malicious peers can spread more inauthentic files by providing authentic files intentionally and acquiring high reputation value by the system. Thus in this paper, we propose a reputation aggregation method which decreases the probability of selecting the malicious peers by considering reputation value. Furthermore, the method considers trade-off between the safety of file-sharing and the distribution of file requests. The results of computer simulation demonstrate the distribution of file requests and the advancement of transaction success rate.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130718496","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}
引用次数: 3
An Analytic Procedure to Generate Inhomogeneous Random Rough Surface 一种生成非均匀随机粗糙表面的解析方法
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.82
K. Uchida, M. Takematsu, Jun-Hyuck Lee, K. Shigetomi, J. Honda
{"title":"An Analytic Procedure to Generate Inhomogeneous Random Rough Surface","authors":"K. Uchida, M. Takematsu, Jun-Hyuck Lee, K. Shigetomi, J. Honda","doi":"10.1109/NBiS.2013.82","DOIUrl":"https://doi.org/10.1109/NBiS.2013.82","url":null,"abstract":"This paper is concerned with an algorithm for generating the inhomogeneous random rough surface (RRS) of which statistical properties vary from place to place. The essence of the theory is based on the application of convolution method to generation of inhomogeneous RRS whose amplitude spectral density function together with its weighting function is given analytically. The present method enables us to achieve arbitrary types of in homogeneity with respect to standard height deviation dv and correlation length cl of RRSs as well as the in homogeneity with respect to amplitude spectral density functions. Numerical computations are carried out to generate inhomogeneous RRSs with Uniform, Gaussian and Exponential types of power spectral density functions.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129418663","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}
引用次数: 12
Consideration of IT Which Solves an Agricultural Problem: Examination of the Solution of an Agricultural Problem Which Utilized the Agricultural Support System 信息技术解决农业问题的思考——利用农业支持系统解决农业问题的考察
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.72
T. Okada, J. Iio, Mayumi Nakada, Yuka Obu, T. Yonekura
{"title":"Consideration of IT Which Solves an Agricultural Problem: Examination of the Solution of an Agricultural Problem Which Utilized the Agricultural Support System","authors":"T. Okada, J. Iio, Mayumi Nakada, Yuka Obu, T. Yonekura","doi":"10.1109/NBiS.2013.72","DOIUrl":"https://doi.org/10.1109/NBiS.2013.72","url":null,"abstract":"It is examined whether the problem of the agriculture in Japan can be solved with Information Technology. In solving the problem, the specific requirement of the technology was examined. Moreover, the function required for the system used with each operating form of the production, circulation, and sale in agriculture was considered.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116039152","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}
引用次数: 0
A Scheduling Method for Division Based Broadcasting Considering Dynamic Update 一种考虑动态更新的分播调度方法
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.52
Y. Gotoh, H. Taniguchi
{"title":"A Scheduling Method for Division Based Broadcasting Considering Dynamic Update","authors":"Y. Gotoh, H. Taniguchi","doi":"10.1109/NBiS.2013.52","DOIUrl":"https://doi.org/10.1109/NBiS.2013.52","url":null,"abstract":"Due to the recent development of digital TV broadcasting systems, contents data broadcasting using voices or movies has attracted great attention. In general broadcasting systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast. We have proposed several methods to reduce waiting time for contents data broadcasting that clients play without interruption. However, we do not consider the case where the available bandwidth is changed on the air. In actual environments, we need to make the broadcast schedule considering the increase of available bandwidth. In this paper, we propose a scheduling method considering the increase of available bandwidth. Our proposed method can update the broadcast schedule considering the increasing value of available bandwidth. In addition, we confirm that the waiting time under our proposed method can be reduced compared to the conventional method.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432132","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}
引用次数: 0
A Fast (2, 2^m)-Threshold Secret Sharing Scheme Using m Linearly Independent Binary Vectors 基于m线性无关二值向量的快速(2,2 ^m)阈值秘密共享方案
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.90
Yuji Suga
{"title":"A Fast (2, 2^m)-Threshold Secret Sharing Scheme Using m Linearly Independent Binary Vectors","authors":"Yuji Suga","doi":"10.1109/NBiS.2013.90","DOIUrl":"https://doi.org/10.1109/NBiS.2013.90","url":null,"abstract":"Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using only XOR operation at distribution and restoration processes. In these cases for the number of shares n, target data must be equally divided into individual np-1 pieces where np is a prime more than n.The existing methods described above are configured using the cyclic matrices with prime order. On the other hand, a new method in WAIS2013 have proposed, this leads to general constructions of (2, p + 1)-threshold secret sharing schemes.In this paper, we use m-dimensional vector spaces over Z2 on having bases that meet certain conditions in order to construct proposed methods. This paper defines a new notion \"2-propagation bases set\" as a bases set to be used in the configuration. In order to guarantee the existence of (2; 2m)- threshold secret sharing schemes, we also treat the presence of the m-dimensional bases.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133725471","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}
引用次数: 5
A Simulated Annealing Algorithm for Ground Station Scheduling Problem 地面站调度问题的模拟退火算法
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.37
F. Xhafa, X. Herrero, Admir Barolli, M. Takizawa
{"title":"A Simulated Annealing Algorithm for Ground Station Scheduling Problem","authors":"F. Xhafa, X. Herrero, Admir Barolli, M. Takizawa","doi":"10.1109/NBiS.2013.37","DOIUrl":"https://doi.org/10.1109/NBiS.2013.37","url":null,"abstract":"Among different versions of Satellite Scheduling, there is the Ground Station Scheduling, whose aim is mission allocation of ground stations to spacecrafts. This scheduling problem belongs to the family of scheduling with time windows, and besides complexities of classical scheduling problems, it has additional requirements that make it over-constrained and challenging to solve to optimality. In fact, in some cases it is even hard to find a feasible solution that satisfies all user requirements and resource constraints. As with other computationally hard combinatorial optimization problems, heuristic solutions are employed to find high quality solutions in reasonable amount of computation time. In this paper we present a Simulated Annealing (SA) algorithm for the problem, which is a local search based algorithm that simulates the cooling process by gradually lowering the temperature of the system until it converges to a stable state. The Satellite Toolkit is used for the experimental study and performance evaluation of the algorithm through a family of instances of small, medium and large sizes.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123818295","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}
引用次数: 16
A Novel MMSE Based Predictive Method for Narrow Band Interference Removal 一种新的基于MMSE的窄带干扰去除预测方法
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.34
Neeraj Varshney, R. C. Jain
{"title":"A Novel MMSE Based Predictive Method for Narrow Band Interference Removal","authors":"Neeraj Varshney, R. C. Jain","doi":"10.1109/NBiS.2013.34","DOIUrl":"https://doi.org/10.1109/NBiS.2013.34","url":null,"abstract":"A new system model based on state space representation of the received signal for Narrow-band interference suppression in Direct Sequence-Spread Spectrum (DS-SS) system is given. This model recursively estimates the interfering signal in the presence of desired information and white Gaussian noise. To further improve the performance, we employ MMSE criteria to estimate the transmitted symbols. The MMSE estimate requires low computational complexity than Code-aided techniques. Our simulation results demonstrate that this technique provides better SINR improvement over to Nonlinear predictor, Linear predictor, Kalman-Bucy predictor for-65 dB to-5 dB input SINR and up to 10 dB AWGN power. For high interfering signal and noise power, our results clearly show that our SINR improvement performance exceeds the SINR improvement upper-bound calculated for the prediction based techniques. Besides reducing the effect of interfering signal, our technique also reduces AWGN noise. Our model also provides better BER performance than Nonlinear predictor.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121709239","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}
引用次数: 1
Rapid Deployment for Machine Learning in Educational Cloud 机器学习在教育云中的快速部署
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.59
Yuichiro Takabe, M. Uehara
{"title":"Rapid Deployment for Machine Learning in Educational Cloud","authors":"Yuichiro Takabe, M. Uehara","doi":"10.1109/NBiS.2013.59","DOIUrl":"https://doi.org/10.1109/NBiS.2013.59","url":null,"abstract":"In the cloud era, the acquisition of new cloud skills is a constant requirement of IT specialists. Educational organizations such as universities have a need to provide educational cloud curriculums for their students. In our current research, we are constructing a private cloud based on super-saturation, which is defined as the allocation of a much greater amount of logical resources than physical resources. Super-saturated clouds therefore realize up to 10 times more running instances than conventional clouds. While the performance of super-saturated clouds decreases somewhat compared with conventional clouds, their costs also greatly decrease. Moreover, in the post-cloud era, i.e., the big data era, data scientists will be increasingly required to process big data in the cloud. Mahout and Hadoop are two popular tools used in the fields of data science and machine learning. However, a certain level of skill is required to build such machine learning systems, and because it takes a long time to build such systems, the curriculums available to learners are limited. In this paper, we propose a method of rapid deployment for machine learning systems in the educational cloud. We show that our proposed method can reduce the required preparation time.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374061","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}
引用次数: 1
Real-Time Water Level Visualization with Pervasive IC Sensors 实时水位可视化与普遍的IC传感器
2013 16th International Conference on Network-Based Information Systems Pub Date : 2013-09-04 DOI: 10.1109/NBiS.2013.73
O. Saitou, Y. Kuwahara, Michitoshi Niibori, M. Kamada
{"title":"Real-Time Water Level Visualization with Pervasive IC Sensors","authors":"O. Saitou, Y. Kuwahara, Michitoshi Niibori, M. Kamada","doi":"10.1109/NBiS.2013.73","DOIUrl":"https://doi.org/10.1109/NBiS.2013.73","url":null,"abstract":"The climate change has increased heavy rain falling sporadically within a small spot of towns. It rains extremely heavily for a short time to cause local flash flood that may put lives in danger. For the purpose of early warning, we have developed a web-based system for real-time water-level visualization. This system is made up of newly developed compact water-level sensors with short-range radio, an access point to collect data from the sensors, and a web site to visualize the water level in real time. The sensor measures the water level by a pressure-sensitive device and transmits the data to the access point by the IEEE 802.15.4-compliant protocol to the access point. The access point collects data wirelessly from many sensors and uploads them to the web server. The web server renders a water-level map.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128903242","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信