• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.508-511
• /
• 2008

In this paper, we propose software architecture for conveying contents-based OpenSound Control (OSC) packet from manipulation user interface to cooperative remote multi-robots. The Flash application is used as a controlling user interface and the physical prototyping of multi-robots were developed using physical prototyping toolkit.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.464-475
• /
• 2017

In this paper, we present a new texture image retrieval method which combines color and texture features extracted from images by a set of multi-resolution multi-direction (MRMD) filters. The MRMD filter set chosen is simple and can be separable to low and high frequency information, and provides efficient multi-resolution and multi-direction analysis. The color space used is HSV color space separable to hue, saturation, and value components, which are easily analyzed as showing characteristics similar to the human visual system. This experiment is conducted by comparing precision vs. recall of retrieval and feature vector dimensions. Images for experiments include Corel DB and VisTex DB; Corel_MR DB and VisTex_MR DB, which are transformed from the aforementioned two DBs to have multi-resolution images; and Corel_MD DB and VisTex_MD DB, transformed from the two DBs to have multi-direction images. According to the experimental results, the proposed method improves upon the existing methods in aspects of precision and recall of retrieval, and also reduces feature vector dimensions.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.21 no.3
• /
• pp.22-28
• /
• 2022

In the semiconductor and display component industries, the use of ceramic materials, which are high-strength materials, is increasing for ensuring durability and wear resistance. Among them, alumina materials are used increasingly. Alumina materials are extremely difficult to process because of their high strength; as such, research and development in the area of mineral material processing is being promoted actively to improve their processing. In this study, the processability of an electrodeposition tool is investigated using the electrodeposition method to smoothly process alumina materials. Furthermore, processing is conducted under various processing conditions, such as spindle speed, feed speed, and depth of cut. In addition, the processing characteristics of the workpiece are analyzed based on the tooling.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1575-1584
• /
• 2017

As interest in big data has increased recently, NoSQL, a solution for storing and processing big data, is getting attention. NoSQL supports high speed, high availability, and high scalability, but is limited in areas where data integrity is important because it does not support multiple row transactions. To overcome these drawbacks, many studies are underway to support multiple row transactions in NoSQL. However, existing studies have a disadvantage that the number of transactions that can be processed per unit of time is low and performance is degraded. Therefore, in this paper, we design and implement a multi-row transaction system for data integrity in big data environment based on HBase, a column-based NoSQL which is widely used recently. The multi-row transaction system efficiently performs multi-row transactions by adding columns to manage transaction information for every user table. In addition, it controls the execution, collision, and recovery of multiple row transactions through the transaction manager, and it communicates with HBase through the communication manager so that it can exchange information necessary for multiple row transactions. Finally, we performed a comparative performance evaluation with HAcid and Haeinsa, and verified the superiority of the multirow transaction system developed in this paper.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1277-1298
• /
• 2017

Related to the maximum vector problem, a skyline query is to discover dominating tuples from a set of tuples, where each defines an object (such as a hotel) in several dimensions (such as the price and the distance to the beach). A tuple, an instance of an object, dominates another tuple if it is equally good or better in all dimensions and better in at least one dimension. Traditionally, skyline queries are defined upon single-instance data or upon objects each of which is associated with an instance. However, in some cases, an object is not associated with a single instance but rather by multiple instances. For example, on a review website, many users assign scores to a product or a service, and a user's score is an instance of the object representing the product or the service. Such data is an example of multi-instance data. Unlike most (if not all) others considering the traditional setting, we consider skyline queries defined upon multi-instance data. We define the dominance calculation and propose an algorithm to reduce its computational cost. We use synthetic and real data to evaluate the proposed methods, and the results demonstrate their utility.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.179-193
• /
• 1995

A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.13-18
• /
• 2010

Most of the research in the multi-touch area is based on the FTIR(Frustrated Total Internal Re리ection), which is just implemented by using the previous approach. Moreover, there are not the software solutions to improve a performance in the multi touch-blobs detection or the user gesture recognition. Therefore, we implement a multi-touch table-top display that is based on the DI(Diffused Illumination), the improved touch-points detection and user gesture recognition. The proposed method supports a simultaneous transformation multi-touch command for objects in the running application. Also, the system latency time is reduced by the proposed ore-testing method in the multi touch-blobs detection processing. Implemented device is simulated by programming the Flash AS3 application in the TUIO(Tangible User Interface Object) environment that is based on the OSC(Open Sound Control) protocol. As a result, Our system shows the 37% system latency reduction, and is successful in the multi-touch gestures recognition.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.53-59
• /
• 2009

In multi-user MIMO systems, a base station transmits multiple data to multi-user simultaneously in order to improve performance and bandwidth efficiency. When the base station transmits multiple data to multi-user simultaneously, multi-user interference occurs severely. In this paper, we define a post-processing leakage as the total power leaked from desired user to all other users after combining at the output of each user. Using concept of the post-processing leakage, we also define a performance metric, the so called signal-to-post-processing-leakage-plus-noise ratio (SPPLNR). Assuming that the receiver is the minimum mean square error (MMSE) receiver, we propose an iterative SPPLNR-based beamforming that determines beamforming vectors and combining vectors by using an iterative method. The proposed scheme does not impose a condition on the relation between the number of transmit antennas for the base station and the number of receive antennas for users. Simulation results show that the proposed scheme outperforms a beamforming scheme perfectly eliminating the multi-user interference when channel estimation error exists.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.149-151
• /
• 2002

We had been developing the variety of parallel processing systems in order to improve the processing speed of visual media applications. These systems were using multi-access memory system(MAMS) as a parallel memory system, which provides the capability of the simultaneous accesses of image points in a line-segment with an arbitrary degree, which is required in many low-level image processing operations such as edge or line detection in a particular direction, and so on. But, the performance of these systems did not give a faithful speed because of asynchronous feature between MAMS and processing elements. To improve the processing speed of these systems, we have been investigated a pipelined parallel processing system using MAMS. Although the system is considered as being the single instruction multiple data(SIMD) type like the early developed systems, the performance of the system yielded about 2.5 times faster speed.

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.