• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.675-677
• /
• 2024

그래프 학습 기술은 실세계의 네트워크를 그래프로 모델링하여 분석함으로써, 네트워크에 내재된 유용한 정보를 도출하는 핵심적인 역할을 한다. 그러나 기존의 그래프 학습 기술에는 두 가지 한계점이 존재한다: (1) 그룹 정보 표현의 한계 및 (2) 동적 관계 학습의 한계. 각 한계를 극복하기 위해 하이퍼그래프 학습 기술과 동적 그래프 학습 기술이 활발하게 연구되었지만, 두 가지 한계를 동시에 극복하기 위한 연구들은 아직까지 충분히 수행되지 못했다. 이러한 동기로부터, 본 논문은 실세계 네트워크를 동적인 하이퍼그래프로 모델링하여, 동적 그래프 학습 기술, 정적 하이퍼그래프 학습 기술, 그리고 동적 하이퍼그래프 학습 기술들의 성능에 대해 비교 분석하고자 한다. 실험 결과, 시간에 따라 변화하는 실세계의 복잡한 관계를 정확하게 포착하는 데는 동적 하이퍼그래프 학습 기술이 가장 효과적이라는 것을 확인하였다.

• Journal of radiological science and technology
• /
• v.29 no.4
• /
• pp.249-255
• /
• 2006

Purpose: The diagnostic utility of fluorine-18 2-deoxy-D-glucose positron emission tomograhpy ($^{18}F-FDG $PET) for the non-invasive differentiation of focal lung lesions originated from cancer or inflammation disease by combined visual image interpretation and semi-quantitative uptake value analysis has been documented. In general, Standardized Uptake Value(SUV) is used to diagnose lung disease. But SUV does not contain dynamic information of lung tissue for the glucose. Therefore, this study was undertaken to hypothesis that analysis of dynamic kinetics of focal lung lesions base on $^{18}F-FDG$ PET may more accurately determine the lung disease. So we compared Time Activity Curve(TAC), Standardized Uptake Value-Dynamic Curve(SUV-DC) graph pattern with Glucose Metabolic Rate(MRGlu) from Patlak analysis. Methods: With lung disease, 17 patients were examined. They were injected with $^{18}F-FDG$ over 30-s into peripheral vein while acquisition of the serial transaxial tomographic images were started. For acquisition protocol, we used twelve 10-s, four 30-s, sixteen 60-s, five 300-s and one 900-s frame for 60 mins. Its images were analyzed by visual interpretation TAC, SUV-DC and a kinetic analysis(Patlak analysis). The latter was based on region of interest(ROIs) which were drawn with the lung disease shape. Each optimized patterns were compared with itself. Results: In TAC patterns, it hard to observe cancer type with inflammation disease in early pool blood area but over the time cancer type slope more remarkably increased than inflammation disease. SUV-DC was similar to TAC pattern. In the result of Patlak analysis, In time activity curve of aorta, even though inflammation disease showed higher blood activity than cancer, at first as time went by, blood activity of inflammation disease became the lowest. However, in time activity curve of tissue, cancer had the highest uptake and inflammation disease was in the middle. Conclusion: Through the examination, TAC and SUV-DC could approached the results that lung cancer type and inflammation disease type has it's own difference shape patterns. Also, it has outstanding differentiation between cancer type and inflammation in Patlak and MRGlu analysis. Through these analysis methods, it will helpful to separation lung disease.

• The Journal of Engineering Geology
• /
• v.21 no.1
• /
• pp.15-24
• /
• 2011

To clarify the distribution of joints and fracture zones in the Cheongju granitic mass, we analyzed drill-core and geophysical well-logging data obtained at two boreholes located 30 m from each other. Lithological properties were investigated from the drill-core data and the samples were classified based on the rock mass rating (RMR) and on rock quality designation (RQD). Subsurface discontinuities within soft and hard rocks were examined by geophysical well-logging and cross-hole seismic tomography. The velocity structures constructed from seismic tomography are well correlated with the profile of bedrock depth, previously mapped from a seismic refraction survey. Dynamic elastic moduli, obtained from full waveform sonic and ${\gamma}-{\gamma}$ logging, were interrelated with P-wave velocities to investigate the dynamic properties of the rock mass. Compared with the correlation graph between elastic moduli and velocities for hard rock at borehole BH-1, the correlation points for BH-2 data showed a wide scatter. These scattered points reflect the greater abundance of joints and fractures near borehole BH-2. This interpretation is supported by observations by acoustic televiewer (ATV) and optical televiewer (OTV) image loggings.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.2
• /
• pp.37-47
• /
• 2011

In the recent years, malicious codes called malware are having shown significant increase due to the code obfuscation to evade detection mechanisms. When the code obfuscation technique is applied to malwares, they can change their instruction sequence and also even their signature. These malwares which have same functionality and different appearance are able to evade signature-based AV products. Thus, AV venders paid large amount of cost to analyze and classify malware for generating the new signature. In this paper, we propose a novel approach for detecting metamorphic malwares. The proposed mechanism first converts malware's API call sequences to call graph through dynamic analysis. After that, the callgraph is converted to semantic signature using 128 abstract nodes. Finally, we extract all subgraphs and analyze how similar two malware's behaviors are through subgraph similarity. To validate proposed mechanism, we use 273 real-world malwares include obfuscated malware and analyze 10,100 comparison results. In the evaluation, all metamorphic malwares are classified correctly, and similar module behaviors among different malwares are also discovered.

• Asia pacific journal of information systems
• /
• v.18 no.3
• /
• pp.91-121
• /
• 2008

Electronic commerce, commonly known as e-commerce or eCommerce, has become a major business trend in these days. The amount of trade conducted electronically has grown extraordinarily by developing the Internet technology. Most electronic commerce has being conducted between businesses to customers; therefore, the researches with respect to e-commerce are to find customer's needs, behaviors through statistical methods. However, the statistical researches, mostly based on a questionnaire, are the static researches, They can tell us the dynamic relationships between initial purchasing and repurchasing. Therefore, this study proposes dynamic research model for analyzing the cause of initial purchasing and repurchasing. This paper is based on the System-Dynamic theory, using the powerful simulation model with some restriction, The restrictions are based on the theory TAM(Technology Acceptance Model), PAM, and TPB(Theory of Planned Behavior). This article investigates not only the customer's purchasing and repurchasing behavior by passing of time but also the interactive effects to one another. This research model has six scenarios and three steps for analyzing customer behaviors. The first step is the research of purchasing situations. The second step is the research of repurchasing situations. Finally, the third step is to study the relationship between initial purchasing and repurchasing. The purpose of six scenarios is to find the customer's purchasing patterns according to the environmental changes. We set six variables in these scenarios by (1) changing the number of products; (2) changing the number of contents in on-line shopping malls; (3) having multimedia files or not in the shopping mall web sites; (4) grading on-line communities; (5) changing the qualities of products; (6) changing the customer's degree of confidence on products. First three variables are applied to study customer's purchasing behavior, and the other variables are applied to repurchasing behavior study. Through the simulation study, this paper presents some inter-relational result about customer purchasing behaviors, For example, Active community actions are not the increasing factor of purchasing but the increasing factor of word of mouth effect, Additionally. The higher products' quality, the more word of mouth effects increase. The number of products and contents on the web sites have same influence on people's buying behaviors. All simulation methods in this paper is not only display the result of each scenario but also find how to affect each other. Hence, electronic commerce firm can make more realistic marketing strategy about consumer behavior through this dynamic simulation research. Moreover, dynamic analysis method can predict the results which help the decision of marketing strategy by using the time-line graph. Consequently, this dynamic simulation analysis could be a useful research model to make firm's competitive advantage. However, this simulation model needs more further study. With respect to reality, this simulation model has some limitations. There are some missing factors which affect customer's buying behaviors in this model. The first missing factor is the customer's degree of recognition of brands. The second factor is the degree of customer satisfaction. The third factor is the power of word of mouth in the specific region. Generally, word of mouth affects significantly on a region's culture, even people's buying behaviors. The last missing factor is the user interface environment in the internet or other on-line shopping tools. In order to get more realistic result, these factors might be essential matters to make better research in the future studies.

• Imaging Science in Dentistry
• /
• v.32 no.3
• /
• pp.159-165
• /
• 2002

Purpose: The aim of this study was to introduce a method of obtaining the oscillation graphs of the dental x-ray tube heads relative to time using an accelerometer. Materials and Methods: An Accelerometer, Piezotron type 8704B25 (Kistler Instrument Co., Amherst, NY, USA) was utilized to measure the horizontal oscillation of the x-ray tube head immediately after positioning the tube head for an intraoral radiograph. The signal from the sensor was transferred to a dynamic signal analyzer, which displayed the magnitude of the acceleration on the Y-axis and time lapse on the X -axis. The horizontal oscillation of the tube head was measured relative to time, and the settling time was also determined on the basis of the acceleration graphs for 6 wall type, 5 floor-fixed type, and 4 mobile type dental x-ray machines. Results : The oscillation graphs showed that tube head movement decreased rapidly over time. The settling time varied with x-ray machine types. Wall-type x-ray machines had a settling time of up to 6 seconds, 5 seconds for fixed floor-types, and 1 I seconds for the mobile-types. Conclusion: Using an accelerometer, we obtained the oscillation graphs of the dental x-ray tube head relative to time. The oscillation graph with time can guide the operator to decide upon the optimum exposure moment after x-ray tube head positioning for better radiographic resolution.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.2
• /
• pp.6-13
• /
• 2011

This paper deals with the interconnection problem in ad-hoc networks or sensor networks, where relay nodes are deployed additionally to form connections between given nodes. This problem can be reduced to a NP-hard problem. The nodes of the networks, by applications or geographic factors, can be deployed densely in some areas while sparsely in others. For such a case one can make an approximation scheme, which gives shorter execution time, for the additional node deployments by ignoring the interconnections inside the dense area of nodes. However, the case is still a NP-hard, so it is proper to establish a polynomial time approximation scheme (PTAS) by implementing a dynamic programming. The analysis can be made possible by an elaboration on making the definition of the objective function. The objective function should be defined to be able to deal with the requirement incurred by the substitution of the dense area with its abstraction.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.111-117
• /
• 2008

In this paper, we describes the boxing motion recognition which is used in the part of games, animation. To recognize the boxing motion, we have used two algorithms, one is principle component analysis, the other is dynamic time warping algorithm. PCA is the simplest of the true eigenvector-based multivariate analyses and often used to reduce multidimensional data sets to lower dimensions for analysis. DTW is an algorithm for measuring similarity between two sequences which may vary in time or speed. We introduce and compare PCA and DTW algorithms respectively. We implemented the recognition of boxing motion on the motion capture system which is developed in out research, and depict the system also. The motion graph will be created by boxing motion data which is acquired from motion capture system, and will be normalized in a process. The result has implemented in the motion recognition system with five actors, and showed the performance of the recognition.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.