• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.6
• /
• pp.47-58
• /
• 2004

To generate individualized and adaptive course, it's required to have the foundation structure in which learning objects are connected with each other with logical relevances. Each learner can have peculiar learning path at each point of time of learning through the logical relevancy between those learning objects and various links, considering individual learner. The purpose of this study is to design a learning object-basis individualized learning system structure, considering semantic sequencing by learning task types. It is our understanding that the individualized learning system design model of this study, considering the relevancy between learning objects, can be a fresh trial to accommodate semantic learning and true educational spirits in e-Learning at this point of time when criticism, such as the learning object based course design is simply a collection of meaningless objects, etc., is becoming influential.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.119-127
• /
• 2006

In this two-part paper, we consider dynamic resource allocation in orthogonal frequency division multiple access(OFDMA). To reduce the reverse link overhead for channel quality information(CQI) feedback, a set of sub-carriers are tied up to a sub-channel to be used as the unit of CQI feedback, user-multiplexing and the corresponding power/rate allocation. Specifically, we focus on two sub-channel structures, either aggregated or distributed, where the SNR distribution over a sub-channel is modeled as Ricean in general, and the channel quality of a sub-channel is summarized as the mean and variance of channel gain envelop divided by noise standard deviation. Then, we develop a generalized two step channel/resource allocation algorithm, which uses the two statistical measurements, and analyze the spectral efficiency of the OFDMA system in terms of average frequency utilization. An extension to proportional fair algorithm will also be addressed. As confirmed by numerical results, the aggregated structure is preferred especially when intending aggressive link adaptation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.734-740
• /
• 2012

In this paper, we propose a method for throughput improvement in multirate multihop wireless networks with intra-session network coding. A multirate transmission supports several rates so that it has a tradeoff between transmission rate and transmission range, therefore multirate can cope with the performance degradation. We present the rate selection method with intra-session network coding in multirate nodes. The effective transmission rate is calculated by using intra-session network coding, and then its maximum effective transmission rate is selected. Concurrent transmission set is determined by selected transmission rate and then the linear programming is formulated for throughput calculation in multihop wireless networks. We evaluate the performance by using MATLAB and lp_solve programs in two topologies. It is shown that the throughput of the proposed method is improved.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.1-15
• /
• 2001

Expressing complex query conditions in a concise and intuitive way has been a challenge in the design of visual object-oriented query languages. We propose a visual query language called VOQL (Visual Object oriented Query Language) for object oriented databases. By employing the visual notation of graph and Venn diagram, the database schema and the advanced features of object oriented queries such as multi-valued path expressions and quantifiers can be represented in a simple way. VOQL has such good features as simple and intuitive syntax, well-defined semantics, and excellent expressive power of object-oriented queries compared with previous visual object-oriented query languages.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.39-52
• /
• 2006

With the recent the use of spatio-temporal data mining which can extract various knowledge such as movement patterns of moving objects in history data of moving object gets increasing. However, the existing movement pattern extraction methods create lots of candidate movement patterns when the minimum support is low. Therefore, in this paper, we suggest the STMPE(Spatio-Temporal Movement Pattern Extraction) algorithm in order to efficiently extract movement patterns of moving objects from the large capacity of spatio-temporal data. The STMPE algorithm generalizes spatio-temporal and minimizes the use of memory. Because it produces and keeps short-term movement patterns, the frequency of database scan can be minimized. The STMPE algorithm shows more excellent performance than other movement pattern extraction algorithms with time information when the minimum support decreases, the number of moving objects increases, and the number of time division increases.

• Journal of Korea Technology Innovation Society
• /
• v.19 no.2
• /
• pp.231-253
• /
• 2016

The purpose of this study is two fold. First, we will explore the meaning, spread effect and consideration factors of manufacturing innovation in terms of theoretical perspective. Second, we will verify the status of high performance computing (HPC) utilization policy, and analyze the situation of US and Korea. Manufacturing innovation policy in each country has the objective in common which aims epoch-making enhancing of productivity. Nevertheless it can be characterized as innovation oriented policy rather than simple trial of productivity improvement. For long term growth and employment, the need for reindustrialization instead of deindustrialization should be recognized. Employment may be decreased temporarily and partially due to manufacturing innovation. However net effect of employment increasing will be bigger because of indirect employment. HPC utilization policy has the importance as a separate movement other than as a subset of manufacturing innovation. US government is trying to eliminate the bottleneck elements in adoption of HPC based M&S activity, and to promote the way of problem solving through the mechanism of public-private partnership, in spite of low level of HPC based M&S. In Korea, ecosystem related with the activity of HPC based M&S is needed, and expansion of M&S utilization in manufacturing companies and fostering of M&S supporting institutions will be important for this task.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.45-55
• /
• 2006

This paper proposes a virtual target overlay technique for a realistic training simulation which projects a virtual target on ground-based CCD images according to an appointed scenario. This method creates a realistic 3D model for instructors by using high resolution GeoTIFF (Geographic Tag Image File Format) satellite images and DTED(Digital Terrain Elevation Data), and it extracts road areas from the given CCD images for both instructors and trainees, Since there is much difference in observation position, resolution, and scale between satellite Images and ground-based sensor images, feature-based matching faces difficulty, Hence, we propose a moving synchronization technique that projects the targets on sensor images according to the moving paths marked on 3D satellite images. Experimental results show the effectiveness of the proposed algorithm with satellite and sensor images of Daejoen.