Search

Most of the train trips in the city of Surabaya still run on a single-track railway that passes through the level crossing between the highway and the railway. In the future, the Indonesian government plans to develop urban railways by converting single tracks into double-track railways and increasing the number of urban train trips. This government plan will impact the characteristics associated with the closure of the level crossing gate. This study analyzes level crossing gate closing characteristics that will occur if it has turned into a double-track railway and increases the number of train trips. The methods used in carrying out this study include a survey at the level crossing location to find out the characteristics that exist today, then simulating with conditions that have changed to double track railway and increase the number of train trips. This simulation estimates characteristics that will occur at the level crossing in the future. The simulation results showed that changing the operating pattern of a train trip to a double-track operation pattern also impacted the closing pattern of the level crossing gate. If the time headway of arrival between trains at the level crossing in the opposite direction is less than 2.3 minutes, then one closing of the level crossing gate can serve two train trips in the opposite direction. As for the time headway of arrival between trains at the level crossing in the opposite direction greater than 2.3 minutes until 5,7 minutes, one closing of the level crossing gate only serves one train trip. [ABSTRACT FROM AUTHOR]

To improve rail-based urban public transport services, the Indonesian government plans to increase rail trips in Surabaya. One of the additional train trip plans is to add an urban train trip from Surabaya Kota station to Gubeng station from 06:00 to 22:00 with headway every 30 minutes. The increase in train trips will result in more frequent closure of level crossing gates and more incredible queues. The purpose of the study was to find out how many additional rail trips can increase the number of train trips that already exist without causing any meaningful effect on highway traffic. The research method used is to analyze the characteristics of road traffic at level crossings that occur at this time, then simulate the addition of train trips with headway every 30 minutes. The simulation results showed that the additional train trip from 06:00 to 22:00 with the headway every 30 minutes was only 45 to 57 trips. Not all scheduled plans for additional train trips can increase the number of existing train trips. Only 68.18% to 86.36% of the planned additions could add to the number of existing train trips. The addition of train trips also resulted in the addition of vehicle queues and also the addition of queue dispersal times that occurred. [ABSTRACT FROM AUTHOR]

Elliptic Curve Cryptography (ECC) is a public key cryptosystem with a security level determined by discrete logarithm problem called Elliptic Curve Discrete Logarithm Problem (ECDLP). John M. Pollard proposed an algorithm for discrete logarithm problem based on Monte Carlo method and known as Pollard Rho algorithm. The best current bruteforce attack for ECC is Pollard Rho algorithm. In this research we implement modified Pollard Rho algorithm on ECC over GF (241). As the result, the runtime of Pollard Rho algorithm increases exponentially with the increase of the ECC key length. This work also presents the estimated runtime of Pollard Rho attack on ECC over longer bits. [ABSTRACT FROM AUTHOR]

A novel method of inserting noise into stream of ciphered text is proposed. The goal of inserting noise is to increase the level of uncertainty, thus making it harder for an attacker to detect data and noise. This form of steganography is implemented using Elliptic Curve Cryptography (ECC). The process of embedding the noise to the message in the encryption process and removing the noise from the message in the decryption process is proposed in this work by modifying ElGamal to allow auto detection of data and noise. [ABSTRACT FROM AUTHOR]

Network administrators must rely on labour-intensive processes for tracking network configurations and vulnerabilities, which requires a lot of expertise and error prone. Organizational network vulnerabilities and interdependencies are so complex to make traditional vulnerability analysis become inadequate. Decision support capabilities let analysts make tradeoffs between security and optimum availability, and indicates how best to apply limited security resources. Recent work in network security has focused on the fact that a combination of exploitation is the typical way in which the invader breaks into the network. Researchers have proposed various algorithms to generate graphs based attack tree (or graph). In this paper, we present a framework, Architecture and Approach to Vulnerability Analysis. [ABSTRACT FROM PUBLISHER]