• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.181-189
• /
• 2001

In this thesis, a policing algorithm is proposed, which is one of the traffic management function in ATM networks. The proposed algorithm minimizes CLR(Cell Loss patio) of high priority cells and solves burstiness problem of the traffic caused by multiplexing and demultiplexing process. The proposed algorithm has been implemented with VHDL and is divided into three parts, which are an input module, an UPC module, and an output module. In implementation of the UPC module\`s memory access, memory address is assigned according to VCI\`s LSB(Lowest Significant Byte) of ATM header for convenience. And the error of VSA operation from counter\`s wrap-around can be recovered by the proposed method. ANAM library 0.25 $\mu\textrm{m}$ and design compiler of Synopsys are used for synthesis of the algorithm and Synopsys VSS tool is used for VHDL simulation of it

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.619-621
• /
• 2014

addition to the advances in information technology and the latest IT technology for their issue. To enable users who are using the Web to find need the information your search data they're sifting through about how many are struggling. In this paper, we propose a user-centered search system. Lucene search system to offer Hadoop's MapReduce with the Apache project Nutch, Solr, HDFS, utilizing design and implementation. This is the Web search users who wish to use depending on the intentions of the data that you want to collect and index information will be utilized in the search field.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1210-1216
• /
• 2004

This paper deals with a human-like gait generation of a biped robot with a balancing weight of an inverted pendulum type by using genetic algorithm. The ZMP (Zero Moment Point) is the most important index in a biped robot's dynamic walking stability. To perform a stable walking of a biped robot, a balancing motion is required according to legs' trajectories and a desired ZMP trajectory. A dynamic equation of the balancing motion is nonlinear due to an inverted pendulum type's balancing weight. To solve the nonlinear equation by the FDM (Finite Difference Method), a linearized model of equation is proposed. And GA (Genetic Algorithm) is applied to optimize a human-like balancing motion of a biped robot. By genetic algorithm, the index of the balancing motion is efficiently optimized, and a dynamic walking stability is verified by the ZMP verification equation. These balancing motion are simulated and experimented with a real biped robot IWR-IV. This human-like gait generation will be applied to a humanoid robot, at future work.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.299-303
• /
• 2004

In our pervious paper, a new parallel-type spherical 3-degree-of-freedom mechanism consisting of a two-degree-of-freedom parallel module and a serial RRR subchain was proposed[1]. In this paper, its improved version is suggested and implemented. Differently from the previous 3-dof spherical mechanism, gear chains are incorporated into the current version of the mechanism to drive the distal revolute joint of the serial subchain from the base of the mechanism and in fact, the modification significantly improves kinematic characteristics of the mechanism within its workspace. Firstly, after a brief description on its structure, the closed-form solutions of both the forward and the reverse position analysis are derived. Secondly, the first-order kinematic model of the mechanism for the inputs which are assumed to be located at the base is derived. Thirdly, through the simulations of the kinematic analysis via. kinematic isotropic index, it is confirmed that the mechanism has much more improved isotropic properties throughout the workspace of the mechanism than the previous mechanism in [1]. Lastly, the proposed mechanism is implemented to verify the results from this analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.720-732
• /
• 1996

Spatial match retrieval methods for iconic image databases recognize an image document as several icon symbols. Therefore the iconic symbols are used as primary keys to index the image document. When a user requires content-based retrieval ofimages, a spatial match retrieval method converts a query image into iconic symbols and then retrieves relevant images by accessing stored images. In order to support content-based image retrieval efficiently, we, in this paper, propose spatial match retrieval methods using signatures for iconic image databases. For this, we design new index representations of two-dimensional iconic images and explain implemented system.. In addition, we compare the conventional 9-DLT and our two-dimensional image retrieval method in terms of retrieval precision and recall ratio. We show that our method is more efficient than the conventional method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.12
• /
• pp.11-20
• /
• 2011

PSALI is referred to the supplementary lighting for the interior lighting under the daily lighting situation, and pursuant to the pertinent regulations in energy savings design standard and others in recent architecture works, the importance thereof has been increasing gradually coupled with the energy performance index (EPI), energy savings plan and the like as well as expansion of submittal and implementation policies. However, this type of PSALI studies indeed have a number of limitations since it has surrounding environmental conditions in direction, season, region, climate, time, opening rate, window area ratio, actual index, reflection rate of finishing materials and others in the architecture work as well as frequent changes in interior lighting environment for variables in daily light volume flowing into the interior, and others. Therefore, this study has analyzed existing advance research cases to produce the actual-sized model and scaled-down model, and installed the artificial lighting of LED light source possible to reproduce with same capability on both models. As a result of comparison and analysis of the artificial lighting with the key light, it has certain level of error rate from the scaled down lighting device in certain rate and actual model butit was noticeably significant within specific scope.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• The Journal of Natural Sciences
• /
• v.18 no.1
• /
• pp.65-76
• /
• 2007

The purpose of this study is to examine residents' consciousness for urban parks and green spaces in the city of Daejeon. This work enables us to find new implementation factors to increase resident's satisfaction of urban parks and green spaces. This study surveyed 1005 residents from 80dongs(neighborhoods), of 5 Gu(districts) districts in Daejeon. The survey was conducted with a structurally organized questionnaire and objective materials. The data collected from participants of the survey were summarized as follows. Daejeon residents want more natural parks and neighborhood parks than other urban facilities as recreation facilities. The favorite places in which Daejeon residents visit are Bomun Mountain, Gap River, Geajock Mountain, and Yudeon River, in order. In landscape scenery of Daejeon, residents prefer Daedeck research complex area than others and they felt that urban landscape scenery is more improved than 5 years ago. Also they want to increase the area of park and green space about 4times more than present. The result shows that the importance index of park and green space is 8.7 and the satisfaction index is 5.42. These results suggests that the demand by residents for urban park and green spaces will improve as the urban structure is improved.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.678-691
• /
• 2000

A variety of multimedia applications require multimedia database management systems to manage multimedia data, such as text, image, and video, as well as t support content-based image or video retrieval. In this paper we design and implement a content-based image retrieval system, BADA-IV/I$^2$R(Image Information Retrieval), which is developed based on BADA-IV multimedia database management system. In this system image databases can be efficiently constructed and retrieved with the visual features, such as color, shape, and texture, of image. we extend SQL statements to define image query based on both annotations and visual features of image together. A high-dimensional index structure, called CIR-tree, is also employed in the system to provide an efficient access method to image databases. We show that BADA-IV/I$^2$R provides a flexible way to define query for image retrieval and retrieves image data fast and effectively: the effectiveness and performance of image retrieval are shown by BEP(Bull's Eye Performance) that is used to measure the retrieval effectiveness in MPEG-7 and comparing the performance of CIR-tree with those of X-tree and TV-tree, respectively.