• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.752-759
• /
• 2022

The instantiation of spaces as a discrete entity allows users to utilize BIM models in a wide range of analyses. However, in practice, their utility has been limited as spaces are erroneously entered due to human error and often omitted entirely. Recent studies attempted to automate space allocation using artificial intelligence approaches. However, there has been limited success as most studies focused solely on the use of geometric features to distinguish spaces. In this study, in addition to geometric features, semantic relations between spaces and elements were modeled and used to improve space classification in BIM models. Graph Convolutional Networks (GCN), a deep learning algorithm specifically tailored for learning in graphs, was deployed to classify spaces via a similarity graph that represents the relationships between spaces and their surrounding elements. Results confirmed that accuracy (ACC) was +0.08 higher than the baseline model in which only geometric information was used. Most notably, GCN was able to correctly distinguish spaces with no apparent difference in geometry by discriminating the specific elements that were provided by the similarity graph.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.959-962
• /
• 2002

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on De Bruijn Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the De Bruijn graph using properties of graph. Secondly we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU is capable of constructing the De Bruijn geraph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.359-370
• /
• 1997

We consider a facility layout problem with the objective of minimizing total transportation distance, which is the sum of rectilinear distances between facilities weighted by the frequency of trips between the facilities. It is assumed that facilities are required to have rectangular shapes and there is no empty space between the facilities in the layout. In this study, a graph theoretic heuristic is developed for the problem. In the heuristic, planar graphs are constructed to represent adjacencies between the facilities and then the graphs are converted to block layouts on a continual plane using a layout construction module. (Therefore, each graph corresponds to a layout.) An initial layout is obtained by constructing a maximal weighted planar graph and then the layout is improved by changing the planar graph. A simulated annealing algorithm is used to find a planar graph which gives the best layout. To show the performance of the proposed heuristic, computational experiments are done on randomly generated test problems and results are reported.

• Journal of Korean Elementary Science Education
• /
• v.31 no.4
• /
• pp.490-500
• /
• 2012

This study was to examine elementary male and female students' spatial abilities, science process skills, and graph construction and interpretation abilities in order to understand the effect that their spatial abilities and science process skills would have on their graph abilities. To conduct this study, total 12 classes of 435 pupils, 6 classes each from grades 5 and 6 in elementary schools were selected for subjects. The number of male student was 207 and that of female one was 228 of them. And previous test papers of spatial abilities, of science process abilities, and of graph abilities were retouched and updated for reuse in new tests. The results of this study are briefed as follows: Firstly, when spatial abilities for male and female group were compared, female group showed a little higher rate of correct answering than male, but not providing statistically significant gap. Secondly, the science process skill tests revealed basic process skills of both groups were more excellent than their integrated process skills, while female group was found to have more correct answers than male, all of which were proving statistical distinction. Thirdly, of graphing skills for two groups, the graph interpretation skills turned out to be better than the graph construction skills, with female group scoring higher than male and with meaningful difference. Fourthly, both between spatial abilities and graph abilities, and between science process skills and graph abilities, static correlations existed with statistical meaning. In other words, those with higher spatial abilities or science process skills were to do better in constructing and interpreting graphs.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.497-505
• /
• 2017

The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.261-271
• /
• 2007

The symbol C($m_1^{n_1}m_2^{n_2}{\cdots}m_s^{n_s}$) denotes a 2-regular graph consisting of $n_i$ cycles of length $m_i,\;i=1,\;2,\;{\cdots},\;s$. In this paper, we give some construction methods of cyclic($K_v$, G)-designs, and prove that there exists a cyclic($K_v$, G)-design when $G=C((4m_1)^{n_1}(4m_2)^{n_2}{\cdots}(4m_s)^{n_s}\;and\;v{\equiv}1(mod\;2|G|)$.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.273-278
• /
• 1995

In this paper, we propose "a graph structured fuzzy system" which is able to represent the fuzzy system with a graph and optimizes the fuzzy membership functions and fuzzy rule bases using genetic algorithms. It performs the structure identification phase and parameter tuning phase simultancously through the evolutionary process. Additionally, it alleviates some of the drawbacks associated with the current fuzzy construction method with respect to the explosive increase of fuzzy rules which is inevitably encountered whenever the fuzzy systems are applied to problems with the high-dimensional input space.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• v.y2004m10
• /
• pp.59-63
• /
• 2004

In recent days. it is necessary to find environment-friendly way of diposing industrial waste and reclying system. So this study will analyze the property of Porous concrete improved by concrete waste powder and recycled lightweight aggregate and then suggest the ways of reclying. The method deals with experimenting unit weight of capacity. thermal conductivity, compression and ultrasonic pluse velocity. Considering the relation between ultrasonic pluse velocity and unit weight & thermal conductivity through the graph. the result of relation between ultrasonic pluse velocity and unit weight & thermal conductivity on the graph expessed their high interaction shown as direct proportion on the graph. Recycled Porous concrete merits lightweight and adiabatic. Therefore. we will expect that the current using ALC and Recycled Porous concrete has be similar thermal conductivity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2187-2192
• /
• 2006

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) by De Bruijn Graph. The second method is as following. First, we propose transformation operators in order to construct the De Bruijn UMPEU using properties of graph. Second, we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU be able to construct the De Bruijn graph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class. parallel processing network, switching function and its circuits.