• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1107-1116
• /
• 2014

In this paper, we review recent developments in network analysis using the graph theory, and introduce ongoing research area with relevant theoretical results. In specific, we introduce basic notations in graph, and conditional and marginal approach in constructing the adjacency matrix. Also, we introduce the Marcenko-Pastur law, the Tracy-Widom law, the white Wishart distribution, and the spiked distribution. Finally, we mention the relationship between degrees and eigenvalues for the detection of hubs in a network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.724-729
• /
• 2011

Information retrieval is a method to search the needed data by users. Generally, when a user searches some data in the large scale data set like the internet, ranking-based search is widely used because it is not easy to find the exactly needed data at once. In this paper, we propose a novel ranking-based search method based on sequence and adjacency relationship of user query by the help of TF-IDF and n-gram. As a result, it was possible to find the needed data more accurately with 73% accuracy in more than 19,000 data set.

• Korean Journal of Remote Sensing
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2002

A hybrid image segmentation algorithm is proposed which integrates edge-based and region-based techniques through the watershed algorithm. First, by using mean curvature diffusion coupled to min/max flow, noise is eliminated and thin edges are preserved. After images are segmented by watershed algorithm, the segmented regions are combined with neighbor regions. Region adjacency graph (RAG) is employed to analyze the relationship among the segmented regions. The graph nodes and edge costs in RAG correspond to segmented regions and dissimilarities between two adjacent regions respectively. After the most similar pair of regions is determined by searching minimum cost RAG edge, regions are merged and the RAG is updated. The proposed method efficiently reduces noise and provides one-pixel wide, closed contours.

• Korean Journal of Community Nutrition
• /
• v.16 no.1
• /
• pp.98-112
• /
• 2011

This study aimed to suggest a 1300 scale of a middle school foodservice facility floor plan which was compliant to the principle of HACCP, as well as ensuring food and work safety, and the flow of personnel and food materials. which consisted of 46 nutrition teachers and 6 experts, responded with a questionnaire on the relationship of functional area and space. Using their opinions, key principles for the design of the facility were single direction movement of food materials, customers and workers; minimization of the cross-contamination through the separation of functional space; and securement of customer-focused efficiency; staff-centered convenience and efficiency; and work and food safety. After the completion of an adjacency diagram, bubble diagram and program statement, the functional areas of a 1300 scale middle school food-service facility were allocated as follows: $9.9\;m^2$ for the receiving area, $56.1\;m^2$ for the pre-preparation area, $10.5\;m^2$ for the food storage area, $6.0\;m^2$ for the supplies storage area, $97.8\;m^2$ for the cooking area, $33.6\;m^2$ for the service area, $52.5\;m^2$ for dish washing area, cafeteria $410.5\;m^2$, $4.5\;m^2$ for the front room, for a total of $725.8\;m^2$. Expert groups have pointed to limitations within this model as there are no windows in the office for the influx of fresh outside air and a need for the straight line installation of steam-jacket and frying kettles on the sides of windows. This study can be useful as the guidelines for estimating the investment cost of the facility and placing the placement of functional areas and equipment in the renovation of the facility. It can be also useful data for a methodology of foodservice facility design.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.242-254
• /
• 2000

This paper describes an efficient solid modeling method for thin-walled plastic or sheet metal parts, based on the non-manifold offsetting operations. Since the previous methods for modeling and converting a sheet into a solid have adopted the boundary representations for solid object as their topological framework, it is difficult to represent the exact adjacency relationship between topological entities of a sheet model and a mixture of wireframe and sheet models that can appear in the meantime of modeling procedure, and it is hard to implement topological operations for sheet modeling and transformation of a sheet into a solid. To solve these problems, we introduce a non-manifold B-rep and propose a sheet conversion method based on a non-manifold offset algorithm. Because the non-manifold offset aigorithm based on mathematical definitions results in an offset solid with tubular and spherical thickness-faces we modify it to generate the ruled or planar thickness-faces that are mostly shown in actual plastic or sheet metal parts. In addition, in order to accelerate the Boolean operations used the offset algorithm, we also develope an efficient face-face intersection algorithm using topological adjacency information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.360-373
• /
• 2017

This paper presents a novel digital video steganalysis scheme against the spatial domain video steganography technology based on a spatial temporal detector (ST_D) that considers both spatial and temporal redundancies of the video sequences simultaneously. Three descriptors are constructed on XY, XT and YT planes respectively to depict the spatial and temporal relationship between the current pixel and its adjacent pixels. Considering the impact of local motion intensity and texture complexity on the histogram distribution of three descriptors, each frame is segmented into non-overlapped blocks that are $8{\times}8$ in size for motion and texture analysis. Subsequently, texture and motion factors are introduced to provide reasonable weights for histograms of the three descriptors of each block. After further weighted modulation, the statistics of the histograms of the three descriptors are concatenated into a single value to build the global description of ST_D. The experimental results demonstrate the great advantage of our features relative to those of the rich model (RM), the subtractive pixel adjacency model (SPAM) and subtractive prediction error adjacency matrix (SPEAM), especially for compressed videos, which constitute most Internet videos.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2006

The Flexible Management System (FMS) consists of parallel and concurrent machines, pieces of equipment, and carrying systems classified as buffers, tools, and routers, respectively. The concurrent flow of multiple productions in a system is competed with one another for resources and this resulting competition can cause a deadlock in FMS. Since a deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop, it is very important to detect and prevent a deadlock. Herein a new algorithm has been studied in order to detect and prevent deadlocks, after defining a relationship between the general places and resource share places in Petri nets like as DAPN: Deadlock Avoidance Petri Net. For presenting the results, the suggested algorithms were also adapted to the models that demonstrated FMS features.

• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.613-619
• /
• 2006

This study proposed an unsupervised image classification through the dendrogram of agglomerative clustering as a higher stage of image segmentation in image processing. The proposed algorithm is a hierarchical clustering which includes searching a set of MCSNP (Mutual Closest Spectral Neighbor Pairs) based on the data structures of RAG(Regional Adjacency Graph) defined on spectral space and Min-Heap. It also employes a multi-window system in spectral space to define the spectral adjacency. RAG is updated for the change due to merging using RNV (Regional Neighbor Vector). The proposed algorithm provides a dendrogram which is a graphical representation of data. The hierarchical relationship in clustering can be easily interpreted in the dendrogram. In this study, the proposed algorithm has been extensively evaluated using simulated images and applied to very large QuickBird imagery acquired over an area of Korean Peninsula. The results have shown it potentiality for the application of remotely-sensed imagery.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.1
• /
• pp.47-54
• /
• 2019

This study proposes a new ERAM model with building population weighting. Previous studies of applying weightings on ERAM model on the scale of urban space were focused on the relationship between the street and the human behavior. However, this study focuses on the influences that buildings give to human behavior and develops a building population weighted ERAM model. This research starts by analyzing ERAM model to its basic compositions, which are adjacency matrix and row vector. It applies building population weighting to the row vector, while previous studies put weightings in the adjacency matrix. Building population weighted ERAM model calculates the building population weighting based on GIS data, which provides objective and massive data of buildings in the urban scale. For the verification of the model, Insa-dong and Myeong-dong were analyzed with both ERAM model and building population weighted ERAM model. The results were analyzed through the correlation test with actual pedestrian population data of the two districts. As a result, the explanation ability of building population weighted ERAM model for the pedestrian population turned out to be higher than the ERAM model. Since building population weighted ERAM model has the structure that can be combined with other weighted ERAM models, it is expected to develop a multi-weighted ERAM model with better explanation ability as a further study.

• Spatial Information Research
• /
• v.18 no.5
• /
• pp.93-105
• /
• 2010

Spatial neighborhoods are spaces which are relate to target space. A 3D spatial query which is a function for searching spatial neighborhoods is a significant function in spatial analysis. Various methodologies have been proposed in related these studies, this study suggests an adjacent based methodology. The methodology of this paper implements topological data for represent a adjacency via using network based topological data model, then apply modifiable Dijkstra's algorithm to each topological data. Results of ordering analysis about an adjacent space from a target space were visualized and considered ways to take advantage of. Object of this paper is to implement a 3D spatial query for searching a target space with a adjacent relationship in 3D space. And purposes of this study are to 1)generate adjacency based 3D network data via network based topological data model and to 2)implement a 3D spatial query for searching spatial neighborhoods by applying Dijkstra's algorithms to these data.