• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.171-174
• /
• 2000

This paper proposes a pipelined adaptive filter based on affine projection algorithm with order 2. This filter gives a better convergence performance than that of LMS or NLMS pipeline algorithm and has same latency with the pipeline algorithm based on equivalent transformation. Compared to the critical path of the pipeline NLMS implementation, only 2 additions are increased in that of the proposed implementation.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.114-116
• /
• 2015

This paper presents a Stochastic Time-Cost Tradeoff analysis system (STCT) that identifies optimal construction methods for activities, hence reducing the project completion time and cost simultaneously. It makes use of schedule information obtained from critical path method (CPM), applies alternative construction methods data obtained from estimators to respective activities, computes an optimal set of genetic algorithm (GA) parameters, executes simulation based GA experiments, and identifies near optimal solution(s). A test case verifies the usability of STCT.

• Journal of the Korean Society for information Management
• /
• v.40 no.4
• /
• pp.403-428
• /
• 2023

This study investigates the development path and intellectual structure of data literacy research, aiming to identify emerging topics in the field. A comprehensive search for data literacy-related articles on the Web of Science reveals that the field is primarily concentrated in Education & Educational Research and Information Science & Library Science, accounting for nearly 60% of the total. Citation network analysis, employing the PageRank algorithm, identifies key papers with high citation impact across various topics. To accurately trace the development path of data literacy research, an enhanced PageRank main path algorithm is developed, which overcomes the limitations of existing methods confined to the Education & Educational Research field. Keyword bibliographic coupling analysis is employed to unravel the intellectual structure of data literacy research. Utilizing the PNNC algorithm, the detailed structure and clusters of the derived keyword bibliographic coupling network are revealed, including two large clusters, one with two smaller clusters and the other with five smaller clusters. The growth index and mean publishing year of each keyword and cluster are measured to pinpoint emerging topics. The analysis highlights the emergence of critical data literacy for social justice in higher education amidst the ongoing pandemic and the rise of AI chatbots. The enhanced PageRank main path algorithm, developed in this study, demonstrates its effectiveness in identifying parallel research streams developing across different fields.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.3
• /
• pp.1-8
• /
• 2015

In transportation networks, searching speed and result accuracy are becoming more critical on searching minimum path algorithm. Current $A^*$ algorithm has a big advantage of high searching speed. However, it has disadvantage of complicated searching network and low accuracy rate of finding the minimum path algorithm. Therefore, this study developed $A^*$ algorithm's heuristic function and focused on improving it's disadvantages. Newly developed function in this study contains the area concept, not the line concept. During the progress, this study adopts the idea of a heavier node that remains lighter to the target node is better that the lighter node that becomes heavier when it is connected to the other. Lastly, newly developed algorithm has the feedback function, which allows the larger accuracy value of heuristic than before. This developed algorithm tested on real network, and proved that developed algorithm is useful.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.563-568
• /
• 2007

This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.820-826
• /
• 2007

This paper proposes an enhanced degree computationless modified Euclid's(E-DCME) algorithm and its architecture for Reed-Solomon decoders. The proposed E-DCME algorithm has shorter critical path delay that is $T_{mult}+T_{add}+T_{mux}$ compared with the existing modified Euclid's algorithm and the degree computationless modified Euclid's(DCME) algorithm since it uses new initial conditions. The proposed E-DCME architecture employing a systolic array requires only 2t-1 clock cycles to solve the key equation without initial latency. In addition, the E-DCME architecture consisting of 3t basic cells has regularity and scalability since it uses only one processing element. The E-DCME architecture using the $0.18{\mu}m$ Samsung standard cell library consists of 18,000 gates.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.545-554
• /
• 2004

In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip-flops and full-adders without additional critical path delay. We also propose a resource sharing method and sharing-pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.159-170
• /
• 1992

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4429-4445
• /
• 2019

As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1816-1819
• /
• 2003

As a result of milling operation, we expect to have burr at the outward edge of workpiece. Also, it causes undesirable problems such as deburring cost, low quality of machined surface, and bottleneck in manufacturing process. Though it is impossible to totally remove burr in machining, it is necessary to plan a machining process that minimizes the occurrence of burr. In this paper, a scheme is proposed which identifies the tool path of the milling operation with minimum burr. In the previous research, a Burr Expert System was developed where the feature identification, the cutting condition identification, and the analysis on exit burr formation are the key steps in the program. The Burr Expert System predicts which portion of workpiece would have the exit burr in advance so that we can calculate the burr length of each milling operation. Here, the critical angle determines whether the burr analyzed is an exit burr or not. So the burr minimization scheme becomes to minimize the burr with critical angle. By iterating all the possible tool paths in certain milling operation, we can identify the tool path with minimum burr.