• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.2
• /
• pp.38-46
• /
• 2001

This paper presents a new multiprocessor system and corresponding scheduling algorithm that can be applied for implementation of fine grain DSP algorithms such as digital filters. The newly proposed system uses one or more shared buses as the basic interconnection network between processors, and fixed amount of clock-skew is maintained between instruction execution of processors. This system not only can handle the interprocessor communications very efficiently but also can explicitly incorporate the interprocessor communication delay time into the multiprocessor scheduling model. This paper also presents a new scheduling strategy for implementing digital filters expressed in fully-specified flow graphs on the proposed system. The simulation result shows that well-known digital filters can be implemented on proposed multiprocessor in which the implementation satisfies the iteration period bound.

• Journal of Korea Game Society
• /
• v.14 no.2
• /
• pp.55-66
• /
• 2014

Image warping is a technology to transform input images to be suitable for given conditions and has been recently utilized in changing face shape of characters in the field of movies or animation. Mesh warping which is one of warping methods that change shapes based on the features of face forms warping images by forming rectangular mesh groups around the eyes, nose, and mouth and matching them 1:1. This method has a problem in the resultant images are distorted in the segments of boundaries between meshes when there are errors in mesh control points or when meshes have been formed as many small area meshes. This study proposes a triangle based image interpolation technique to minimize the occurrence of errors in the process of forming natural warping images of face and process accurate results with a small amount of arithmetic operation and a short time. First, feature points that represent the face are found and these points are connected to form basic triangle meshes. The fact that the proposed method can reduce errors occurring in the process of warping while reducing the amount of arithmetic operation and time is shown through experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1146-1151
• /
• 2019

Histogram H is an x-monotone rectilinear polygon with a horizontal edge, called by a base, connecting the leftmost vertical edge and the rightmost vertical edge. Here the rectilinear polygon is a polygon with only horizontal and vertical edges and the x- monotone polygon P is a polygon in which every line orthogonal to the x-axis intersects P at most twice. Walking counterclockwise on the boundary of a histogram H yields a sequence of left turns and right turns at its vertices. Conversely, a given sequence of the turns at the vertices can be realized by a histogram. In this paper, we consider the problem of finding a histogram to realize a given turn sequence. Particularly, we will find the histograms to minimize its area and its bounding box. It will be shown that both of the problems can be solved by linear time algorithms.

• Korean Journal of Cognitive Science
• /
• v.17 no.2
• /
• pp.103-118
• /
• 2006

The main purpose of this paper is to investigate the effects of discourse topic and morpho-syntactic verbal information on the resolution of null pronouns in the Korean narrative text within the framework of the construction-integration theory (Kintsch, 1988, Singer & Kintsch, 2001, Graesser, Gernsbacher, & Goldman. 2003). For the purpose of this paper, two conditions were designed: an explicit condition with both a consistently maintained discourse topic and the person-specific verb modals on one hand, and a neutral condition with no discourse topic or morpho-syntactic information provided, on the other. We measured the reading tines far the target sentence containing a null pronoun and the question response times for finding an antecedent, and the accuracy rates for finding an antecedent. During the experiments each passage was presented at a tine on a computer-controlled display. Each new sentence was presented on the screen at the moment the participant pressed the button on the computer keyboard. Main findings indicate that processing is facilitated by macro-structure (topicality) in conjunction with micro-structure (morpho-syntax) in pronoun interpretation. It is speculated that global processing alone may not be able to determine which potential antecedent is to be focused unless aided by lexical information. It is argued that the results largely support the resonance-based model, but not the minimalist hypothesis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.681-688
• /
• 2008

In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.683-690
• /
• 2006

Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.10-21
• /
• 2008

User travel behavior is based on the existence of complete traffic information in deterministic user optimal principle by Wardrop(1952). According to deterministic user optimal principle, users choose the optimal route from origin to destination and they change their routes arbitrarily in order to minimize travel cost. In this principle, users only consider travel time as a factor to take their routes. However, user behavior is not determined by only travel time in actuality. Namely, the models that reflect only travel time as a route choice factor could give irrational travel behavior results. Therefore, the model is necessary that considers various factors including travel time, transportation networks structure and traffic information. In this research, more realistic deterministic optimal traffic assignment model is proposed in the way of route recognizance behavior. This model assumes that when users decide their routes, they consider many factors such as travel time, road condition and traffic information. In addition, route recognizance attributes is reflected in this suggested model by forward searching method and backward searching method with numerical formulas and algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.5
• /
• pp.17-26
• /
• 2016

This paper presents an adaptive slicing method based on merging vertical layer polylines. Firstly, we slice the input 3D polygon model uniformly with the minimum printable thickness, which results in bounding polylines of the cross section at each layer. Next, we group a set of layer polylines according to vertical connectivity. We then remove polylines in overdense area of each group. The number of layers to merge is determined by the layer thickness computed using the cusp height of the layer. A set of layer polylines are merged into a single polyline by removing the polylines within the layer thickness. The proposed method maintains the shape features as well as reduces the printing time. For evaluation, we sliced ten 3D polygon models using our method and a global adaptive slicing method and measured the total length of polylines which determines the printing time. The result showed that the total length from our method was shorter than the other method for all ten models, which meant that our method achieved less printing time.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.176-183
• /
• 1998

A new recognition technique using neural network coupled with Genetic Algorithms (GAs) was proposed. This technique concentrate on efficient Electromyography signal recognition through out improving neural network's several demerits. GAs paly a role of selecting Multilayer Perceptron's optimized initial connection weights by its typical global search. Electro Myography signal was pre-processed with Hidden Markov Model (HMM) in order to refect its time-varying property into input pattern except other features such as Zero Crossing Number(ZCN) and Integral Absolute Value (IAV). Results for 6 primitive motions show that the suggested technique has better performance in learning time and recognition rates than already established ordinary methods. Moreover, it performed stable recognition without convergence into a local minimum.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.25-40
• /
• 2012

This paper suggests the way to build the integration of internal server by using link server with virtualization method. With the development of on-line games, game communities began to be formed by users, players get fun from playing games, sharing online space with friends, clans, and parties. However, the limit of physical server restrict the allows under average a hundred users to play at same time and place, and three thousand to ten thousand people to access to game community with chat, message, friends functions. By following the explanation of the method from this paper, this limit can be overcome. It will give the function to share information of all connected users in one displayed server. This paper demonstrates the key quality requirements of the server built by this way such as scalable architecture, consistency, and latency is fulfilled.