• 대한교통학회지
• /
• 제12권1호
• /
• pp.75-84
• /
• 1994

In this paper we address the issue of how an optimal sample size computation relates the level of precision required for travel demand estimations and transportation planning. We approach the problem by 1) deriving a theoretical solution, 2) developing a computational procedure (algorithm) to implement the theoretical solution, and 3) demonstrating a practical application. Ultimately, we construct a formal scheme of optimal sample size computation for use in travel data collection processe.

• 한국농촌건축학회논문집
• /
• 제17권3호
• /
• pp.27-36
• /
• 2015

This research studies the adequate size standard of Seogwipo cruise terminal CIQ facility that is scheduled to be built around Gangjeong harbor area in Seogwipo-city. In order to respond to the highly increasing number of passenger cruise ships compared to Seogwipo cruise terminal design in 2010, the adequate size standard of Seogwipo cruise terminal CIQ facility was examined for passenger service level grade. Based on size computation elements such as the number of passengers of cruise ships with the largest size of port entry, ship landing rate, passenger processing ratio, and surge factor, the CIQ facility size for each service level grade was reviewed. As a result, the area of 2,971m2 (A grade), 2,409 m2 (B grade), and 2,088 m2 (C grade) were computed. This showed that the area of B grade was about 82% and C grade 70% compared to the area of A grade. The CIQ facility size computed for each service level grade in this research was analyzed that its area needed to be increased by 322% at least and 458% at most, compared to the CIQ facility area of 649m2 of the existing design (2010). In order to respond to the increasing number of cruise passengers, provide high-level passenger service, and improve the international image of Jeju, Seogwipo cruise terminal should secure the size that is equal to or higher than the B grade of service level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3482-3497
• /
• 2021

Artificial intelligence has emerged as the core of the 4th industrial revolution, and large amounts of data processing, such as big data technology and rapid data analysis, are inevitable. The most fundamental and universal data interpretation technique is an analysis of information through regression, which is also the basis of machine learning. Ridge regression is a technique of regression that decreases sensitivity to unique or outlier information. The time-consuming calculation portion of the matrix computation, however, basically includes the introduction of an inverse matrix. As the size of the matrix expands, the matrix solution method becomes a major challenge. In this paper, a new algorithm is introduced to enhance the speed of ridge regression estimator calculation through series expansion and computation recycle without adopting an inverse matrix in the calculation process or other factorization methods. In addition, the performances of the proposed algorithm and the existing algorithm were compared according to the matrix size. Overall, excellent speed-up of the proposed algorithm with good accuracy was demonstrated.

• 한국전산유체공학회지
• /
• 제18권2호
• /
• pp.93-98
• /
• 2013

In this paper, we reported the verification of numerical simulation approach for sedimentation of the multi-size particles in a container. The comparison between experimentally measured values and numerically evaluated values on settle down process of fully mixed mixture is carried out. In an attempt to represent the natural particle size distribution, various diameters of single particles are simulated and the results are compared with the outcome of the multi-size computation. When the empirical formula for mean particle size estimation is adopted to define the sediment diameter, computation and comparison are conducted.

• KEPCO Journal on Electric Power and Energy
• /
• 제8권2호
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.57-59
• /
• 2006

The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

• 대한전자공학회논문지SP
• /
• 제48권4호
• /
• pp.38-48
• /
• 2011

Backlight Profile과 Image Pixel의 Homogeneity 분석을 통한 Block 단위 LCD Backlight Nonideality 및 Crosstalk Compensation 방안이 제안되었다. Image에 따라 Block Size 및 연산에서 제외되는 Block 범위 그리고 연산에 고려되는 Backlight 범위를 최적화하여, 화질을 유지하면서 연산량을 최소화시켰다. 실제 영상을 바탕으로 하는 Simulation을 통해 제안된 Compensation 연산량과 화질이 평가되었다.

• ETRI Journal
• /
• 제38권4호
• /
• pp.695-702
• /
• 2016

A hierarchical approach for fast bi-dimensional empirical mode decomposition (B-EMD) is proposed. The presented approach utilizes an efficient window size determination scheme that enables the multi-level computation of the order statistics filter (OSF). Our detailed experiments show that the proposed OSF computation approach allows a significantly faster computation of an EMD without degrading the decomposition accuracy.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.193-198
• /
• 2009

The H.264/ AVC video coding standard supports the intra prediction with various block sizes for luma component and a 8x8 block size for chroma components. This new feature of H.264/AVC offers a considerably higher improvement in coding efficiency compared to previous compression standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intra prediction mode for each block size, and it brings about the drastic increase of the computation complexity of H.264 encoder. In this paper, a fast block size decision algorithm is proposed to reduce the computation complexity of the intra prediction in H.264/AVC. The proposed algorithm computes the smoothness based on AC and DC coefficient energy for macroblocks and compares with the nonparametric criteria which is determined by considering information on neighbor blocks already reconstructed, so that deciding the best probable block size for the intra prediction. Also, the use of non-parametric criteria makes the performance of intra-coding not be dependent on types of video sequences. The experimental results show that the proposed algorithm is able to reduce up to 30% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• 한국IT서비스학회지
• /
• 제7권4호
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.