• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.61-67
• /
• 2017

For a project network analysis, a fundamental problem is to estimate the distribution function of the project completion time. In this paper, we propose a method for evaluating moments(mean, variance, skewness, kurtosis) of the project completion time under the assumption that the durations of activities are independently and normally distributed. The proposed method utilizes the technique of discretization to replace the continuous probability density function(pdf) of activity duration with its discrete pdf and a random number generation. The proposed method is easy to use for large-sized project networks, and the computational results of the proposed method indicate that the accuracy is comparable to that of direct Monte Carlo simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6243-6259
• /
• 2019

As a foundation of next-generation air transportation systems, automatic dependent surveillance-broadcast (ADS-B) helps pilots and air traffic controllers create a safer and more efficient national airspace system. Owing to the open communication environment, it is easy to insert fake aircraft into the system via spoofing or the insertion of false messages. Efforts have thus been made in academic research and practice in the aviation industry to ensure the security of transmission of messages of the ADS-B system. An identity-based batch verification (IBV) scheme was recently proposed to enhance the security and efficiency of the ADS-B system, but current IBV schemes are often too resource intensive because of the application of complex hash-to-point operations or bilinear pairing operations. In this paper, we propose a lightweight IBV signature scheme for the ADS-B system that is robust against adaptive chosen message attacks in the random oracle model, and ensures the security of batch message verification and against the replaying attack. The proposed IBV scheme needs only a small and constant number of point multiplication and point addition computations instead of hash-to-point or pairing operations. Detailed performance analyses were conducted to show that the proposed IBV scheme has clear advantages over prevalent schemes in terms of computational cost and transmission overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Korean Journal of Medicinal Crop Science
• /
• v.13 no.2
• /
• pp.69-74
• /
• 2005

Kalopanax pictus is a long-lived woody species mostly distributed in East Asia. K. pictus has been regarded as medically and ecologically important species in Korea. Thornless castor aralia variant, local name 'Cheongsong' is an endemic to Cheongsong province in Korea. Random amplified polymorphic DNA (RAPD) was used to investigate the genetic variation and structure of Korean populations of two species. A high level of genetic variation was found in six K. pictus populations. Twelve primers revealed 49 loci, of which 29 were polymorphic (59.2%). Nei's gene diversity for K.pictus and K. pictus variant were 0.119 and 0.098, respectively. Mean of genetic diversity in K. pictus was higher than average values for species with similar life history traits. The asexual and sexual reproduction, perennial habitat, and longevity are proposed as possible factors contributing to high genetic diversity. An indirect estimate of the number of migrants per generation (Nm=0.857) indicated that gene flow was not extensive among Korean populations of K.pictus. It is suggested that the isolation of geographical distance and reproductive isolation between K.pictus and K.pictus variant populations may have played roles in shaping the population structure of this species.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.7 no.4
• /
• pp.622-632
• /
• 1995

The present numerical study is aimed to investigate time-dependent characteristics of a two-dimensional lid-driven square cavity flow of three high Reynolds numbers, $7.5{\times}10^3$, $10^4$ and $3{\times}10^4$. A conservative convection term on irregular grids was adopted by renewing the MAC type difference schemes on regular grids. Relaxation of velocity and pressure is implemented by SOLA algorithm. In case of $Re=7.5{\times}10^3$, flow behavior converges to steady state after a transient period. But for $Re=10^4$, periodic unsteady sinusoidal fluctuation of local velocity and kinetic energy is found and continuous movements of small eddies in the secondary flow regions are also discovered. Random generation of eddies and their active migrating behavior are detected for $Re=3{\times}10^4$, resulting in complete unsteady and non-linear flow characteristics. And, an organized structure similar to a Moffat vortex is also observed from the time-mean flow patterns. Furthermore, a typoon-like vortex(TLV) appears intemittently and rotates along the separation regions and boundary layers.

• International journal of advanced smart convergence
• /
• v.10 no.1
• /
• pp.75-81
• /
• 2021

As the number of connected smart devices and applications increases explosively, the existing orthogonal multiple access (OMA) techniques have become insufficient to accommodate mobile traffic, such as artificial intelligence (AI) and the internet of things (IoT). Fortunately, non-orthogonal multiple access (NOMA) in the fifth generation (5G) mobile networks has been regarded as a promising solution, owing to increased spectral efficiency and massive connectivity. In this paper, we investigate the achievable data rate for non-orthogonal multiple access (NOMA) with negatively-correlated information sources (CIS). For this, based on the linear transformation of independent random variables (RV), we derive the closed-form expressions for the achievable data rates of NOMA with negatively-CIS. Then it is shown that the achievable data rate of the negatively-CIS NOMA increases for the stronger channel user, whereas the achievable data rate of the negatively-CIS NOMA decreases for the weaker channel user, compared to that of the positively-CIS NOMA for the stronger or weaker channel users, respectively. We also show that the sum rate of the negatively-CIS NOMA is larger than that of the positively-CIS NOMA. As a result, the negatively-CIS could be more efficient than the positively-CIS, when we transmit CIS over 5G NOMA networks.

• Journal of the Korean Society for Railway
• /
• v.14 no.6
• /
• pp.526-534
• /
• 2011

In this study, proposed is the methodology to determine the upper limit for stiffness of rail pad for the ballasted and concrete track in high-speed railway in the viewpoint of running safety, considering the dynamic characteristics of train and track and the operation environment. For the track irregularity, one of the most important input parameters for traintrack interaction analysis, the reference vertical track irregularity PSDs(power spectral densities) for the ballasted and concrete track in a wide range of frequencies were proposed based on those presented in France and Germany and that obtained from the measured data at Kyeong-Bu 1st phase high-speed railway line. Using these reference PSD models, the input data for the vertical track irregularity data were regenerated by random generation process, and then, the wheel load reduction rates according to the stiffness of the rail pads have been calculated by the train-track interaction analysis technique. Finally, by comparing the wheel load reduction rates calculated with the derailment criteria prescribed in the Korean standards for railway vehicle safety criteria, the upper limits for the stiffness of rail pad have been proposed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1071-1077
• /
• 2022

A security SoC that can be used to implement elliptic curve cryptography (ECC) based public-key infrastructures was designed. The security SoC has an architecture in which a hardware accelerator for the elliptic curve digital signature algorithm (ECDSA) is interfaced with the Cortex-A53 CPU using the AXI4-Lite bus. The ECDSA hardware accelerator, which consists of a high-performance ECC processor, a SHA3 hash core, a true random number generator (TRNG), a modular multiplier, BRAM, and control FSM, was designed to perform the high-performance computation of ECDSA signature generation and signature verification with minimal CPU control. The security SoC was implemented in the Zynq UltraScale+ MPSoC device to perform hardware-software co-verification, and it was evaluated that the ECDSA signature generation or signature verification can be achieved about 1,000 times per second at a clock frequency of 150 MHz. The ECDSA hardware accelerator was implemented using hardware resources of 74,630 LUTs, 23,356 flip-flops, 32kb BRAM, and 36 DSP blocks.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.165-172
• /
• 2002

In the next generation mobile communications, powerful channel coding is essential in order to obtain high quality multimedia services. Turbo code can achieve good error performance by iterative decoding, but more iterations result in additional computational complexity and delay. Thus, a method to reduce the number of iterations without additional performance degradation is needed. Turbo code with CRC is known to be the most efficient method to reduce the number of iterations. In this scheme, the performance may be degraded by the edge-effect like the conventional turbo code without CRC. In this paper, a method to eliminate the edge-effect is proposed by adopting D-parameter to the conventional s-random interleaver. As results of simulation, the edge-effect of the turbo code with CRC is shown to be successfully eliminated by using the new interleaver designed with D-parameter.