• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.114-124
• /
• 2004

In this paper, we present an automatic C source code generation system for DirectShow based multimedia application programming. In this system, C source code is automatically synthesized from the filter connection graph edited with GraphEdit, a utility tool provided with DirectShow SDK package from Microsoft. In traditional DirectShow programming environments, program design and brief testing steps are usually done with GraphEdit tool just by inserting filters and connecting them properly, while actual implementation of the program should be done separately. The filter connection graph information from GraphEdit is used just as a reference in such the implementation step. Therefore, our system which automatically generates C source code directly from the filter connection graph of GraphEdit seems very useful and many programmers can develop DirectShow based multimedia application programs more effectively and quickly using our system. In addition, our system supports more various media stream control functions for the generated application programs than the existing system such as Wizard which supports limited and fixed number of media control functions only. This feature allows more flexibility in the user interface of the generated source program and makes our system more practical for DirectShow based programming.

• Proceeding of EDISON Challenge
• /
• 2016.03a
• /
• pp.344-346
• /
• 2016

본 논문에서는 3-stream model에 기반한 Dopant diffusion simulator를 사용하여 실리콘 기판 내부의 As이온의 확산을 시뮬레이션한 결과와 Dual-Pearson Analytic model에 기반하여 Ion implantation을 1-D doping simulation한 결과를 토대로 여러 공정 설계에서 diffusion simulator의 사용가능함을 확인하였다.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.147-157
• /
• 2018

Recently, with the advancement of network technologies, and the activation of IoT and social network services, many graph stream data have been generated. As the relationship between objects in the graph streams changes dynamically, studies have been conducting to detect or analyze the change of the graph. In this paper, we propose a scheme to incrementally detect frequent patterns by using frequent patterns information detected in previous sliding windows. The proposed scheme calculates values that represent whether the frequent patterns detected in previous sliding windows will be frequent in how many future silding windows. By using the values, the proposed scheme reduces the overall amount of computation by performing only necessary calculations in the next sliding window. In addition, only the patterns that are connected between the patterns are recognized as one pattern, so that only the more significant patterns are detected. We conduct various performance evaluations in order to show the superiority of the proposed scheme. The proposed scheme is faster than existing similar scheme when the number of duplicated data is large.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.487-502
• /
• 1999

The hydrodynamic flow between two eccentric cylinders is examined for small values of modified Reynolds number porosity parameter and the non-dimensional slip velocity parameter in the presence of a radial magnetic field. The stream function and the pres-sure distribution are calculated and the results are presented graph-ically.

• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.11-12
• /
• 2019

IoT 및 SNS의 발달로 인해 관계를 표현하는 그래프 모델링 기법이 활용되고 있다. 실시간 스트림 그래프에서 유사한 모형의 그래프를 탐색하기 위한 근사 Top-k 서브 그래프 매칭에 대한 요구가 증가하고 있다. 본 논문에서는 그래프 스트림에서 간선의 유형 및 구조적 차이를 고려한 효율적인 근사 Top-k 서브 그래프 매칭 기법을 제안한다. 임계값 기반의 필터링과 스트림 환경에 맞는 연속 서브 그래프 매칭 구조를 제안함으로써 그래프 스트림에 적합한 질의 처리를 수행한다.

• Journal of Environmental Science International
• /
• v.24 no.4
• /
• pp.393-401
• /
• 2015

Rainfall-runoff model of Jeju Oedo Stream was used to compute the optimal unit hydrograph by HEC-HMS model that reflecting on watershed characteristics. Each rainfall event was comparatively analyzed with the actual flow measurement using Clark, Snyder and SCS synthetic methods for derived unit hydrograph. Subsequently, the null hypothesis was established as p-value for peak flow and peak time of each unit hydrograph by one-way ANOVA(Analysis of variance) was larger than significance level of 0.05. There was no significant difference in peak flow and peak time between different methods of unit hydrograph. As a result of comparing error rate with actual flow measurement data, Clark synthetic unit graph best reflected in Oedo Stream as compared to other methods, and error rate of Clark unit hydrograph was 0.02~1.93% and error rate at peak time was 0~2.74%.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.10 no.6
• /
• pp.139-145
• /
• 2010

Recently, close-to-nature stream improvement works have been carried out in urban streams, where eco-friendly bank revetment methods have been adopted. These bank revetment methods are vulnerable to be damaged or washed away by floods compared to the traditional methods which use concrete materials. Damage analysis methods on the urban streams by the floods of severe rain storm are presented. The analysis methods are the graph-using method and the grid method, which are derived from the survey results at Gwangju stream. Damage analysis grid which is intersected velocity grid and material strength grid is the highest correlation with the damage survey grid. The biggest damage on the bank revetments have been occurred around the crossing structures. Big damages have also been occurred in the connection of low water revetment and the terrace land, and around the structures in the terrace land of the stream.

• Journal of Digital Contents Society
• /
• v.19 no.3
• /
• pp.471-477
• /
• 2018

As time changes, users change their interest. In this paper, we propose a method to provide suitable service for users by dynamically weighting service interests in the context of age, timing, and seasonal changes in ubiquitous environment. Based on the service history data presented to users according to the age or season, we also offer useful services by continuously adding the most recent service rules to reflect the changing of service interest. To do this, a set of services is considered as a transaction and each service is considered as an item in a transaction. And also we represent the association of services in a graph and extract frequent service items that refer to the latest information services for users.

• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.448-453
• /
• 2019

Under the conflicting objectives of maximum user satisfaction and fast launching, there exist great needs for automated mobile app testing. In automated app testing, detection of usage-state changes is one of the most important issues for minimizing human intervention and testing of various usage scenarios. Because conventional approaches utilizing pre-collected training examples can not handle the rapid evolution of apps, we propose a novel method detecting changes in usage-state through graph-entropy. In the proposed method, widgets in a screen shot are recognized through DNNs and 'onverted graphs. We compared the performance of the proposed method with a SIFT (Scale-Invariant Feature Transform) based method on 20 real-world apps. In most cases, our method achieved superior results, but we found some situations where further improvements are required.