• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• Journal of Navigation and Port Research
• /
• v.29 no.8 s.104
• /
• pp.701-707
• /
• 2005

This study aims to suggest how the port specialists think the priority of port development in Korea To illustrate the ideas regarding a port development, 87 detailed attributes were identified both from the previous studies and from brainstorming on port professionals. And these were grouped into 6 criteria by 'KJ method' and made into 4 levels hierarchy structure. AHP technique identifies the relative weights of each levels, trends of the preference of port specialists and the composite relative weights of alternatives. As a result, a port development priority in Korea has been proposed.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.771-774
• /
• 1999

This paper presents a new timing structure for real time communications and its performance analysis. The cycle time consists of several "one time slot" which may be an interval defined by a synchronous traffic part followed by an asynchronous traffic part. If a station receives a token within a synchronous interval, it transmits its synchronous message if any, otherwise it may transmit an asynchronous message. This scheme is different from usual allocation schemes which divide one cycle into alternating synchronous and asynchronous subslots. This protocol is designed to prevent low priority messages from delaying too much due to lots of high priority messages. We propose the algorithm and show its justification by simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1661-1678
• /
• 2016

Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.2
• /
• pp.101-111
• /
• 2009

This paper considers two-sided assembly line balancing with preemptive multiple goals. In the problem, three goals are taken into account in the following priority order : minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. An evolutionary algorithm is used to solve the multiple goal problems. A new structure is presented in the algorithm, which is helpful to searching the solution satisfying the goals in the order of the priority. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational results show that the proposed algorithm is premising in the solution quality.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1949-1955
• /
• 2000

This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

• 한국신재생에너지학회:학술대회논문집
• /
• 2011.05a
• /
• pp.135.2-135.2
• /
• 2011

The goal of this study is the derivation of priority for business in the areas of green energy technologies. In this paper, we calculated the importance weights of impact factors using the AHP (Analytic Hierarchy Process) method in order to derivation of priority to the green energy technologies business. AHP is a useful method for evaluating multi-criteria decision making problems. To apply the AHP method, specialists for the assessment have been identified by using the concept of 'plan, do, see' and the decision-making hierarchy was established. We selected 5 criteria and 16 sub-criteria for impact factors by brainstorming. According to the result in this study, the most important impact factor is the possibility of commercialization, the second is the possibility of developing the fundamental technology, and the third is the possibility of convergence technology.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.174-175
• /
• 2014

A Rural house in Chungcheong area have been variety of matters, rapid deterioration of house and incomplete of maintenance control, that is represented lack of durability heating from lack of heat insulation property, health worsening form use of toxic substance and so on. For farmers who did not know where to repair and how to repair, they are urgently needed measures of standard and basis that is to realize a condition of rural house. Accordingly, this study drew major matters and priority for revitalization through analysis of type of rural house from research on the actual condition in order to develope of diagnostic criteria of rural house.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.