{"title":"A Study on Electronic Voting System Using Private Blockchain","authors":"C. Roh, Imyeong Lee","doi":"10.3745/JIPS.03.0135","DOIUrl":"https://doi.org/10.3745/JIPS.03.0135","url":null,"abstract":"","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674870","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":"Combining Distributed Word Representation and Document Distance for Short Text Document Clustering","authors":"Supavit Kongwudhikunakorn, Kitsana Waiyamai","doi":"10.3745/JIPS.04.0164","DOIUrl":"https://doi.org/10.3745/JIPS.04.0164","url":null,"abstract":"This paper presents a method for clustering short text documents, such as news headlines, social media statuses, or instant messages. Due to the characteristics of these documents, which are usually short and sparse, an appropriate technique is required to discover hidden knowledge. The objective of this paper is to identify the combination of document representation, document distance, and document clustering that yields the best clustering quality. Document representations are expanded by external knowledge sources represented by a Distributed Representation. To cluster documents, a K-means partitioning-based clustering technique is applied, where the similarities of documents are measured by word mover’s distance. To validate the effectiveness of the proposed method, experiments were conducted to compare the clustering quality against several leading methods. The proposed method produced clusters of documents that resulted in higher precision, recall, F1- score, and adjusted Rand index for both real-world and standard data sets. Furthermore, manual inspection of the clustering results was conducted to observe the efficacy of the proposed method. The topics of each document cluster are undoubtedly reflected by members in the cluster.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128190862","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":"Improvement of ITSM IT Service Efficiency in Military Electronic Service","authors":"Hanchul Woo, Sukjae Jeong, Jun-Ho Huh","doi":"10.3745/JIPS.03.0134","DOIUrl":"https://doi.org/10.3745/JIPS.03.0134","url":null,"abstract":"IT Service Management (ITSM) achieves consolidated management for the IT services supporting the acquisition system, and no outside connections can be established with such ITSM. Issues pertaining to the D2B can be addressed to System Q&A or a Call Center for problem-solving. In other words, internal staff can take the necessary measures for problems by directly connecting with ITSM. Currently, diverse innovative technologies are being used in electronics and ubiquitous computing environments. This allows us to create a better world by providing the backbone for remarkable development in our human society in the fields of electronics, devices, computer science, and engineering. Following the expansion of IT services in the military acquisition sector such as Defense Electronic Procurement, military export/import support system, etc., customers’ dependence on IT for conducting business with the military or related companies is increasing, including the military’s dependence on the same technology for services to the public. Nonetheless, issues pertaining to the simplified/integrated management of complex IT service management systems, including slow system recovery, lack of integrated customer service window, and insufficient information sharing, have become the priority problems that IT managers are required to solve. Therefore, this study conducted research on the integrated management of IT services provided by Korea’s national defense acquisition system, which was developed based on the existing system IT Infrastructure Library (ITIL) v2, and investigated the level of satisfaction with services with focus on ensuring that it can be used for understanding the necessity of the system and its advancement in the future.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131899861","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":"Energy-Aware Virtual Data Center Embedding","authors":"Xiao Ma, Zhongbao Zhang, Sen Su","doi":"10.3745/JIPS.02.0112","DOIUrl":"https://doi.org/10.3745/JIPS.02.0112","url":null,"abstract":"As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599053","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":"Risk Assessment and Decision-Making of a Listed Enterprise's L/C Settlement Based on Fuzzy Probability and Bayesian Game Theory","authors":"Zhang Cheng, N. Huang","doi":"10.3745/JIPS.04.0156","DOIUrl":"https://doi.org/10.3745/JIPS.04.0156","url":null,"abstract":"Letter of Credit (L/C) is currently a very popular international settlement method frequently used in international trade processes amongst countries around the globe. Compared with other international settlement methods, however, L/C has some obvious shortcomings. Firstly, it is not easy to use due to the sophisticated processes its usage involves. Secondly, it is sometimes accompanied by a few risks and some uncertainty. Thus, highly efficient methods need to be used to assess and control these risks. To begin with, FAHP and KMV methods are used to resolve the problem of incomplete information associated with L/C and then, on this basis, Bayesian game theory is used in order to make more scientific and reasonable decisions with respect to international trade.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131787161","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}
Khamis Abdul Latif Khamis, Huazhu Song, Xian Zhong
{"title":"Formal Representation and Query for Digital Contents Data","authors":"Khamis Abdul Latif Khamis, Huazhu Song, Xian Zhong","doi":"10.3745/JIPS.02.0130","DOIUrl":"https://doi.org/10.3745/JIPS.02.0130","url":null,"abstract":"Digital contents services are one of the topics that have been intensively studied in the media industry, where various semantic and ontology techniques are applied. However, query execution for ontology data is still inefficient, lack of sufficient extensible definitions for node relationships, and there is no specific semantic method fit for media data representation. In order to make the machine understand digital contents (DCs) data well, we analyze DCs data, including static data and dynamic data, and use ontology to specify and classify objects and the events of the particular objects. Then the formal representation method is proposed which not only redefines DCs data based on the technology of OWL/RDF, but is also combined with media segmentation methods. At the same time, to speed up the access mechanism of DCs data stored under the persistent database, an ontology-based DCs query solution is proposed, which uses the specified distance vector associated to a surveillance of semantic label (annotation) to detect and track a moving or static object.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334929","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":"Topic Extraction and Classification Method Based on Comment Sets","authors":"Xiao Tan","doi":"10.3745/JIPS.04.0165","DOIUrl":"https://doi.org/10.3745/JIPS.04.0165","url":null,"abstract":"In recent years, emotional text classification is one of the essential research contents in the field of natural language processing. It has been widely used in the sentiment analysis of commodities like hotels, and other commentary corpus. This paper proposes an improved W-LDA (weighted latent Dirichlet allocation) topic model to improve the shortcomings of traditional LDA topic models. In the process of the topic of word sampling and its word distribution expectation calculation of the Gibbs of the W-LDA topic model. An average weighted value is adopted to avoid topic-related words from being submerged by high-frequency words, to improve the distinction of the topic. It further integrates the highest classification of the algorithm of support vector machine based on the extracted high-quality document-topic distribution and topic-word vectors. Finally, an efficient integration method is constructed for the analysis and extraction of emotional words, topic distribution calculations, and sentiment classification. Through tests on real teaching evaluation data and test set of public comment set, the results show that the method proposed in the paper has distinct advantages compared with other two typical algorithms in terms of subject differentiation, classification precision, and F1measure.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125698188","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":"Offline-to-Online Service and Big Data Analysis for End-to-end Freight Management System","authors":"Suganya Selvaraj, Hanju Kim, Eunmi Choi","doi":"10.3745/JIPS.01.0051","DOIUrl":"https://doi.org/10.3745/JIPS.01.0051","url":null,"abstract":"Freight management systems require a new business model for rapid decision making to improve their business processes by dynamically analyzing the previous experience data. Moreover, the amount of data generated by daily business activities to be analyzed for making better decisions is enormous. Online-to-offline or offlineto-online (O2O) is an electronic commerce (e-commerce) model used to combine the online and physical services. Data analysis is usually performed offline. In the present paper, to extend its benefits to online and to efficiently apply the big data analysis to the freight management system, we suggested a system architecture based on O2O services. We analyzed and extracted the useful knowledge from the real-time freight data for the period 2014–2017 aiming at further business development. The proposed system was deemed useful for truck management companies as it allowed dynamically obtaining the big data analysis results based on O2O services, which were used to optimize logistic freight, improve customer services, predict customer expectation, reduce costs and overhead by improving profit margins, and perform load balancing.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258595","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 Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces","authors":"Liping Zhang, Song Li, Yingying Guo, Xiaohong Hao","doi":"10.3745/JIPS.04.0167","DOIUrl":"https://doi.org/10.3745/JIPS.04.0167","url":null,"abstract":"In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115170801","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":"Electromagnetic Environment of Transmission Line Based on Full Parameter Online Estimation","authors":"Zidan Sun, Xiaofeng Zhou, Likai Liang, Yang Mo","doi":"10.3745/JIPS.04.0171","DOIUrl":"https://doi.org/10.3745/JIPS.04.0171","url":null,"abstract":"The parameters of transmission lines have an influence on the electromagnetic environment surrounding the line. This paper proposes a method based on phasor measurement unit (PMU) and supervisory control and data acquisition (SCADA) to achieve online estimation of transmission line full parameters, such as resistance, reactance and susceptance. The proposed full parameter estimation method is compared with the traditional method of estimating resistance independently based on SCADA system. Then, the electromagnetic environment is analyzed based on the different parameter estimation methods. The example results illustrate that online estimation of transmission line full parameters is more accurate in the analysis of electromagnetic environment, which further confirms its necessity and significance in engineering application.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685326","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}