发布求助
文献互助 智能选刊 最新文献

2018 6th International Symposium on Computational and Business Intelligence (ISCBI)最新文献

筛选
英文 中文
A Network Root Cause Analysis and Repair System 网络根本原因分析与修复系统
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00023
Tanapat Anusas-Amornkul
{"title":"A Network Root Cause Analysis and Repair System","authors":"Tanapat Anusas-Amornkul","doi":"10.1109/ISCBI.2018.00023","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00023","url":null,"abstract":"Recently, Internet and computer networks are important infrastructures for businesses and must be reliable in order to serve customers or employees to do online transactions. However, network problems can be occurred, and must be solved as soon as possible. Time to analyze and solve network problems is varied depending on a network administrator's experience. This can be a challenge for a novice network administrator. In this work, the network root cause analysis and repair system is proposed for analyzing four main network problems, i.e. IP duplication, link up/down, loopback and MAC flapping problems. The problems are classified using a rule-based classification with thresholds. Then, the system tries to preliminary solve some software problems automatically. The experimental results showed that the proposed system was able to solve problems over 90% faster than the manual solving.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804463","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
Gig Work Business Process Improvement 零工业务流程改进
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/iscbi.2018.00013
Ela Pustulka-Hunt, Rainer Telesko, T. Hanne
{"title":"Gig Work Business Process Improvement","authors":"Ela Pustulka-Hunt, Rainer Telesko, T. Hanne","doi":"10.1109/iscbi.2018.00013","DOIUrl":"https://doi.org/10.1109/iscbi.2018.00013","url":null,"abstract":"We collaborate with a gig work platform company (GPC) in Switzerland. The project aims to improve the business by influencing process management within the GPC, providing automated matching of jobs to workers, improving worker acquisition and worker commitment, and particularly focusing on the prevention of no shows. One expects to achieve financial, organizational and efficiency gains. As research tools we use a combination of text mining and sentiment analysis, Business Process Modeling and Notation (BPMN), interviews with workers and employers, and the design of sociotechnical improvements to the process, including platform improvements and prototypes. Here, we focus on the successful combination of BPMN modelling with sentiment analysis in the identification of problems and generation of ideas for future modifications to the business processes.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123084502","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
Link Predictability Analysis of US Political Blog Network with Structural Perturbation Method 结构摄动法分析美国政治博客网络的链接可预测性
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00024
Yuling Yang, Yun Zhou, Guangquan Chen
{"title":"Link Predictability Analysis of US Political Blog Network with Structural Perturbation Method","authors":"Yuling Yang, Yun Zhou, Guangquan Chen","doi":"10.1109/ISCBI.2018.00024","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00024","url":null,"abstract":"Many link prediction methods have been developed in past few decades in network science, and most of them are tailored for specific fields that lose generalities. Luckily, a recent work named Structural Perturbation Method (SPM) proposed a consistency index of network organization without priori knowledge, and it did not need to test those predicting methods first. Since demonstrating whether there is a link between two nodes is usually costly, we want to replace link confirmation with link prediction. In this paper, we use the SPM method to study the structure of US political blog network and analyze the link predictability at different network scales. The experimental results show that we can obtain basic intrinsic features of the network structure and can get ideal prediction results as long as 20% of the network structures.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132239193","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
Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem 扩展柔性作业车间调度问题的瓶颈识别
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00015
Yunfei Wang, Luohao Tang, Yun Zhou, Cheng Zhu, Weiming Zhang, Lianfei Yu
{"title":"Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem","authors":"Yunfei Wang, Luohao Tang, Yun Zhou, Cheng Zhu, Weiming Zhang, Lianfei Yu","doi":"10.1109/ISCBI.2018.00015","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00015","url":null,"abstract":"In the Extended Flexible Job Shop Scheduling Problem (EFJSP), the temporal constraints among the tasks could be very complex including serial, parallel and flexible relations. This paper presents a method for identifying the critical tasks that affect the makespan most remarkably, which we call the \"bottleneck tasks\". To this end, we first transfer the solution of the EFJSP, which corresponds to a schedule plan, into an AOE Network (Activity On Edge Network), and then propose a bottleneck identification index based on the critical paths of the AOE Network. The tasks with the biggest bottleneck identification index value are identified as bottleneck tasks. The experimental results show that the bottleneck identification index as well as its computing method proposed in this paper are effective for identifying critical tasks. Moreover, it is proved that the time complexity of the bottleneck identification method is O((NJ * NT)^2), where NJ denotes the number of jobs and NT denotes the number of tasks in each job, respectively.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126512165","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
Comparison of BPA-MLP and LSTM-RNN for Stocks Prediction bp - mlp与LSTM-RNN在存量预测中的比较
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00019
Roger Achkar, Fady Elias-Sleiman, Hasan Ezzidine, Nourhane Haidar
{"title":"Comparison of BPA-MLP and LSTM-RNN for Stocks Prediction","authors":"Roger Achkar, Fady Elias-Sleiman, Hasan Ezzidine, Nourhane Haidar","doi":"10.1109/ISCBI.2018.00019","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00019","url":null,"abstract":"Neural networks is considered one of the most developed concept in artificial intelligence, due to its ability to solve complex computational tasks, and its efficiency to find solutions. There is a wide range of applications that adopt this technique, one of which is in the financial investment issues. This paper presents an approach to predict stock market ratios using artificial neural networks. It considers two different techniques-BPA-MLP and LSTM-RNN-their potential, and their limitations. Tests were conducted on different data sets, such as FacebookTM stocks, GoogleTM stocks, and BitcoinTM stocks. We achieve a best case accuracy of 97% for MLP algorithm, and 99.5% for LSTM algorithm. While the results appear to be promising, a web interface is presented in order to accept a certain amount of money, and accordingly checks the best stock to invest in.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114313903","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}
引用次数: 21
Understanding Backers' Motivations and Perceptions of Information on Product-Based Crowdfunding Platforms 了解产品众筹平台上支持者的动机和对信息的感知
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00026
Fang-Wu Tung, Xin-Yang Liu
{"title":"Understanding Backers' Motivations and Perceptions of Information on Product-Based Crowdfunding Platforms","authors":"Fang-Wu Tung, Xin-Yang Liu","doi":"10.1109/ISCBI.2018.00026","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00026","url":null,"abstract":"This study explores the motives that influence people to serve as backers for campaign projects, particularly product-related projects. This study endeavored to further understand backers' perceptions and ratings of information on crowdfunding platforms. An online questionnaire survey was used to collect data. A total of 151 participants who had backed one or more product-based crowdfunding campaigns were recruited. Findings of this study reveal that five relevant funding motivations-involvement, interest, playfulness, philanthropy, and reward-and identified three types of crowdfunding sponsors: high-involvement backer, angelic backer, and pragmatic backer. Based on the results of this study, information provided by crowdfunding platforms can be classified into five categories: introduction, endorsement, reward, communication, and execution. The three types of backers all considered product introduction crucial in influencing their intention to back a project. The implications and suggestions for launching a crowdfunding project are discussed at the end of the paper.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"594 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943007","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
Mathematical Modeling and Process Optimization of the Radial Continuous Casting of Steel 钢径向连铸的数学建模与工艺优化
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00017
José Arzola-Ruiz, Yusdel Diaz Hernandez, Umer Asgher, Fiol Zulueta Alberto, T. Hanne
{"title":"Mathematical Modeling and Process Optimization of the Radial Continuous Casting of Steel","authors":"José Arzola-Ruiz, Yusdel Diaz Hernandez, Umer Asgher, Fiol Zulueta Alberto, T. Hanne","doi":"10.1109/ISCBI.2018.00017","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00017","url":null,"abstract":"In this study, an analysis and synthesis methodology for complex engineering problems is applied to radial continuous casting processes for steel (SRCCI). The quality of the operations of the respective machines significantly influences the production cost because an uninterrupted sequence of casting allows reducing the losses of materials and influences the energy consumption in the casting process. Also because of technological, mechanical and electrical breaks in the machines and other minor losses the costs increase. In this study, the objective function (operation cost) is optimized to decrease the costs and reach optimal values when the operation of the machines is completed within planned time and fewer losses and expenses. In this study, the analysis of a hybrid operation task is carried out in detail keeping human machine integration as an important modeling parameter. The relationship between the operation of the steel foundry workshop and the continuous casting process is mathematically modeled, and the most vital relationships and constraints of that model are pointed out to optimize the cost function in a decision support system.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683909","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
Autoeoncoders and Information Augmentation for Improved Generalization and Interpretation in Multi-layered Neural Networks 在多层神经网络中改进泛化和解释的自编码器和信息增强
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00020
R. Kamimura
{"title":"Autoeoncoders and Information Augmentation for Improved Generalization and Interpretation in Multi-layered Neural Networks","authors":"R. Kamimura","doi":"10.1109/ISCBI.2018.00020","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00020","url":null,"abstract":"The present paper aims to propose a new type of learning method for multi-layered neural network to solve the vanishing information problem. The vanishing information problem means that multi-layered neural networks tend to lose their error information as well as input information by going through many hidden layers. To overcome this problem, the new method tries to capture information in inputs as much as possible by increasing the number of inputs, producing composite input variables. The new method was applied to the symmetric data set and wine data sets. For the symmetric data set, the new method could capture the symmetric property of input data set with better generalization performance. For the wine data set, the new method could capture combined characteristics detected by the bagging method and logistic regression analysis with better generalization performance.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120944391","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
Analysis of Optimal Pricing Model of Crowdsourcing Platform Based on Cluster and Proportional Sharing 基于聚类和比例共享的众包平台最优定价模型分析
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/iscbi.2018.00029
Shuo Guan
{"title":"Analysis of Optimal Pricing Model of Crowdsourcing Platform Based on Cluster and Proportional Sharing","authors":"Shuo Guan","doi":"10.1109/iscbi.2018.00029","DOIUrl":"https://doi.org/10.1109/iscbi.2018.00029","url":null,"abstract":"Aiming at the shortage of the task pricing model of current crowdsourcing platform, the paper use the improved proportional sharing mechanism to set up a general pricing optimization model that can evaluate mission success rate in advance. In order to optimize the pricing model, a strategy for packaging some tasks that are near in location into one task based on DBSCAN clustering algorithm is proposed, and the specific implementation method is given. At the same time, the pricing data set of a popular crowdsourcing platform is quoted to evaluate the pricing model. Through the simulation experiments of the algorithm in the data set, the pricing model established in the paper shows good practicability and novelty.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112736","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
Automatic Tuning Methodology for Automotive Lean NOx Trap Catalyst Using Response Data 基于响应数据的汽车贫氮氧化物捕集器自动调谐方法
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00018
Ante Zglav, Z. Kovačić, M. Balenovic
{"title":"Automatic Tuning Methodology for Automotive Lean NOx Trap Catalyst Using Response Data","authors":"Ante Zglav, Z. Kovačić, M. Balenovic","doi":"10.1109/ISCBI.2018.00018","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00018","url":null,"abstract":"This article provides an overview of the Lean NOx trap (LNT) catalysts' operating mechanism and proposes a method for auto-tuning the LNT model using response data. LNT catalysts are used in automotive applications to reduce NOx emissions from diesel engines, or lean-burn engines in general. The LNT catalyst is a complex nonlinear chemical system designed for cyclic operations, which can be very difficult to model in detail. Therefore, a simplified model was used which is based on the main chemical and physical processes typical to LNT. To tune the model, the method of choice of temperature for the lookup tables associated with multi-objective optimization and different input data sources was used: both steady state tests performed on a synthetic gas bench and more dynamic enginedynamometer tests.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"98 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130941185","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
下一页 尾页
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学术官方微信