• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.19-29
• /
• 2011

Due to the development of web technologies and the increasing use of smart devices such as smart phone, in recent various web services are widely used in many application fields. In this environment, the topic of supporting personalized and intelligent web services have been actively researched, and an analysis technique on a web-click stream generated from web usage logs is one of the essential techniques related to the topic. In this paper, for efficient analyzing a web-click stream of sequences, a sequential pattern mining technique is proposed, which satisfies the basic requirements for data stream processing and finds a refined mining result. For this purpose, a concept of interesting sequential patterns with a time-interval constraint is defined, which uses not on1y the order of items in a sequential pattern but also their generation times. In addition, A mining method to find the interesting sequential patterns efficiently over a data stream such as a web-click stream is proposed. The proposed method can be effectively used to various computing application fields such as E-commerce, bio-informatics, and USN environments, which generate data as a form of data streams.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.405-412
• /
• 2013

Current web has evolved to a mashed-up format according to the change of the implementation and usage patterns. Web services and user experiences have improved, however, security threats are also increased as the web contents that are not yet verified combine together. To mitigate the threats incurred as an adverse effect of the web development, we need to check security on the combined web contents. In this paper, we propose a scheduling method to detect malicious web pages not only inside but also outside through extended links for secure operation of a web site. The scheduling method considers several aspects of each page including connection popularity, suspiciousness, and check elapse time to make a decision on the order for security check on numerous web pages connected with links. We verified the effectiveness of the security check complying with the scheduling method that uses the priority given to each page.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.459-466
• /
• 2011

In this paper, we proposed a data mining framework for the management of alerts in order to improve the performance of the intrusion detection systems. The proposed alert data mining framework performs alert correlation analysis by using mining tasks such as axis-based association rule, axis-based frequent episodes and order-based clustering. It also provides the capability of classify false alarms in order to reduce false alarms. We also analyzed the characteristics of the proposed system through the implementation and evaluation of the proposed system. The proposed alert data mining framework performs not only the alert correlation analysis but also the false alarm classification. The alert data mining framework can find out the unknown patterns of the alerts. It also can be applied to predict attacks in progress and to understand logical steps and strategies behind series of attacks using sequences of clusters and to classify false alerts from intrusion detection system. The final rules that were generated by alert data mining framework can be used to the real time response of the intrusion detection system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.55-62
• /
• 2018

The MTD-based approach changes various operating parameters dynamically so that the vulnerability of the system can be protected from the malicious attack. In this paper, random/serial scanning/jamming attack success probabilities have been mathematically analyzed and verified through simulation to improve the security of the wireless communication systems in which the MTD-SDR technologies are applied. As a result, for random scanning attacks, attack success probability increases as the change period of transmission channel increases, while for random jamming attacks there is no change. The attack success probability patterns for serial attacks are similar to those of random attacks, but when the change period of transmission channel approaches to the total number of transmission channels, the success probability of serial attack is getting greater than that of random attack, up to twice in jamming attacks and up to 36% in scanning attacks.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2010

Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.501-506
• /
• 2002

사람은 누구나 잭이나 문서를 읽을 때 중요한 부분에 강조, 해설, 설명을 하기 위해서 표시를 하거나 글을 입력한다. 이와 같이 원본문서에 추가되는 부가 정보를 Annotation이라고 한다[6][7]. Annotation을 이용하면 차후에 원본문서를 재창조하거나 다른 사람이 원본문서를 참조할 경우 과중한 정보의 양을 극복할 수 있으므로[4], 원본문서의 이해도를 향상시킬 수 있다. 따라서, Annotation은 한번 사용하고 그치는 정보가 아닌 재사용할 수 있는 점보임을 의미한다[1,2,3]. 이러한 Annotation 기능을 웹 문서에 적용하게 되면 종이문서에서 얻을 수 있는 장점뿐만 아니라 웹 환경의 특징인 공유[5], 검색[4], 재편집 등의 기능이 가능하다. 이와 관련한 많은 연구가 진행중에 있다. 그러나, 기존의 Annotation 연구는 Anchor 입력된 다수의 Annotation이 무의미한 출력 순서로 제공되고 있으며, 또한 Anchor에 입력된 Annotation의 출력으로 인해 문서 구조가 변경되거나, 가려지는 등의 문제점으로 사용자들이 쉽게 사용 및 이해할 수 있는 Annotation 출력 인터페이스에 대한 연구가 부족한 실정이다. 따라서, 본 논문에서는 Anchor에 입력된 다수의 Annotation들 간의 의미적 순서를 부여하여 보다 적절한 Annotation에 대한 우선 접근이 가능하도록 계층적인 Annotation 우선처리 기법을 제안하고, Annotation 출력으로 인한 문서 변경 문제를 해결하기 위한 유동적인 Annotation 표현 기법을 제안한다. 또한 Annotation이 문서에 부가된 부가정보의 역할을 뿐만 아니라, 다양한 활용이 가능하도록 XML 표준에 기반한 저장 구조를 지원하며, 원본문서와 분리하여 저장한다.속도를 개선시켰고, 국소적인 변형이 있는 패턴과 특징의 수가 다른 패턴의 경우에도 좋은 인식률을 얻었다.r interferon alfa concentrated solution can be established according to the monograph of EP suggesting the revision of Minimum requirements for biological productss of e-procurement, e-placement, e-payment are also investigated.. monocytogenes, E. coli 및 S. enteritidis에 대한 키토산의 최소저해농도는 각각 0.1461 mg/mL, 0.2419 mg/mL, 0.0980 mg/mL 및 0.0490 mg/mL로 측정되었다. 또한 2%(v/v) 초산 자체의 최소저해농도를 측정한 결과, B. cereus, L. mosocytogenes, E. eoli에 대해서는 control과 비교시 유의적인 항균효과는 나타나지 않았다. 반면에 S. enteritidis의 경우는 배양시간 4시간까지는 항균활성을 나타내었지만, 8시간 이후부터는 S. enteritidis의 성장이 control 보다 높아져 배양시간 20시간에서는 control 보다 약 2배 이상 균주의 성장을 촉진시켰다.차에 따른 개별화 학습을 가능하게 할 뿐만 아니라 능동적인 참여를 유도하여 학습효율을 높일 수 있을 것으로 기대된다.향은 패션마케팅의 정의와 적용범위를 축소시킬 수 있는 위험을 내재한 것으로 보여진다. 그런가 하면, 많이 다루어진 주제라 할지라도 개념이나 용어가 통일되지 않고 사용되며 검증되어 통용되는 측정도구의 부재로 인하여 연구결과의 축적이 미비한 상태이다. 따라서, 이에 대한 재고와 새로운 방향

• Korean Journal of Applied Biomechanics
• /
• v.18 no.2
• /
• pp.125-139
• /
• 2008

The purpose of this study is to compare and analyze a kinematic characteristics of throwing performance among born visually impaired, postnatal visually impaired and visually correct people through their kinematic characteristics. Another purpose of this study is to prevent injury and improve blind's exercise leadership and physical abilities. Three video cameras were used and each camera's shooting velocity was 60field/sec. Then the longest thrown pose was collected and analyzed by using Kwon 3D ver. 3.1 program. The results obtained from this study were followings; 1. During release, the fastest speed of ball was visually corrected followed by postnatal visually impaired and then born visually impaired. 2. Visually corrected used wrist joint well and had wide body round range with similar motion patterns, however born visually impaired couldn't do this at all. 3. Visually corrected used waist to lead shoulder at Phase 2 while throwing ball, but some of born visually impaired and postnatal visually impaired couldn't use waist to lead shoulder. 4. Visually corrected looked at the way where ball would go, but blinds couldn't look where ball would go. 5. Not like visually corrected who show similar patterns, born visually impaired showed each different patterns and some postnatal visually impaired showed similar patterns with visually corrected. 6. While throwing ball, visually corrected showed flexible weight-movement, postnatal visually impaired were not good as visually corrected, and born visually impaired couldn't do weight-movement at all. Synthetically, this result showed that throwing motions are affected a lot by the time when people became blind.

• Journal of Music and Human Behavior
• /
• v.11 no.1
• /
• pp.1-19
• /
• 2014

The purpose of this study was to investigate the immediate effect of Patterned Sensory Enhancement (PSE) technique on the motor function of the affected upper limb in hemiplegic stroke patients by comparing the use of PSE and simple rhythmic cue. A total of 16 stroke patients were recruited from rehabilitative hospitals. The participants were assigned to the experimental group (n = 8) and control group (n = 8). While performing six different upper limb motions, musical stimuli applying the PSE technique was presented for the experimental group and simple rhythmic cue using the metronome was applied for the control group. The results showed that while the significantly increased range of motion (ROM) was found in the experimental group with the immediate use of PSE (p < .05), the control group did not show no significant change. This study implies that the use of musical elements in cueing for upper limb motion immediately leads to significant improvement in ROM by providing sufficient temporal, spatial, and dynamic information for expected motor performance.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.146-164
• /
• 2010

Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.