• Journal of Korean Society of Forest Science
• /
• v.89 no.2
• /
• pp.145-160
• /
• 2000

This study is focused to the national park of Korean typical Sea Hally$\check{o}$ Haesang, and its visual resources and practiced inspect course by the way of suppositions and tests, to show the visual resource management objectively, and that of qualitative basic data. Accordingly by measuring the physical amount spatial structure with the visual amount originated from the Mesh Analyzing Method and the Visual Preference from the Scenic Beauty Estimation(S.B.E.) method and analyzed the valuation of the visual resource by Iverson method. Spatial image structure measured by Semantic Differential(S.D.) Scale was shown through the factor analysis algorithm for the analyzing psychological amount and examined the flowing out of decisive factor and the objective importance related to the mutual factors by appling the measurement of the visual quality. As a national Park, the visual factors that have natural landscape harmonized with forest, sky, surface of the water, curious stones and rocks, and temples should be escalated their values affirmatively so as to be the scenery of pointed direction and enjoyable, and it is of more needed for visual resource and its' controlling technique to make artificial structures more intentional planning and systemical setting. When we are viewing the improvement for the national park along with the visual resource management, reasonable level of development is needed, because when men interference surpass plantations and leasts will be damaged and the quality of natural landscape can be lowered, so it is needed to set up a management end, tangibly or clearly; and it is permitted limit coming and going ablably by accounting the suitable number for availing. But the controling end should be set in every level, positive management, very actively within the permissive varcability. It is the main business for the national park to prevent the damage from human for their gay life or to prevent the damage of a land carpet, and to restorate for the visual resource management.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.831-845
• /
• 1997

In this paper,we proposed and developed a compiler and interactive programming enviroments for C++ wich is mostly worth of nitice among the object -oriented languages.To develope the compiler for C++ we took front=end/back-end model using EM virtual machine.In develpoing Front-End,we formailized C++ gram-mar with the context semsitive tokens which must be manipulated by dexical scanner and designed a AST class li-brary which is the hierarchy of AST node class and well defined interface among them,In develpoing Bacik-End,we proposed model for three major components :code oprtimizer,code generator and run-time enviroments.We emphasized the retargatable back-end which can be systrmatically reconfigured to genrate code for a variety of distinct target computers.We also developed terr pattern matching algorithm and implemented target code gen-erator which produce SPARC code.We also proposed the theroy and model for construction interative pro-gramming enviroments. To represent language features we adopt AST as internal reprsentation and propose uncremental analysis algorithm and viseal digrams.We also studied unparsing scheme, visual diagram,graphical user interface to generate interactive environments automatically Results of our resarch will be very useful for developing a complier and programming environments, and also can be used in compilers for parallel and distributed enviroments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.465-482
• /
• 1997

In this paper, we have studied on cinstructing code-recognition shstem by neural network according to a image process taking the DOT classification code stamped on tire surface.It happened to a few problems that characters distorted in edge by diffused reflection and two adjacent characters take the same label,even very sen- sitive to illumination ofr recognition the stamped them on tire.Thus,this paper would propose the algorithm for tire code under being cinscious of these properties and prove the algorithm drrciency with a simulation.Also,we have suggerted the MCBP network composing of multi-linked recognizers of dffcient identify the DOT code being tire classification code.The MCBP network extracts the projection balue for classifying each character's rdgion after taking out the prjection of each chracter's region on X,Y axis,processes each chracters by taking 7$\times$8 normalization.We have improved error rate 3% through the MCBP network and post-process comparing the DOT code Database. This approach has a accomplished that learming time get's improvenent at 60% and recognition rate has become to 95% from 90% than BckPropagation with including post- processing it has attained greate rates of entire of tire recoggnition at 98%.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.97-111
• /
• 2009

Image-based traffic information collection systems have entered widespread adoption and use in many countries since these systems are not only capable of replacing existing loop-based detectors which have limitations in management and administration, but are also capable of providing and managing a wide variety of traffic related information. In addition, these systems are expanding rapidly in terms of purpose and scope of use. Currently, the utilization of image processing technology in the field of traffic accident management is limited to installing surveillance cameras on locations where traffic accidents are expected to occur and digitalizing of recorded data. Accurately recording the sequence of situations around a traffic accident in a signal intersection and then objectively and clearly analyzing how such accident occurred is more urgent and important than anything else in resolving a traffic accident. Therefore, in this research, we intend to present a technology capable of overcoming problems in which advanced existing technologies exhibited limitations in handling real-time due to large data capacity such as object separation of vehicles and tracking, which pose difficulties due to environmental diversities and changes at a signal intersection with complex traffic situations, as pointed out by many past researches while presenting and implementing an active and environmentally adaptive methodology capable of effectively reducing false detection situations which frequently occur even with the Gaussian complex model analytical method which has been considered the best among well-known environmental obstacle reduction methods. To prove that the technology developed by this research has performance advantage over existing automatic traffic accident recording systems, a test was performed by entering image data from an actually operating crossroad online in real-time. The test results were compared with the performance of other existing technologies.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.372-381
• /
• 2001

In this paper SEED, the Korea Standard 128-bit block cipher algorithm is implemented with VHDL and mapped into one FPGA. SEED consists of round key generation block, F function block, G function block, round processing block, control block and I/O block. The designed SEED is realized in an FPGA but we design it technology-independently so that ASIC or core-based implementation is possible. SEED requires many hardware resources which may be impossible to realize in one FPGA. So it is necessary to minimize hardware resources. In this paper only one G function is implemented and is used for both the F function block and the round key block. That is, by using one G function sequentially, we can realize all the SEED components in one FPGA. The used cell rate after synthesis is 80% in Altem FLEXI0KlOO. The resulted design has 28Mhz clock speed and 14.9Mbps performance. The SEED hardware is technology-independent and no other external component is needed. Thus, it can be applied to other SEED implementations and cipher systems which use SEED.

• Journal of Korean Society of Rural Planning
• /
• v.30 no.1
• /
• pp.57-66
• /
• 2024

This study aimed to develop a precise vegetation cover classification model for small streams using the combination of drone remote sensing and support vector machine (SVM) techniques. The chosen study area was the Idong stream, nestled within Geosan-gun, Chunbuk, South Korea. The initial stage involved image acquisition through a fixed-wing drone named ebee. This drone carried two sensors: the S.O.D.A visible camera for capturing detailed visuals and the Sequoia+ multispectral sensor for gathering rich spectral data. The survey meticulously captured the stream's features on August 18, 2023. Leveraging the multispectral images, a range of vegetation indices were calculated. These included the widely used normalized difference vegetation index (NDVI), the soil-adjusted vegetation index (SAVI) that factors in soil background, and the normalized difference water index (NDWI) for identifying water bodies. The third stage saw the development of an SVM model based on the calculated vegetation indices. The RBF kernel was chosen as the SVM algorithm, and optimal values for the cost (C) and gamma hyperparameters were determined. The results are as follows: (a) High-Resolution Imaging: The drone-based image acquisition delivered results, providing high-resolution images (1 cm/pixel) of the Idong stream. These detailed visuals effectively captured the stream's morphology, including its width, variations in the streambed, and the intricate vegetation cover patterns adorning the stream banks and bed. (b) Vegetation Insights through Indices: The calculated vegetation indices revealed distinct spatial patterns in vegetation cover and moisture content. NDVI emerged as the strongest indicator of vegetation cover, while SAVI and NDWI provided insights into moisture variations. (c) Accurate Classification with SVM: The SVM model, fueled by the combination of NDVI, SAVI, and NDWI, achieved an outstanding accuracy of 0.903, which was calculated based on the confusion matrix. This performance translated to precise classification of vegetation, soil, and water within the stream area. The study's findings demonstrate the effectiveness of drone remote sensing and SVM techniques in developing accurate vegetation cover classification models for small streams. These models hold immense potential for various applications, including stream monitoring, informed management practices, and effective stream restoration efforts. By incorporating images and additional details about the specific drone and sensors technology, we can gain a deeper understanding of small streams and develop effective strategies for stream protection and management.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.33-49
• /
• 2003

Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1445-1454
• /
• 1999

광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.

• Steel and Composite Structures
• /
• v.34 no.5
• /
• pp.681-698
• /
• 2020

The paper addresses contribution to the modeling and optimization of major machinability parameters (cutting force, surface roughness, and tool wear) in finish dry hard turning (FDHT) for machinability evaluation of hardened AISI grade die steel D₃ with PVD-TiN coated (Al₂O₃-TiCN) mixed ceramic tool insert. The turning trials are performed based on Taguchi's L₁₈ orthogonal array design of experiments for the development of regression model as well as adequate model prediction by considering tool approach angle, nose radius, cutting speed, feed rate, and depth of cut as major machining parameters. The models or correlations are developed by employing multiple regression analysis (MRA). In addition, statistical technique (response surface methodology) followed by computational approaches (genetic algorithm and particle swarm optimization) have been employed for multiple response optimization. Thereafter, the effectiveness of proposed three (RSM, GA, PSO) optimization techniques are evaluated by confirmation test and subsequently the best optimization results have been used for estimation of energy consumption which includes savings of carbon footprint towards green machining and for tool life estimation followed by cost analysis to justify the economic feasibility of PVD-TiN coated Al₂O₃+TiCN mixed ceramic tool in FDHT operation. Finally, estimation of energy savings, economic analysis, and sustainability assessment are performed by employing carbon footprint analysis, Gilbert approach, and Pugh matrix, respectively. Novelty aspects, the present work: (i) contributes to practical industrial application of finish hard turning for the shaft and die makers to select the optimum cutting conditions in a range of hardness of 45-60 HRC, (ii) demonstrates the replacement of expensive, time-consuming conventional cylindrical grinding process and proposes the alternative of costlier CBN tool by utilizing ceramic tool in hard turning processes considering technological, economical and ecological aspects, which are helpful and efficient from industrial point of view, (iii) provides environment friendliness, cleaner production for machining of hardened steels, (iv) helps to improve the desirable machinability characteristics, and (v) serves as a knowledge for the development of a common language for sustainable manufacturing in both research field and industrial practice.