• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.3
• /
• pp.21-28
• /
• 2018

As computer performance and needs of user convenience increase, computer user interface are also changing. This changes had great effects on software development environment. In past, text editors like vi or emacs on UNIX OS were the main development environment. These editors are very strong to edit source code, but difficult and not intuitive compared to GUI(Graphical User Interface) based environment and were used by only some experts. Moreover, the trends of software development environment was changed from command line to GUI environment and GUI Editor provides usability and efficiency. As a result, the usage of text based editor had decreased. However, because GUI based editor use a lot of computer resources, computer performance and efficiency are decreasing. The more contents are, the more time to verify and display the contents it takes. In this paper, we provide a new parser that provide multi view editing, incremental parsing and multiple entry of abstract syntax tree.

• Convergence Security Journal
• /
• v.23 no.5
• /
• pp.73-79
• /
• 2023

Cyber threats are evolving and becoming more sophisticated with the development of new technologies, and consequently the number of service failures caused by DDoS attacks are continually increasing. Recently, DDoS attacks have numerous types of service failures by applying a large amount of traffic to the domain address of a specific service or server. In this paper, after generating the data of the Syn Flooding attack, which is the representative attack type of bandwidth exhaustion attack, the data were compared and analyzed using Random Forest, Decision Tree, Multi-Layer Perceptron, and KNN algorithms for the effective detection of attacks, and the optimal algorithm was derived. Based on this result, it will be useful to use as a technique for the detection policy of Syn Flooding attacks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.201-207
• /
• 2003

A multi-hop ad-hoc network can be formed out of Bluetooth capable devices through the use of scatternets. Many topologies can be deployed for scatternet; the most commonly proposed topology in the literature are tree structure and ring structure. We analyze the performance between tree formation algorithm and ring formation algorithm. We then present quantative result that compare the expected traffic performance between Blutooth ring scatternet and Bluetooth tree scatternet. The simulation results showes that Ring structure of scatterent have good performance than Tree structure over mobile environments.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.85-92
• /
• 2005

Recently, query processing techniques for the multi-dimensional data like images have been widely used to perform content-based retrieval of the data . Range query and Nearest neighbor query are widely used multi dimensional queries . This paper Proposes the efficient pruning strategies for k-nearest neighbor query in R-tree variants indexing structures. Pruning strategy is important for the multi-dimensional indexing query processing so that search space can be reduced. We analyzed the Pruning strategies and perform experiments to show overhead and the profit of the strategies. Finally, we propose best use of the strategies.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.39-48
• /
• 2005

This paper proposes novel texture segmentation method using Bayesian estimation method and neural networks. We use multi-scale wavelet coefficients and the context information of neighboring wavelets coefficients as the input of networks. The output of neural networks is modeled as a posterior probability. The context information is obtained by HMT(Hidden Markov Tree) model. This proposed segmentation method shows better performance than ML(Maximum Likelihood) segmentation using HMT model. And post-processed texture segmentation results as using multi-scale Bayesian image segmentation technique called HMTseg in each segmentation by HMT and the proposed method also show that the proposed method is superior to the method using HMT.

• Journal of the Korean Society of Earth Science Education
• /
• v.3 no.1
• /
• pp.47-54
• /
• 2010

The purpose of this study is finding examine the Thinking Maps and how to use Thinking Maps effectively in Science Education. The result of this study were as follows: First, There are 8 type Maps, Circle Map, Tree Maps, Bubble Map, Double Bubble Map, Flow Map, Multi Flow Map, Brace Map, Bridge Map. Each Maps are useful in the following activities ; Circle Map-Express their thoughts. Tree Map-Activities as like determine the structure, classification, information organization. Bubble Maps-Construction. Double Bubble Map-Comparison of similarities and differences. Flow Map-Set goals, determine the result of changes in time or place. Multi Flow Map-Analysis cause and effect, expectation and reasoning. Brace Map-Analysis whole and part. Bridge Map-Activities need analogies. Second, each element of inquiry has 1~2 appropriate type of Thinking Maps. So student can choose the desired map. Third, the result of analysing of Science Curriculum Subjects, depending on the subject variety maps can be used. Therefore the Thinking Maps can be used for a variety on activities and subject. And student can be selected according to their learning style. So Thinking Maps are effective to improve student's Self-Directed Learning.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.453-463
• /
• 2002

With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1130-1137
• /
• 2006

One of the important performance issues in large-scale RFID systems is to resolve collisions among responses from RFID tags. Considering two do facto anti-collision solutions, namely the binary-tree splitting algorithm and the Slotted-Aloha algorithm, we propose to use multi-packet reception (MPR) capability to enhance the RFID tag reading rate (i.e., throughput). MPR allows an RFID reader to receive multiple reponses transmitted by tags at the same time. We analyze the effect of MPR capability in the above anti-collision algorithms, which is also validated by simulation. The analysis and simulation results show that RFID reader antenna design and signal separation techniques play an important role in improving RFID system performance with MPR capability.

• Korean Journal of Environment and Ecology
• /
• v.29 no.2
• /
• pp.279-291
• /
• 2015

This study analyzed the growth characteristics of multi-layer planted trees through their growth analysis and attempted to present a management strategy. The subject of research is the Citizen's Forest Area of Seoul Forest Park located in Seoul City. Field surveys were conducted three times over eight years from 2005 when the Seoul Forest Park was created through 2013. Labels were attached to all trees in the target area, and their species, height and DBH were investigated. To identify the growth differences by trees in each area, a detailed tree location map was drawn up for use in the analysis. To check soil health, soil organic matter, soil pH and soil microbial activities were analyzed. It turned out that the growth of the multi-layer planted trees in the target area of research was higher than that of the trees in existing urban parks, and that it was similar to that of trees in natural forests. Through a field survey in the area with a remarkably low growth, high-density planting problem, soil was found to have excess-moisture and there was the problem of Pueraria lobata covering. As a result of the analysis of the soil, it was found that its organic content in the soil was lower; soil pH was higher; and microbial activities in the soil were lower when compared to that of natural forests.