• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.37.1-37.1
• /
• 2021

For the first time in Korea, we are developing technology for gravitational wave (GW) detectors as a major R&D program. Our main research target is quantum noise reduction technology which can enhance the sensitivity of a GW detector beyond its limit by classical physics. Technology of generating squeezed vacuum state of light (SQZ) can suppress quantum noise (shot noise at higher frequencies and radiation pressure noise at lower frequencies) of laser interferometer type GW detectors. Squeezing technology has recently started being used for GW detectors and becoming necessary and key components. Our ultimate goal is to participate and make contribution to international collaborations for upgrade of existing GW detectors and construction of next generation GW detectors. This presentation will summarize our results in 2020 and plan for the upcoming years. Technical details will be presented in other family talks.

• The Journal of Economics, Marketing and Management
• /
• v.3 no.1
• /
• pp.33-39
• /
• 2015

Managers are always trying to be the best internal controls in their organizations copper approximate because they know that be effective internal control over previous systems, to fulfill the mission of the organization and minimize unexpected events will be extremely difficult. On the other hand, the existence of internal controls to increase efficiency, reduce head loss, assets and achieving a reasonable assurance of the reliability of financial statements and compliance with laws and regulations will be. Internal control, not an event, but a series of operations and activities on the basis of output. Internal controls help to achieve the goal of minimizing the problems of implementing appropriate internal controls. Internal control is an integral component of corporate governance that will provide reasonable assurance of achieving the organization's objectives. preventing, detecting errors and fraud goes to work. Responsibility for the prevention and detection of fraud and error in the public sector is the responsibility of managers. Managers of internal control and consistently applying appropriate accounting systems, this responsibility will play (Lin et al., 2011). Since the public sector organizations differ from each other, thus establishing internal controls cant be the same for all organizations and agencies of the public sector. Establish specific controls on each system to factors such as size, type of operation and organizational goals that the system is designed, it depends. On the other hand, rapid advances in information technology, the need to update internal control guidelines in relation to Create a new computer system so as to ensure that the activities of managers and effective control Should be updated if necessary.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.41-43
• /
• 2021

Robot Operating System (ROS) has been a prominent and successful framework used in robotics business and academia.. However, the framework has long been focused and limited to navigation of robots and manipulation of objects in the environment. This focus leaves out other important field such as speech recognition, vision abilities, etc. Our goal is to take advantage of ROS capacity to integrate additional libraries of programming functions aimed at real-time computer vision with a depth-image camera. In this paper we will focus on the implementation of an upgraded vision with the help of a depth camera which provides a high quality data for a much enhanced and accurate understanding of the environment. The varied data from the cameras are then incorporated in ROS communication structure for any potential use. For this particular case, the system will use OpenCV libraries to manipulate the data from the camera and provide a face-detection capabilities to the robot, while navigating an indoor environment. The whole system has been implemented and tested on the latest technologies of Turtlebot3 and Raspberry Pi4.

• Journal of The Korean Astronomical Society
• /
• v.56 no.2
• /
• pp.159-168
• /
• 2023

The main goal of the Korean VLBI Network Calibrator Survey (KVNCS) is to expand the VLBI calibrators catalog for KVN, KaVA (KVN and VERA Array), EAVN (East-Asian VLBI Network), and other extended regions. The second KVNCS (KVNCS2) aimed to detect VLBI fringes of new candidates for calibrators in the K band. Out of the 1533 sources whose single-dish flux density in the K band was measured with KVN telescopes (Lee et al. 2017), 556 sources were observed with KVN in the K band. KVNCS2 confirmed the detection of VLBI fringes of 424 calibrator candidates over a single baseline. All detected sources had a high Signal-to-Noise Ratio (SNR) of >25. Finally, KVNCS2 confirmed 347 new candidates as VLBI calibrators in the K band, resulting in a 5% increase in the sky coverage compared to previous studies. The spatial distribution was quasi-uniform across the observable region (Dec. > -32.5°). In addition, the possibility as calibrator candidates for the detected sources was checked, using an analysis of the flux-flux relationship. Ultimately, the KVNCS catalog will not only become the VLBI calibrator list but is also useful as a database of compact radio sources for astronomical studies.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1233-1244
• /
• 2016

In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.378-387
• /
• 2003

Digital watermarking is the technique that embeds invisible signalsincluding owner identification information, specific code, or pattern into multimedia data such as image, video and audio. Watermarking techniques can be classified into two groups; robust watermarking and fragile(semi-fragile) watermarking. The main purpose of the robust watermarking is the protection of copyright, whereas fragile(semi-fragile) watermarking prevents image or video data from illegal modifications. To achieve this goal watermark should survive from unintentional modifications such as random noise or compression, but it should be fragile for malicious manipulations. In this paper, an invertible semi-fragile watermarkingalgorithm for authentication and detection of manipulated location in MPEG-2 bit-stream is proposed. The proposed algorithm embeds two kinds of watermarks, which are embedded into quantized DCT coefficients. So it can be applied directly to the compressed bit-stream. The first watermark is used for authentication of video data. The second one is used for detection of malicious manipulations. It can distinguish transcodingin bit-stream domain from malicious manipulation and detect the block-wise locations of manipulations in video data. Also, since the proposed algorithm has an invertible property, recovering original video data is possible if the watermarked video is authentic.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.786-792
• /
• 2010

This paper presents a real-time lane detection method which can accurately find the lane-mark boundaries in complex road environment. Unlike many existing methods that pay much attention on the post-processing stage to fit lane-mark position among a great deal of outliers, the proposed method aims at removing those outliers as much as possible at feature extraction stage, so that the searching space at post-processing stage can be greatly reduced. To achieve this goal, a grid-based morphology operation is firstly used to generate the regions of interest (ROI) dynamically, in which a directional edge-linking algorithm with directional edge-gap closing is proposed to link edge-pixels into edge-links which lie in the valid directions, these directional edge-links are then grouped into pairs by checking the valid lane-mark width at certain height of the image. Finally, lane-mark colors are checked inside edge-link pairs in the YUV color space, and lane-mark types are estimated employing a Bayesian probability model. Experimental results show that the proposed method is effective in identifying lane-mark edges among heavy clutter edges in complex road environment, and the whole algorithm can achieve an accuracy rate around 92% at an average speed of 10ms/frame at the image size of $320{\times}240$.

• Journal of Korea Game Society
• /
• v.15 no.4
• /
• pp.29-38
• /
• 2015

In the stealth game design, level designers are to develop many interesting game environments with a variety of difficulties. J. Tremblay and his co-authors developed a Unity-based level design tool to help and automate this process. Given a map, if the designer inputs several game factors such as guard paths and velocities, their vision, and the player's initial and goal positions, then the tool visualizes simulation results including (clustered) possible paths a player could take to avoid detection. Thus with the help of this tool, the designer can ensure in realtime if the current game factors result in the intended difficulties and players paths, and if necessary adjust the factors. In this note, we present our improvement on this tool in two aspects. First, we integrate a function that if the designer inputs some vertices in the map, then the tool systematically generates and suggests interesting guard paths containing these vertices of various difficulties, which enhances its convenience and usefulness as a tool. Second, we replace the collision-detection function and the RRT-based (player) path generation function, by our new collision-check function and a Delaunay roadmap-based path generation function, which remarkably improves the simulation process in time-efficiency.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.111-125
• /
• 2011

Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.

• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.105-114
• /
• 2011

The roadmap-based planning is a path planning method which is used widely for a goal-directed movement in Robotics and has been applied to the world of computer animation such as computer games. However it is unnatural for computer characters to follow the path planned by the roadmap method as it is performed in Robotics. Flocking which is used for realistic and natural movements in computer animation enables character's movement by using a few simple rules without planning unlike the roadmap method. However it is impossible to achieve a goal-directed movement with flocking only because it does not keep states. In this paper we propose a simulation method which combines planning based on the road map with reactive actions for natural movements along the path planned. We define and implement steering behaviors for a leader which are needed to follow the trajectory naturally by analysing characteristics of roadmap-based paths and for the rest of members which follow the leader in various manners by detecting obstacles. The simulations are performed and demonstrated by using the implemented steering behaviors on every possible combination of roadmap-based path planning methods and models of configuration spaces. We also show that the detection of obstacle-collisions can be done effectively because paths are planned in the configuration space in which a moving object is reduced to a point.