2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)最新文献

筛选
英文 中文
Optimistic parallel simulation engine for predicting future situations incorporating observation data 结合观测数据预测未来情况的乐观并行模拟引擎
Masashi Shiraishi, A. Ozaki, S. Watanabe
{"title":"Optimistic parallel simulation engine for predicting future situations incorporating observation data","authors":"Masashi Shiraishi, A. Ozaki, S. Watanabe","doi":"10.1109/SNPD.2017.8022745","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022745","url":null,"abstract":"Coping with emergency situations requires effective and prompt decision-making under constantly changing situations. The deployment of various kinds of sensors makes it possible to acquire vast amounts of information. At present, however, most information processing is not automated; therefore, the quality of decision-making depends heavily on the capacities of the decision maker. To solve this problem, we propose a system for predicting future situations through parallel simulations based on observation data. To facilitate the development of such systems, we have been developing an optimistic simulation engine (hereafter referred to as O-SE) that supports parallel simulation of many possible situations and dynamic simulation modification based on observation data acquired by sensors. The design and evaluation results of the O-SE are illustrated in this paper.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131427597","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
An analysis of random forest algorithm based network intrusion detection system 基于随机森林算法的网络入侵检测系统分析
Y. Y. Aung, M. Min
{"title":"An analysis of random forest algorithm based network intrusion detection system","authors":"Y. Y. Aung, M. Min","doi":"10.1109/SNPD.2017.8022711","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022711","url":null,"abstract":"In the world today, the security of the computer system is of great importance, And in the last few years, there have seen an affected growth in the amount of intrusions that intrusion detection has become the dominant of current information security. Firewalls cannot provide complete protection. Applying on a firewall system alone is not enough to prevent a corporate network from all types of network attacks. Therefore more system should be complemented by intrusion detection system. Data mining skills can be used as an effective approach to detect intrusions in intrusion detection system. Data Mining and Knowledge Discovery is the computerized process of trenching and analysis of huge amounts of data, and then extract the meaning of the data. Data mining tools can assist to predict future behaviors and trends, so that organizations proactively, can make decisions based on knowledge. Data mining can answer organization questions that were too traditional time, to solve. Data mining takes its name from the valuable information in a large database. Recent studies display that cascading based approaches of several algorithms are much better performance than an individual algorithm. In this research, we use K-means and Random Forest algorithm to classify instances. This model was verified using KDD'99 data set. Experimental results show that hybrid methods can support suitable detection rates and lower model training time than using single algorithm.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123676206","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}
引用次数: 31
Community detection in Facebook with outlier recognition 基于离群值识别的Facebook社区检测
Htwe Nu Win, Khin Thidar Lynn
{"title":"Community detection in Facebook with outlier recognition","authors":"Htwe Nu Win, Khin Thidar Lynn","doi":"10.1109/SNPD.2017.8022716","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022716","url":null,"abstract":"Communities among users play the popular role for days of Social Network and the presence of groups of nodes that are high tightly connected with each other than with less links connected to nodes of different groups. So community detection algorithms are come to be the key to detect the user who are interact with each other in social media. However, there are still challenges in considering of some nodes have no any common node within the same group as well as some nodes have no any link to the other node. It can be used similarity measure based on neighborhood overlapping of nodes to organize communities and to identify outliers which cannot be grouped into any of the communities. In this paper, we detect communities and outliers from Edge Structure with neighborhood overlap by using nodes similarity. The result implies the best quality with modularity measurement which leads to more accurate communities as well as improved their density after removing outliers in the network structure.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125196987","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}
引用次数: 4
Recovering camera motion from points and lines in stereo images: A recursive model-less approach using trifocal tensors 从立体图像中的点和线恢复相机运动:使用三焦张量的递归无模型方法
K. Lee, Y. Yu, K. Wong
{"title":"Recovering camera motion from points and lines in stereo images: A recursive model-less approach using trifocal tensors","authors":"K. Lee, Y. Yu, K. Wong","doi":"10.1109/SNPD.2017.8022704","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022704","url":null,"abstract":"Estimating the 3-D motion of a moving camera from images is a common task in robotics and augmented reality. Most existing marker-less approaches make use of either points or lines. Taking the advantages of both kinds of features in an unknown environment is more attractive due to their availability and differences in characteristics. A novel model-less method is presented in this paper to tackle the 3-D motion tracking problem. Two Bayesian filters, one for point measurements while another for line measurements, are embedded in the Interacting Probabilistic Switching (IPS) framework. They compensate for the weaknesses in one another by utilizing both kinds of features in the stereo images. The proposed method is able to obtain the 3D motion given as little as two line or two point correspondences in consecutive images with the use of multiple trifocal tensors. Our method outperformed two recent methods in terms of accuracy and the problem of drifting was very little in real scenarios.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127067826","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
Automatic composition using melodic outlines and music theory 使用旋律轮廓和音乐理论的自动作曲
Takayuki Yoshida, T. Hochin, Hiroki Nomiya
{"title":"Automatic composition using melodic outlines and music theory","authors":"Takayuki Yoshida, T. Hochin, Hiroki Nomiya","doi":"10.1109/SNPD.2017.8022773","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022773","url":null,"abstract":"The purpose of this paper is to compose music clips satisfying selected ambience on intended melody easily, and to get satisfaction of self-making. The targets are beginners of music theory. To achieve those purposes, we propose the automatic composing system that takes impression words and outlines, which represent melody's profile lines, as inputs. This system makes several arranges and modification to the initial melody based on the music theory. It is experimentally clarified that the music clips composed by the system are satisfactory, and their moods fit to the impression words specified.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"392 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122883147","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}
引用次数: 2
Mobile-carrier choice behavior analysis between three major mobile-carriers and mobile virtual network operators 三大移动运营商与移动虚拟网络运营商的移动运营商选择行为分析
A. Inoue, Kenichi Kitahara, M. Iwashita
{"title":"Mobile-carrier choice behavior analysis between three major mobile-carriers and mobile virtual network operators","authors":"A. Inoue, Kenichi Kitahara, M. Iwashita","doi":"10.1109/SNPD.2017.8022769","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022769","url":null,"abstract":"The mobile phone market in Japan was shared by three Major Mobile-Carriers (3MMC): docomo, au and SoftBank. As the recognition of Mobile Virtual Network Operators (MVNO) is improved, the number of MVNO customers is expected to increase in the future. The purpose of this study is to understand the preference for 3MMC vs. MVNO considering the current mobile-phone market. We describe the current situation of the mobile phone market in Japan. We analyze the difference between 3MMC customers and MVNO customers from various points of view in this paper. This paper presents the results based on the original market research survey data conducted in January 2017. We classify customers in two segments: 3MMC customers and MVNO customers. We show the characteristics of two customer segments to understand the future demand of mobile carriers from the viewpoints of decision-making factors for mobile carriers. We propose a new revealed-preference model to classify into two customer segments. We show the difference between 3MMC customers and MVNO customers by using the estimated model.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131839489","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
Online tendering and evaluation for public procurement in Tanzania 坦桑尼亚公共采购的在线招标和评估
A. Dello, C. Yoshida
{"title":"Online tendering and evaluation for public procurement in Tanzania","authors":"A. Dello, C. Yoshida","doi":"10.1109/SNPD.2017.8022713","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022713","url":null,"abstract":"Public Procurement in Tanzania is a very ineffective exercise leading to inflated costs, corruption and delays in completion of Public Projects. Public procurement has a huge potential to stimulate the economy by providing opportunities to Small and Medium Enterprises (SME's), if done correctly. The major bottleneck in the current procurement process is inefficient tendering and selection of bids. Tanzania still doesn't have a fully operational e-procurement platform. This paper analyses how Innovation can be used in Public Procurement to ensure true fairness, competitiveness, transparency and value for money in public projects. Technology is a powerful tool to influence business culture. This paper describes the overall Procurement Management practices used in Tanzania, the challenges, how the procurement process affects public projects (i.e. Time and Cost), how e-evaluation as a component of e-procurement can reduce Time and Cost of Public Projects and Finally the Project Plan and scope for the implementation of an efficient e-tendering system.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132885045","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}
引用次数: 10
A fundamental study on adaptive surrogate-assisted evolutionary computation using rank correlation 基于秩相关的自适应代理辅助进化计算的基础研究
Yudai Kuwahata, J. Kushida, S. Ono
{"title":"A fundamental study on adaptive surrogate-assisted evolutionary computation using rank correlation","authors":"Yudai Kuwahata, J. Kushida, S. Ono","doi":"10.1109/SNPD.2017.8022789","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022789","url":null,"abstract":"Surrogate-Assisted Evolutionary Computation (SAEC) has widely applied to approximate an objective function. However, SAEC may potentially also reduce the processing time of inexpensive optimization problems wherein solutions are evaluated within a few seconds or minutes. To achieve this, the approximation model of a fitness function should be iterated as few times as possible during optimization. This paper proposes an adaptive SAEC algorithm using the rank correlations between the actually evaluated and approximately evaluated values of the objective function. These correlations are then used to adaptively switch the approximation and actual evaluation phases, reducing the number of runs required to learn the approximation model. It was confirmed experimentally that the proposed method could successfully reduce the processing time in some benchmark functions even under inexpensive scenario.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131384276","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
Effectiveness of evaluation function and permutation GA in multimodal consecutive meals planning 评价函数和排序遗传算法在多模式连续膳食计划中的有效性
T. Kashima, Hiroshi Someya, Y. Orito
{"title":"Effectiveness of evaluation function and permutation GA in multimodal consecutive meals planning","authors":"T. Kashima, Hiroshi Someya, Y. Orito","doi":"10.1109/SNPD.2017.8022790","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022790","url":null,"abstract":"The consecutive meals planning is a combinatorial optimization problem that determines a meals plan on a long period consisting of consecutive days. A meal is characterized in different characteristics such as food style, ingredient, and cooking method. For the problem, this paper proposes an evaluation function using information entropies on moving intervals. The function measures the appearance order of meal's characteristics on the plan. In addition, we design a specific genotype of a permutation GA and apply it to this problem. In the numerical experiments, we show that the consecutive meals planning employing our function can be viewed as a multimodal problem and then show that our meals plan obtained by the permutation GA is a good solution with large variation of appearance order of meal's characteristics.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398218","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
Actuators task assignment algorithm and its application for WSAN 执行器任务分配算法及其在WSAN中的应用
Weixu Chen, Hongxia Miao, Juan Liu, Bensheng Qi, Ning Sun
{"title":"Actuators task assignment algorithm and its application for WSAN","authors":"Weixu Chen, Hongxia Miao, Juan Liu, Bensheng Qi, Ning Sun","doi":"10.1109/SNPD.2017.8022738","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022738","url":null,"abstract":"In the wireless sensor actuator network (WSAN), in order to make the sensor nodes (S) and the actuator nodes (A) work together more efficiently and obtain more accurate assignment information of actuators, a novel data fusion model of actuators assignment were constructed. In this paper, the weights and thresholds of BP neural network (BPNN) were optimized by genetic algorithm (GA), and the GA-BPNN model was applied to prefabricated substation. In order to verify the characteristics of the model, the simulation and analysis of GA-BPNN were carried out comparing with the traditional BPNN data fusion model. The results demonstrate that the running time of the whole system can greatly be reduced, and the efficiency of operation and the correctness of the actuator nodes task assignment information can also be improved by using GA-BPNN task assignment data fusion model.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116262154","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学术官方微信