Infocommunications Journal最新文献

筛选
英文 中文
Categorization and geovisualization of climate change strategies using an open-access WebGIS tool 使用开放访问的WebGIS工具对气候变化策略进行分类和地理可视化
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.1.5
Emőke Kiss, Marianna Zichar, I. Fazekas, G. Karancsi, Dániel Balla
{"title":"Categorization and geovisualization of climate change strategies using an open-access WebGIS tool","authors":"Emőke Kiss, Marianna Zichar, I. Fazekas, G. Karancsi, Dániel Balla","doi":"10.36244/icj.2020.1.5","DOIUrl":"https://doi.org/10.36244/icj.2020.1.5","url":null,"abstract":"The focus of our paper is to present the power of collaboration of databases in a web environment, where data contain or are related to different types of social geography spatial data. Implementing different data gained from the Climate Change Laws of the World, the United Nations Treaty Collection, the World Bank and The World Factbook, we ourselves developed the Climate Change Strategies of the world’s countries (called CCS). Our purpose is to publish and demonstrate the spatial visualization and categorization of the climate change strategies (CCS) of the world’s countries, and also highlight the power of geovisualization in terms of cognitive InfoCommunications, using open-access WebGIS tools and geoinformatics software. The evolved geographic database is able to provide information for users about the different types of climate change strategies of the world’s countries in a visual way, but can also be extended by uploading new data.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"196 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79901080","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}
引用次数: 6
Adapting IT Algorithms and Protocols to an Intelligent Urban Traffic Control 将IT算法和协议应用于智能城市交通控制
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.2.8
Levente Alekszejenkó, T. Dobrowiecki
{"title":"Adapting IT Algorithms and Protocols to an Intelligent Urban Traffic Control","authors":"Levente Alekszejenkó, T. Dobrowiecki","doi":"10.36244/icj.2020.2.8","DOIUrl":"https://doi.org/10.36244/icj.2020.2.8","url":null,"abstract":"Autonomous vehicles, communicating with each other and with the urban infrastructure as well, open opportunity to introduce new, complex and effective behaviours to the intelligent traffic systems. Such systems can be perceived quite naturally as hierarchically built intelligent multi-agent systems, with the decision making based upon well-defined and profoundly tested mathematical algorithms, borrowed e.g. from the field of information technology. In this article, two examples of how to adapt such algorithms to the intelligent urban traffic are presented. Since the optimal and fair timing of the traffic lights is crucial in the traffic control, we show how a simple Round-Robin scheduler and Minimal Destination Distance First scheduling (adaptation of the theoretically optimal Shortest Job First scheduler) were implemented and tested for traffic light control. Another example is the mitigation of the congested traffic using the analogy of the Explicit Congestion Notification (ECN) protocol of the computer networks. We show that the optimal scheduling based traffic light control can handle roughly the same complexity of the traffic as the traditional light programs in the nominal case. However, in extraordinary and especially fastly evolving situations, the intelligent solutions can clearly outperform the traditional ones. The ECN based method can successfully limit the traffic flowing through bounded areas. That way the number of passing-through vehicles in e.g. residential areas may be reduced, making them more comfortable congestion-free zones in a city.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"13 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79848197","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
Supporting Digital Supply Chains by IoT Frameworks: Collaboration, Control, Combination 通过物联网框架支持数字供应链:协作、控制、组合
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/ICJ.2020.4.4
Dániel Kozma, P. Varga
{"title":"Supporting Digital Supply Chains by IoT Frameworks: Collaboration, Control, Combination","authors":"Dániel Kozma, P. Varga","doi":"10.36244/ICJ.2020.4.4","DOIUrl":"https://doi.org/10.36244/ICJ.2020.4.4","url":null,"abstract":"The purpose of this paper is to introduce a technology-oriented SCM (Supply Chain Management) development methodology, which can be used in the design of IoT (Internet of Things) frameworks especially characterized by supply chain processes. In order to meet DSC (Digital Supply Chain) expectations, two areas are examined in detail during the literature review. Firstly, the current SCM models are studied. Secondly, Industry 4.0 requirements had to be surveyed. As a consequence, challenges and gaps are identified for which we seek the solution during our research. Based on the results, it can be stated that digitization has definitely required an improved technological solution that IoT frameworks can provide. The result is a technology-driven, IoT-based SCM development methodology that serves as a basis for the design of such platforms, which will manage supply chains. To prove the feasibility of the proposed development methodology, the Arrowhead industrial IoT framework is used for validation.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"49 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84263403","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}
引用次数: 8
Comparison of Non-Linear Filtering Methods for Positron Emission Tomography 正电子发射层析成像非线性滤波方法的比较
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.2.9
Dóra Varnyú, László Szirmay-Kalos
{"title":"Comparison of Non-Linear Filtering Methods for Positron Emission Tomography","authors":"Dóra Varnyú, László Szirmay-Kalos","doi":"10.36244/icj.2020.2.9","DOIUrl":"https://doi.org/10.36244/icj.2020.2.9","url":null,"abstract":"As a result of the limited radiotracer dose, acquisition time and scanner sensitivity, positron emission tomography (PET) images suffer from high noise. In the current clinical practice, post-reconstruction filtering has become one of the most common noise reduction techniques. However, the range of existing filters is very wide, and choosing the most suitable filter for a given measurement is far from simple. This paper aims to provide assistance in this choice by comparing the most powerful image denoising filters, covering both image quality and execution time. Emphasis is placed on non-linear techniques due to their ability to preserve edges and fine details more accurately than linear filters. The compared methods include the Gaussian, the bilateral, the guided, the anisotropic diffusion and the non-local means filters, which are examined in both static and dynamic PET reconstructions.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76027422","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
Noise reduction for digital communications – A modified Costas loop 数字通信降噪。改进的科斯塔斯环路
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/ICJ.2020.4.1
Janos Ladvanszky
{"title":"Noise reduction for digital communications – A modified Costas loop","authors":"Janos Ladvanszky","doi":"10.36244/ICJ.2020.4.1","DOIUrl":"https://doi.org/10.36244/ICJ.2020.4.1","url":null,"abstract":"An efficient way of noise reduction has been presented: A modified Costas loop called as Masterpiece. The basic version of the Costas loop has been developed for SSB SC demodulation, but the same circuit can be applied for QAM demodulation as well. Noise sensitivity of the basic version has been decreased. One trick is the transformation of the real channel input into complex signal, the other one is the application of our folding algorithm. The result is that the Masterpiece provides a 4QAM symbol error rate (SER) of 6*10-4 for input signal to noise ratio (SNR) of -1 dB. In this paper, an improved version of the original Masterpiece is introduced. The complex channel input signal is normalized, and rotational average is applied. The 4QAM result is SER of 3*10-4 for SNR of -1 dB. At SNR of 0 dB, the improved version produces 100 times better SER than that the original Costas loop does.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"12 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88725509","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
De-anonymizing Facial Recognition Embeddings 去匿名化面部识别嵌入
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.2.7
István Fábián, G. Gulyás
{"title":"De-anonymizing Facial Recognition Embeddings","authors":"István Fábián, G. Gulyás","doi":"10.36244/icj.2020.2.7","DOIUrl":"https://doi.org/10.36244/icj.2020.2.7","url":null,"abstract":"","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76668156","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
Location, Proximity, Affinity – The key factors in FaaS 位置、邻近性、亲和性——FaaS的关键因素
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/ICJ.2020.4.3
Dávid Haja, Z. Turányi, László Toka
{"title":"Location, Proximity, Affinity – The key factors in FaaS","authors":"Dávid Haja, Z. Turányi, László Toka","doi":"10.36244/ICJ.2020.4.3","DOIUrl":"https://doi.org/10.36244/ICJ.2020.4.3","url":null,"abstract":"The Function-as-a-Service paradigm emerged not only as a pricing technique, but also as a programming model promising to simplify developing to the cloud. Interestingly, while placing functions across hosts under the service platform is believed to be flexible, currently the available platforms pay little attention to co-locate connected functions, or data with the respective processing function in order to improve performance. Even though the local function invocation and data access might be an order of magnitude faster than their remote intra-cloud counterparts. In this paper, we therefore propose a Function-asa- Service platform design that reaps the performance benefits of co-location. We build the platform on WebAssembly, a secure and flexible tool for efficient local function invocations, and on a distributed in-memory database, which allows arbitrary data placement. On top we advocate smart placement strategies for function executions and data, decoupled from the functions. Hence we envision good horizontal scaling of functions while keeping the experienced processing latency to that of a single machine case.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"11 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87421315","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
GrAMeFFSI: Graph Analysis Based Message Format and Field Semantics Inference For Binary Protocols, Using Recorded Network Traffic 基于图形分析的消息格式和字段语义推理的二进制协议,使用记录的网络流量
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.2.4
Gergő Ládi, L. Buttyán, T. Holczer
{"title":"GrAMeFFSI: Graph Analysis Based Message Format and Field Semantics Inference For Binary Protocols, Using Recorded Network Traffic","authors":"Gergő Ládi, L. Buttyán, T. Holczer","doi":"10.36244/icj.2020.2.4","DOIUrl":"https://doi.org/10.36244/icj.2020.2.4","url":null,"abstract":"Protocol specifications describe the interaction between different entities by defining message formats and message processing rules. Having access to such protocol specifications is highly desirable for many tasks, including the analysis of botnets, building honeypots, defining network intrusion detection rules, and fuzz testing protocol implementations. Unfortunately, many protocols of interest are proprietary, and their specifications are not publicly available. Protocol reverse engineering is an approach to reconstruct the specifications of such closed protocols. Protocol reverse engineering can be tedious work if done manually, so prior research focused on automating the reverse engineering process as much as possible. Some approaches rely on access to the protocol implementation, but in many cases, the protocol implementation itself is not available or its license does not permit its use for reverse engineering purposes. Hence, in this paper, we focus on reverse engineering protocol specifications relying solely on recorded network traffic. More specifically, we propose GrAMeFFSI, a method based on graph analysis that can infer protocol message formats as well as certain field semantics for binary protocols from network traces. We demonstrate the usability of our approach by running it on packet captures of two known protocols, Modbus and MQTT, then comparing the inferred specifications to the official specifications of these protocols.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"62 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74399731","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
Method to Predict Confidential Words in Japanese Judicial Precedents Using Neural Networks With Part-of-Speech Tags 基于词性标签的神经网络预测日本司法判例中机密词的方法
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.1.3
Masakazu Kanazawa, Atsushi Ito, Kazuyuki Yamasawa, Takehiko Kasahara, Yuya Kiryu, Fubito Toyama
{"title":"Method to Predict Confidential Words in Japanese Judicial Precedents Using Neural Networks With Part-of-Speech Tags","authors":"Masakazu Kanazawa, Atsushi Ito, Kazuyuki Yamasawa, Takehiko Kasahara, Yuya Kiryu, Fubito Toyama","doi":"10.36244/icj.2020.1.3","DOIUrl":"https://doi.org/10.36244/icj.2020.1.3","url":null,"abstract":"Abstract—Cognitive Infocommunications involve a combination of informatics and telecommunications. In the future, infocommunication is expected to become more intelligent and life supportive. Privacy is one of the most critical concerns in infocommunications. Encryption is a well-recognized technology that ensures privacy; however, it is not easy to completely hide personal information. One technique to protect privacy is by finding confidential words in a file or a website and changing them into meaningless words. In this paper, we investigate a technology used to hide confidential words taken from judicial precedents. In the Japanese judicial field, details of most precedents are not made available to the public on the Japanese court web pages to protect the persons involved. To ensure privacy, confidential words, such as personal names, are replaced by other meaningless words. This operation takes time and effort because it is done manually. Therefore, it is desirable to automatically predict confidential words. We proposed a method for predicting confidential words in Japanese judicial precedents by using part-of-speech (POS) tagging with neural networks. As a result, we obtained 88% accuracy improvement over a previous model. In this paper, we describe the mechanism of our proposed model and the prediction results using perplexity. Then, we evaluated how our proposed model was useful for the actual precedents by using recall and precision. As a result, our proposed model could detect confidential words in certain Japanese precedents.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"7 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84478276","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
Performance Analysis of Sparse Matrix Representation in Hierarchical Temporal Memory for Sequence Modeling 稀疏矩阵表示在分层时间记忆序列建模中的性能分析
IF 1.1
Infocommunications Journal Pub Date : 2020-01-01 DOI: 10.36244/icj.2020.2.6
Csongor Pilinszki-Nagy, Bálint Gyires-Tóth
{"title":"Performance Analysis of Sparse Matrix Representation in Hierarchical Temporal Memory for Sequence Modeling","authors":"Csongor Pilinszki-Nagy, Bálint Gyires-Tóth","doi":"10.36244/icj.2020.2.6","DOIUrl":"https://doi.org/10.36244/icj.2020.2.6","url":null,"abstract":"Hierarchical Temporal Memory (HTM) is a special type of artificial neural network (ANN), that differs from the widely used approaches. It is suited to efficiently model sequential data (including time series). The network implements a variable order sequence memory, it is trained by Hebbian learning and all of the network’s activations are binary and sparse. The network consists of four separable units. First, the encoder layer translates the numerical input into sparse binary vectors. The Spatial Pooler performs normalization and models the spatial features of the encoded input. The Temporal Memory is responsible for learning the Spatial Pooler’s normalized output sequence. Finally, the decoder takes the Temporal Memory’s outputs and translates it to the target. The connections in the network are also sparse, which requires prudent design and implementation. In this paper a sparse matrix implementation is elaborated, it is compared to the dense implementation. Furthermore, the HTM’s performance is evaluated in terms of accuracy, speed and memory complexity and compared to the deep neural network-based LSTM (Long Short-Term Memory).","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"38 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90396003","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
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学术官方微信