Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control最新文献

An l1-Norm Regularized Copula Based Feature Selection 基于11范数正则Copula的特征选择

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3386177

Snehalika Lall, S. Bandyopadhyay

引用次数: 2

Epidemic System Conversion on Industry 4.0's Perspective Under Dynamic Network Condition 动态网络条件下工业4.0视角下流行病系统转换

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3386180

P. Poonpakdee, J. Koiwanit, C. Yuangyai

{"title":"Epidemic System Conversion on Industry 4.0's Perspective Under Dynamic Network Condition","authors":"P. Poonpakdee, J. Koiwanit, C. Yuangyai","doi":"10.1145/3386164.3386180","DOIUrl":"https://doi.org/10.1145/3386164.3386180","url":null,"abstract":"In large-scale manufacturing operations with increasing global competition, success depends on a reliable network system to complete a value chain transformation. The use of the Industry 4.0 paradigm is increasingly evolving in many areas of different industries to ensure significant increases in factory productivity, flexibility, and efficiency. Consequently, the system transformation requires a shift from single automated node to a fully integrated system. However, selected methodology and results require study to fully understand the digital transformation as well as its characteristics. This investigation presents a system conversion study, between centralized and decentralized systems, using the concept of epidemic membership protocols in the context of Industry 4.0. This paper proposes the method based on membership protocols focusing on the system conversion methodology under dynamic network condition. The experimental results show that the proposed method provides an ability to rewrite the structure of the network topology with optimal accuracy of epidemic application.","PeriodicalId":231209,"journal":{"name":"Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124830088","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

Naming Anonymous Processes with Test-and-Set Registers 使用测试-设置寄存器命名匿名进程

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3386182

Layla S. Aldawsari

{"title":"Naming Anonymous Processes with Test-and-Set Registers","authors":"Layla S. Aldawsari","doi":"10.1145/3386164.3386182","DOIUrl":"https://doi.org/10.1145/3386164.3386182","url":null,"abstract":"A system of anonymous processes that have no names assigned to them is considered in both synchronous and asynchronous communication models. The processes are fault free and can only communicate using test-and-set (TAS) registers. The aim of the paper is to assign unique names to all processes using a distributed algorithm. The naming of anonymous processes is studied in eight new problem models based on two categories; the number of TAS registers available, and the knowledge of the number of processes. In this paper, two distributed naming algorithms are developed that can assign unique names to anonymous processes. One is deterministic and the other is randomized. The developed algorithms are optimal in time complexity and namespace size. The Sequential Lookup algorithm, which is a deterministic algorithm, has a time complexity of 0(n2) steps, whereas the Random Lookup algorithm, which is a randomized algorithm, has a time complexity of 0(n log n) steps. Proof of the correctness of each naming algorithm is presented for all categories of the problem model where the number of processes is known. The Random Lookup algorithm has a better time complexity compared to the Sequential Lookup algorithm due to the use of randomness in accessing TAS registers.","PeriodicalId":231209,"journal":{"name":"Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126738499","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

A General Architecture for a Real-Time Monitoring System Based on the Internet of Things 一种基于物联网的实时监控系统通用架构

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3387295

Nilakantha Paudel, R. Neupane

引用次数: 11

Octree-Based Hierarchical 3D Pathfinding Optimization of Three-Dimensional Pathfinding 基于八叉树的三维分层寻路优化

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3386181

Timur Muratov, A. Zagarskikh

{"title":"Octree-Based Hierarchical 3D Pathfinding Optimization of Three-Dimensional Pathfinding","authors":"Timur Muratov, A. Zagarskikh","doi":"10.1145/3386164.3386181","DOIUrl":"https://doi.org/10.1145/3386164.3386181","url":null,"abstract":"Despite the fact that the problem of pathfinding exists for quite a while, most of the related work is focused on methods that are applicable only in 2D environment. However, there is a demand for methods that can provide a solution for pathfinding tasks in 3D working space. These tasks mostly come from area of robotics and game development, where it is often required to get a solution in real-time. The main problem, besides the lack of appropriate methods, is that in 3D environment the working space size increases greatly in comparison with 2D case, and it becomes harder to construct a precise representation of this space while maintaining low size of search graph. To overcome this, methods that lower graph size, whether explicitly or implicitly, are used. This paper provides a brief review on some of existing approaches, comparison of their effectiveness and presentation a new method of real-time pathfinding in 3D environment that can be helpful in real-time calculations (i.e. game development area). This brief review will be referred to when comparing proposed method with existing ones. A proposed method combines advantages of using octree structure as search graph (such as sparce free space representation) and hierarchical path planning (effective reduction of graph size by clustering). Thus, an appreciable speed-up is achieved.","PeriodicalId":231209,"journal":{"name":"Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544307","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

Cloud-Based Battery Digital Twin Middleware Using Model-Based Development 基于模型开发的云电池数字孪生中间件

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3387296

Lukas Merkle

{"title":"Cloud-Based Battery Digital Twin Middleware Using Model-Based Development","authors":"Lukas Merkle","doi":"10.1145/3386164.3387296","DOIUrl":"https://doi.org/10.1145/3386164.3387296","url":null,"abstract":"Following the trends of electrification, the energy storage of vehicles is gaining importance as the most expensive part of an electric car. Since lithium-ion batteries are perishable goods and underlie e. g. aging effects, environmental and operating conditions during manufacturing and car usage need close supervision. With regard to the paradigm of digital twins, data from various life cycle phases needs to be collected and processed to improve the general quality of the system. To achieve this complex task, a suitable framework is needed in order to operate the fleet of digital twins during manufacturing processes, the automotive usage and a potential second life. Based on a literature review, we formulate requirements for a digital twin framework in the field of battery systems. We propose a framework to develop and operate a fleet of digital twins during all life cycle phases. Results feature a case study in which we implement the stated framework in a cloud-computing environment using early stages of battery system production as test a bed. With the help of a self-discharge model of li-ion cells, the system can estimate the SOC of battery modules and provide this information to the arrival testing procedures.","PeriodicalId":231209,"journal":{"name":"Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control","volume":"482 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124496218","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

Machine Learning Techniques for Classification of Spambase Dataset: A Hybrid Approach 垃圾数据集分类的机器学习技术:一种混合方法

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3389089

Shikha Verma, A. Gautam

引用次数: 1

A Meta-Heuristic Computation Offloading Strategy for IoT Applications in an Edge-Cloud Framework 边缘云框架下物联网应用的元启发式计算卸载策略

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3390513

Xuezhen Huang, Yang Yang, Xinglu Wu

{"title":"A Meta-Heuristic Computation Offloading Strategy for IoT Applications in an Edge-Cloud Framework","authors":"Xuezhen Huang, Yang Yang, Xinglu Wu","doi":"10.1145/3386164.3390513","DOIUrl":"https://doi.org/10.1145/3386164.3390513","url":null,"abstract":"Edge-cloud computing provides performance guarantees for IoT applications which are real-time or security sensitive. The new placement of edge-cloud services leverages resources both in Cloud Data Centers (CDC) and at the edge of the network. A computation task can be divided into subtasks and offloaded to different edge/cloud servers, which are donated as offloading destinations. Offloading destination heterogeneity and different architecture of Edge Data Center (EDC) and CDC bring challenges to computation offloading. One critical issue in edge-cloud computing is energy consumption in computation offloading. The existing computation offloading strategies either ignored energy consumption or ignored delay and/or security constraints. Meta-heuristic strategies have been used widely to design heuristic resource allocation algorithms in CDC. This paper aims to explore meta-heuristic energy-efficient computation offloading (EE-CO) approaches with the objective to meet the delay and security constraints, while minimizing energy consumption. To achieve the goal, we investigated the performance of the Ant-Colony-Optimization (ACO) strategies combining with mixed integer programming (MIP). We propose an ACO-based computation offloading strategy, which including two algorithms, called EA-OMIP and EA-RMIP, respectively. The only difference of them is the construction method of integer programming models. Simulations are carried out to value the performance of proposed two algorithms. We also give an analysis of the experimental results in terms of the subtask acceptance ratio, revenue of the cloud service provider (CSP), and the resource utilization.","PeriodicalId":231209,"journal":{"name":"Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763723","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}

引用次数: 9

Robotic Grasp Pose Estimation Oriented Deep Learning Algorithm Based on Residual Network 基于残差网络的机器人抓取姿势估计深度学习算法

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3389081

Fan Bai, Renjie Yao, Maoning Chen, Zhexin Cui

引用次数: 1

Face Recognition for Attendance System Using Neural Networks Technique 基于神经网络技术的考勤系统人脸识别

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control Pub Date : 2019-09-25 DOI: 10.1145/3386164.3389102

D. Prangchumpol

引用次数: 3