• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.121-126
• /
• 2007

Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1103-1114
• /
• 2003

Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.2
• /
• pp.33-44
• /
• 2022

The simulation function by the 4D system is a representative BIM function in the construction stage. For the 4D simulation, schedule information for each activity must be created and then linked with the 3D model. Since the 3D model created in the design stage does not consider schedule information, there are practical difficulties in the process of creating schedule information for application to the construction stage and linking the 3D model. In this study, after extracting the schedule information of the construction stage using the HDBSCAN algorithm from the 3D model in the design stage, authors propose a methodology for automatically generating schedule information by identifying precedence and sequencing relationships by applying the topological alignment algorithm. Since the generated schedule information is created based on the 3D model, it can be used as information that is automatically linked by the common parameters between the schedule and the 3D model in the 4D system, and the practical utility of the 4D system can be increased. The proposed methodology was applied to the four bridge projects to confirm the schedule information generation, and applied to the 4D system to confirm the simplification of the link process between schedule and 3D model.