• Journal of Korean Society of Transportation
• /
• v.10 no.1
• /
• pp.41-54
• /
• 1992

The purpose of this thesis is to construct a model to estimate the delay that vehicles arriving randomly will be experienced at an isolated singalized intersection. To do this the following objectives are set in this study: (i) An what distance a random arrival pattern occurs after a platoon of vehicles are dis-charged from the stop line; (ii) A model which estimates the average delay per through-vehicle with respect to the de-gree of saturation; and (iii) The relation between the stepped delay and average approach delay per vehicle. The following are the findings of this study: (i) A random arrival pattern on the first second and third lanes occur 300,400 and 300m downstream from stop line rdspectively. A random arrival pattern on lane group occurs 500m downstream from the stop line ; (ii) A model for the estimation of approach delay has been developed in such a way that up to x=0.7 the delay increases linearly and beyond 0.7 the delay increases rapidly in a form of second order polynomial due to high degree of saturation : and (iii) Approach delay equals approximately 1.21 times of stopped delay.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.484-490
• /
• 2008

For CSLDV, the Chebyshev demodulation (or polynomial) technique and Hilbert transform approach have been used for mode shape reconstruction with harmonic excitation. In this paper, the Hilbert-Huang transform approach was applied as an alternative to impact excitation cases in terms of a numerical approach. The vibration of the tested structure is modeled using impulse response functions. In order to verify this technique, a simply supported beam was chosen as the test rig. With additional innovative steps which are the ideal-band pass filter and the nodal point determination, Hilbert-Huang transformation can be used for a good mode shape reconstruction even in the impact excitation case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1679-1691
• /
• 2016

Successive interference cancellation (SIC) is an effective means of multi-packet reception to combat interference at the physical layer. We investigate the joint optimization issue of channel access and power control for capacity maximization in SIC-enabled wireless networks. We propose a new interference model to characterize the sequential detection nature of SIC. Afterward, we formulize the joint optimization problem, prove it to be a nondeterministic polynomial-time-hard problem, and propose a novel approximation approach based on the genetic algorithm (GA). Finally, we discuss the design and parameter setting of the GA approach and validate its performance through extensive simulations.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.414-419
• /
• 2003

There are some methods fur extracting mode shapes from a continuously scanned data such as a modulation, Chebyshev polynomial, and Hilbert approach. In this paper, Chebyshev and Hilbert approaches were investigated through the numerical experiment first. As some experimental parameters were altered with small quantities, data were checked and plotted. From those results, the effects of unexpected parameters will be configured. And then, it will be actually helpful to select the proper method for specific testing environments.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.34-40
• /
• 2024

Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.789-792
• /
• 2005

In this paper, we propose a method that applies pipeline architecture to parallel CRC circuits. We developed a logic partitioning algorithm for applying pipeline architecture. Our algorithm can be used for the polynomial and the input data width, both of arbitrary length and minimize the logic level. Design experiments show the superiority of our approach in reducing the delay in comparison with previous works.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.70-78
• /
• 1992

In this paper, an approach for 3-D object segmentation and classification, which is based on eigen-values of polynomial function as their surface features, using neural network is proposed. The range images of 3-D objects are classified into surface primitives which are homogeneous in their intrinsic eigenvalue properties. The misclassified regions due to noise effect are merged into correct regions satisfying homogeneous constraints of Hopfield neural network. The proposed method has advantage of processing both segmentation and classification simultaneously.

• Fibers and Polymers
• /
• v.5 no.2
• /
• pp.139-144
• /
• 2004

The orthotropic theory is applied for the nonwoven fabrics that have a preferred orientation direction, the case if the structure is not isotropic. The polynomial regression analysis is employed to allow the attainment of more statistically meaningful information. A functional form based on the transformation rule is developed for the orthotropic approach. The predictions thus obtained are seen to be in excellent agreements with experimental data and the resulting compliances exhibit meaningful relationships for the processing conditions. The compatibility of the compliances from tensile and shear analyses has been explored prior to a practical application of the four compliances defining the in-plane strain-stress field.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.10a
• /
• pp.92-102
• /
• 1986

In this paper, Modular cell approach was applied to custom IC design or RS decoder. For the design of RS decoder by modular cells, 3 basic cells and one extra circuit are designed, these are, SYN cell for syndrome calculation, AL cell for error locator polynomial calculation, and REM cell for remaining error transform calculation. RS decoder design by these basic cells is very simple and regular, and naturally suitable for VLSI RS decoder design.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.236-241
• /
• 1988

This note considers the class of controllers with integral action which arise directly from appropriate system models. Via internal model principle approach, a corresponding class of self-tuning controller is shown to have both integral action in controller and offset removal in the tuning algorithm. The key idea is to constrain the estimator in each step in order to ensure that dc gain of feedforward and feedback polynomial of adaptive controller are always equal, thus allowing the loop integrator to work properly.