2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)最新文献_第2页

Assignment First Routing Second (AFRS) Algorithm for City Logistics 城市物流分配优先路由第二(AFRS)算法

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353311

T. Iswari, F. Setiawan

{"title":"Assignment First Routing Second (AFRS) Algorithm for City Logistics","authors":"T. Iswari, F. Setiawan","doi":"10.1109/TIME-E47986.2019.9353311","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353311","url":null,"abstract":"Transport of goods is one of the critical elements for supporting economic development in an urban area. There are several issues related to the transportation of goods in the city, e.g. environmental and energy issue. With the problems of transportation of products in the urban area, the concept of city logistics was introduced. One of the city logistics solutions is the use of various types of vehicles to transport products, including small vehicles. This study develops an assignment first routing second (AFRS) algorithm to solve the heterogeneous vehicle routing problems in the context of city logistics. The algorithm is divided into two mathematical models; i.e. assignment problem and travelling salesman problem. The branch-and-bound method is used for solving those problems. In this research, there are many types of vehicles used to deliver goods to consumers in the urban area. The algorithm considers the level of congestion in the customer area. The main purpose of the algorithm is to make the right assignments, so the small vehicles can be optimally assigned to serve customers, especially in congested areas, but do not exceed their vehicle capacity. Then, this research determines the most optimal route with the objective function is to minimize the total distance travelled by each vehicle. This study used hypothetical data to test and verify the algorithm. Seven data instances are developed with the number of customers are ranged from 20 to 80 customers, also with various type and amount of vehicles for each case. From the computational results, the algorithm successfully found the optimal assignments strategy for six datasets. In that strategy, the small vehicles are optimally assigned to serve as many customers as possible, especially for customers in congested areas. The optimal route for each vehicle is also found with the travelling salesman problem (TSP) model.","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496879","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

EMG Patterns of Healthy Subjects with Shoulder Rehabilitation Robot 肩部康复机器人对健康受试者肌电图的影响

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353318

A. I. Simbolon, Kadek Heri Sanjaya, A. Widyotriatmo

引用次数: 1

Hybrid Algorithm Combining Modified Diffie Hellman and RSA 结合改进Diffie Hellman和RSA的混合算法

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353292

Junnel E. Avestro, Ariel M. Sison, Ruji P. Medina

{"title":"Hybrid Algorithm Combining Modified Diffie Hellman and RSA","authors":"Junnel E. Avestro, Ariel M. Sison, Ruji P. Medina","doi":"10.1109/TIME-E47986.2019.9353292","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353292","url":null,"abstract":"The Classic Diffie-Hellman (CDH) algorithm encounters several security problems. The algorithm security depends on the complexity of solving the discrete logarithm and the integer factorization problem. The security also depends on the length of bits keys used. In this paper, we proposed a hybrid algorithm, the combination of Modified Diffie Hellman (MDH) with the Rivest, Shamir, and Adelman (RSA) algorithm. The MDH will not use primitive root (g). Instead, it will use two prime numbers (P and Q) for key exchange. It reduces the possibility of a man-in-the-middle attack. Furthermore, the MDH has an authentication mechanism. If both shared keys are equal, the communication will continue. Otherwise, it will stop because it is compromised. Also, the RSA algorithm will use the two prime numbers generated by MDH (P and Q). The RSA algorithm will perform the encryption and decryption message. The Diffie Hellman (DH) and the RSA Algorithms are the basis of several security standards and services on the internet, especially TLS and SSL. If the security of both algorithms is compromised, such systems will collapse. In this proposal, the combined cryptography system aims to achieve secret message exchange; it uses random prime numbers after multiplication and eventually shared with the other end of a communication. The proposed algorithm secretly generate a value so that the security level increases","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129843514","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

A Literature Review on Control Chart Development in Healthcare Monitoring 健康监测中控制图发展的文献综述

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353320

Alfian Tan, M. Nainggolan, C. Rikardo

{"title":"A Literature Review on Control Chart Development in Healthcare Monitoring","authors":"Alfian Tan, M. Nainggolan, C. Rikardo","doi":"10.1109/TIME-E47986.2019.9353320","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353320","url":null,"abstract":"This paper presents a review on the ideas behind a control chart development for medical treatment monitoring in hospital. A description and analysis on various concepts underlying the tool construction are extracted and analyzed based on several scientific journals found in their publisher database as well as explorations using some scientific publication searching machines. The exploration and filtering process on the scientific articles results in 43 works that become a final set to obtain information related to the research issue. There are 7 problem areas that are presented to explain the monitoring problem in healthcare services which contain differences on patient conditions (10 papers), data shortage (4 papers), multi-indicator monitoring (4 papers), monitoring sensitivity (28 papers), tool practicality (8 papers), improvement-type shifting detection (3 papers), and model assumption violations (6 papers). Based on the this knowledge, some basic directions on control chart development in medical treatment monitoring is constructed. These directions are divided into three categories that deal with the nature of medical condition, control chart technical properties, and the supporting factor in control chart application.","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122561510","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 Variable Neighborhood Search Algorithm for Two-Dimensional Bin Packing Problem with Compatible Categories 一类兼容二维装箱问题的变邻域搜索算法

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353322

Jasmin A. Caliwag, M. C. C. Aragon, Ruji P. Medina

{"title":"A Variable Neighborhood Search Algorithm for Two-Dimensional Bin Packing Problem with Compatible Categories","authors":"Jasmin A. Caliwag, M. C. C. Aragon, Ruji P. Medina","doi":"10.1109/TIME-E47986.2019.9353322","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353322","url":null,"abstract":"Adding additional constraints in Bin Packing with Compatible Categories using Variable Neighborhood Search metaheuristic algorithm will solve more real-life size instances problem. This research study determined the best assignment of packing a distinct product in order to minimize the required number of bins. This method was performed by testing extensive computational experiments in different algorithms with a very large set of 2000 instances. The tested instances differ in terms of number of items, bin capacities, compatibility matrices and proportion of items that belong to the different categories, length, weight and width constraints. The researchers had chosen First Fit Category Decreasing for Bin Packing with Compatible Category, and Variable Neighborhood Search for Bin Packing with Compatible Category algorithms for comparative experiment of the result and an average of one (1) bin reduced was achieved. Therefore this indicates that a Variable Neighborhood Search algorithm for two-dimensional can effectively solve the problem of Bin Packing with Compatible Categories.","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133259203","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

Technical Session and Program Schedule 技术会议和项目时间表

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/time-e47986.2019.9353298

引用次数: 0

Simple and Secured Password Hiding Technique for Image-based Authentication using a Least Significant Bit based Embedding Scheme 基于最小有效位嵌入方案的基于图像认证的简单安全密码隐藏技术

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353313

Fredilyn B. Calanda, Ariel M. Sison, Mark Rennel D. Molato, Ruji P. Medina

{"title":"Simple and Secured Password Hiding Technique for Image-based Authentication using a Least Significant Bit based Embedding Scheme","authors":"Fredilyn B. Calanda, Ariel M. Sison, Mark Rennel D. Molato, Ruji P. Medina","doi":"10.1109/TIME-E47986.2019.9353313","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353313","url":null,"abstract":"This study proposes a secured and straightforward password hiding technique to address authentication problems. The idea of Least Significant Bit based image steganography and data hiding technique is utilized to come up with an image-based authentication to make it easier for the users to maintain their password. The proposed technique also resolve the burden of memorizing every password for all accounts and avoid “Shoulder surfing” by hiding the password in the cover image. Although there is a rising number of innovative ways to authenticate users and text-based passwords are still popular and generally used method, the proposed technique aims to improve existing authentication and address the drawbacks of text-based authentication. The use of randomized embedding, image partitioning, and columnar transposition help increase the complexity of the extraction of the password embedded in the cover image. At the same time, the use of the one-time pad Encryption added a layer of security in keeping the password. In this way, the password is kept secure and confidential. A series of testing was conducted to verify the outcome of the proposed technique. The Peak-to-Signal-Noise-ratio (PSNR) and Similarity Index (SSIM) average result is 72.5688 and 0.9999, respectively. The result proves that the generated image password has high imperceptibility. While the probability of detection of image password using statistical attacks is low since the majority of the stego images attained an acceptable degree with RS Analysis average result of 0.0627, Chi-Square Analysis average result of 0.174203882 and Sample Pair Analysis average result of 0.06229.","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115692761","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

DC Chopper for The Excitation Voltage Regulation of Synchronous Generator on a Microgrid Testbed 微电网试验台同步发电机励磁调压用直流斩波器

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) Pub Date : 2019-11-13 DOI: 10.1109/TIME-E47986.2019.9353307

Sheylin Wimora Lumban Tobing, F. D. Wijaya, S. P. Hadi

{"title":"DC Chopper for The Excitation Voltage Regulation of Synchronous Generator on a Microgrid Testbed","authors":"Sheylin Wimora Lumban Tobing, F. D. Wijaya, S. P. Hadi","doi":"10.1109/TIME-E47986.2019.9353307","DOIUrl":"https://doi.org/10.1109/TIME-E47986.2019.9353307","url":null,"abstract":"The development of a microgrid for archipelagos like Indonesia is a solution in supplying electrical energy. However, the load connected into the microgrid systems vary, this causes a systematic change in the form of voltage. In this paper, the microgrid testbed simulation is explained. The simulation system of the microgrid testbed consists of a diesel- fueled power plant as an implementation of a synchronous generator and two micro-hydro power plant and wind power plant as an implementation of induction generators. The change of load will affect the output voltage of the synchronous generator thus affecting the output voltage of the microgrid system. Excitation control on a synchronous generator is needed to maintain voltage stability regardless of load variation. In this paper, the excitation system of the synchronous generator is simulated. The excitation system uses the topology of DC chopper as an excitation voltage regulator with a PI control system. Testing is done in two scenarios with three load variations when DC Chopper is controlled and uncontrolled. The presence of an optimally controlled DC Chopper can control a system's voltage output that sits at the standard (+5% dan −10%) Vrms ±220 Volt.","PeriodicalId":345220,"journal":{"name":"2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128688116","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