• International Journal of Highway Engineering
• /
• v.15 no.1
• /
• pp.135-141
• /
• 2013

PURPOSES: In this study, as part of an effort to develop HUD for public transit, it is proposed that the decision of order priority of contents which will be disposed to bus drivers through HUD for public transit using AHP(Analytic Hierarchy Process) technique. METHODS: In AHP analysis method brainstorming, factor analysis, hierarchical structuring, and weighting analysis were performed by applying a classical analysis method. RESULTS: By the result of analysis it is shown that unlike car drivers, bus drivers prefer information related to bus intervals, bus stop, and door open and close to information related to vehicle running. Also, bus stop information and bus interval information were ranked as first and second place in order priority of HUD contents for public transit by experts. CONCLUSIONS: This method of selecting order priority of HUD contents for public transit can provide a basic foundation for selecting order priority of traffic information contents as well as other HUD contents.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.558-567
• /
• 2010

There is a large body of ongoing research to develop efficient prediction methods for data streams. These methods provide single prediction with a fixed time interval. It is necessary to develop a method for multi-interval prediction (MIP) because different prediction results may be obtained based on different intervals in many cases. In this paper, we propose a solution for MIP based on the Hierarchical Temporal Memory (HTM) model. In order to solve the problem of MIP with HTM, we present an Integrated Hierarchical Temporal Memory (IHTM) network by introducing a new node type Zeta1LastNode to the original HTM network. Using the hierarchical characteristic of the IHTM network, different levels in the network learn and model the features of a data stream with different intervals and generate prediction results for different intervals. Performance evaluation shows that the IHTM is efficient in the memory and time consumption compared with the original HTM network in MIP.

• Journal of the Korean Vacuum Society
• /
• v.20 no.5
• /
• pp.381-386
• /
• 2011

We fabricated the ZnO (zinc oxide)/$SiO_2$ (silicon dioxide) branch hierarchical nanostructures by the e-beam evaporation of $SiO_2$ onto the surface of the electrochemically grown ZnO nanorods on Si substrate, which leads to the self-assembled $SiO_2$ nanorods by oblique angle deposition between vapor flux and vertically aligned ZnO nanorods. In order to investigate the effects of $SiO_2$ deposition on the morphology and optical property of ZnO/$SiO_2$ branch hierarchical nanostructures, the evaporation time of $SiO_2$ was varied under a fixed deposition rate of 0.5 nm/s. The vertically aligned ZnO nanorods on Si substrate exhibited a low reflectance of <10% in the wavelength range of 300~535 nm. For ZnO/$SiO_2$ branch hierarchical nanostructures at 100 s of evaporation time of $SiO_2$, the more improved antireflective property was achieved. From these results, ZnO/$SiO_2$ branch hierarchical nanostructures are very promising for optoelectronic and photovoltaic device applications.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.299-313
• /
• 2002

Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.471-479
• /
• 2008

In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2005

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. A CSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CPSs. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-marking. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.117-124
• /
• 2009

The p-convergent boundary element method has been proposed to analyze two-dimensional potential problem on the basis of high order Legendre shape functions that have different property comparing with the shape functions in conventional boundary element method. The location of nodes corresponding to high order shape function are not defined along the boundary, called by nodeless node, similar to the p-convergent finite element method. As the order of shape function increases, the collocation point method is used to solve linear simultaneous equations. The collocation patterns of p-convergent boundary element method consist of non-symmetric hierarchial or symmetric non-hierarchical. As the order of shape function increases, the number of collocation point increases. The singular integral that appears in p-convergent boundary element has been calculated by special numeric quadrature technique and semi-analytical integration technique. The L-shape domain problem including singularity in the vicinity of reentrant comer is analyzed and the numerical results show that the relative error is smaller than $10^{-2}%$ range as compared with other results in literatures. In case of same condition, the symmetric p-collocation point pattern shows high accuracy of solution.

• The Korean Journal of Archival Studies
• /
• no.7
• /
• pp.37-74
• /
• 2003

An Old document(Diploma) is a historical and unique record, so it must be collected, arranged, and preserved for research as soon as possible. Especially, for the effective use of the Old Document(Diploma), it is needed to arrange and describe the material systematically on the ground of modern archival theory. The Kyujanggak Archives in the Seoul National University has published 23 volumes of Old document(Diploma) material Old Document(Diploma). But they seem to cause the readers inconvenience, because the materials are classified and gathered only by genre, the titles or the orders of the materials are not standardized, and there is no description about the content of each Old document(Diploma). Jangseo-gak Library in The Academy of Korean Studies has also published the series of Old document(Diploma) material Old Document(Diploma) Collection. However the case is not different, since they are all mixed up with materials classified and gathered by genre, family, academy, or local school. And a great part of the materials have no titles and no description about the content of each Old document(Diploma), either. About the arrangement and description of the records, European and American archival science has established the theory of l)the principle of provenance, 2)the principle of original order, 3)levels of control, 4)collective description. These theories are valuable for the effective use of Old document(Diploma). On the viewpoint of the principle of provenance, Old document(Diploma) materials should not be classified by subject and genre, but by family and person. Then, the Old document(Diploma) materials, after collected by the unit of family or person on the viewpoint of the principle of provenance, should be arranged in their original order for more detailed arrangement and furthermore, for the work to find their relationship. This is so called the principle of original order. The hierarchical management of the Old document(Diploma) materials, for example, classifying by record group, sub-group, series, item and so on, is the concept of the levels of control, and comprehensive description of the each hierarchical structure is the concept of the collective description. Let's apply these archival theories to 34 pieces of the Chung, Man-Seok's material in the series of Old document(Diploma) material Old Document(Diploma). First, collect the Old document(Diploma) materials into Chung, Man-Seok's collection(the principle of provenance), which were scattered in the series classified by genre. Secondly, rearrange them chronologically(the principle of original order), and then we can find the comprehensive information about Chung, Man-Seok. For the hierarchical management of the Old document(Diploma) materials, we should establish a few concepts from the general, large group to specific, small item. The concepts can be organized as following; l)record group(Chung, Man-Seok record group) - 2)sub-group(personnel document, property document, family document, social activity document, political activity document, etc) - 3)series(gyoji-series, gyoseo-series, yuji-series etc. in the personnel document) - 4)folder(document with additions) - 5)item(one document). According to the the theory of the collective description, in the level of record group, there should be a collective description of Chung, Man-Seok's biography or a summary of record group. Similarly, there should be a collective description of a summary of sub-group in the level of sub-group and a summary of series in the level of series.

• Management & Information Systems Review
• /
• v.38 no.2
• /
• pp.105-118
• /
• 2019

In order for a strategy established by a company to be implemented efficiently, it must be supported by an appropriate organizational culture. This means that if a firm has an organizational culture suitable for strategy implementation, performance can be enhanced. This study divides competitive strategy into cost leadership strategy and product differentiation strategy, and organizational culture into hierarchical/rational culture and consensual/development culture. Based on 122 questionnaires collected through KOSPI listed manufacturing companies, the results of the empirical analysis on the effect of suitability between competitive strategy and organizational culture on performance by balanced scorecard perspective are summarized as follows. First, it shows that the cost leadership strategy and the hierarchical/rational culture are more fit. Specifically, The high suitability between the cost leadership strategy and the hierarchical/rational culture has a positive effect on the performance of the balanced scorecard perspective(excluding performance by learning and growth perspective). Second, The high suitability between the product differentiation strategy and the consensual/development culture has a positive effect on the performance of the balanced scorecard perspective. The results of this study suggest that it is important to form a corporate culture that can lead to changes in the beliefs and behaviors of organizational members in accordance with the competitive strategy in order to successfully implement the strategies established by the company.