• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.39-56
• /
• 2015

Continuous multi-interval prediction (CMIP) is used to continuously predict the trend of a data stream based on various intervals simultaneously. The continuous integrated hierarchical temporal memory (CIHTM) network performs well in CMIP. However, it is not suitable for CMIP in real-time mode, especially when the number of prediction intervals is increased. In this paper, we propose a real-time integrated hierarchical temporal memory (RIHTM) network by introducing a new type of node, which is called a Zeta1FirstSpecializedQueueNode (ZFSQNode), for the real-time continuous multi-interval prediction (RCMIP) of data streams. The ZFSQNode is constructed by using a specialized circular queue (sQUEUE) together with the modules of original hierarchical temporal memory (HTM) nodes. By using a simple structure and the easy operation characteristics of the sQUEUE, entire prediction operations are integrated in the ZFSQNode. In particular, we employed only one ZFSQNode in each level of the RIHTM network during the prediction stage to generate different intervals of prediction results. The RIHTM network efficiently reduces the response time. Our performance evaluation showed that the RIHTM was satisfied to continuously predict the trend of data streams with multi-intervals in the real-time mode.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.1
• /
• pp.127-137
• /
• 2000

In this paper, we consider hierarchical Bayesian analysis for P(Y < X) using Gibbs sampler, where X and Y are independent normal distributions with unknown means and variances, respectively. Also numerical study using real data is provided.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.1033-1043
• /
• 2004

We consider the simultaneous Bayesian estimation for the normal means based on different noninformative type hyperpriors in hierarchical model. We provide numerical example using the famous baseball data in Efron and Morris (1975) for illustration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4189-4202
• /
• 2014

In this paper, we propose a priority-based unequal error protection scheme of data partitioned H.264/AVC video with hierarchical quadrature amplitude modulation. In order to map data with higher priority onto the most significant bits of QAM constellation points, a priority sorting method categorizes different data partitions according to the unequal importance factor of encoded video data in one group of pictures by evaluated the average distortion. Then we propose a hierarchical quadrature amplitude modulation arrangement with adaptive constellation distances, which takes into account the unequal importance of encoded video data and the channel status. Simulation results show that the proposed scheme improves the received video quality by about 2 dB in PSNR comparing with the state-of-the-art unequal error protection scheme, and outperforms EEP scheme by up to 5 dB when the average channel SNR is low.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.11a
• /
• pp.25.2-31
• /
• 2000

Recently, Fuzzy theory has been applied in evaluation problem. Fuzzy evaluation based on Fuzzy theory can accommodate fuzziness of judgement with people through introducing Fuzzy measure. Representative Fuzzy evaluation is Fuzzy Integral using Fuzzy measure. Definite methodology using Fuzzy Integral HFI(Hierarchical Fuzzy Integrals), HFEA(Hierarchical Fuzzy Evaluation Algorithm), HFP(Hierarchical Fuzzy Process), etc. In this paper, we deal with problem identifying evaluation value using Fuzzy Relation Equation at these Fuzzy evaluation. We verify relation between Input data and Output data through @-operation and apply this to HFP. And that we verify evaluation value which objects of evaluation are able to possess.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.41-49
• /
• 2010

In this paper, we propose a hierarchical RAM simulation model framework which are used to analyze the RAM specifications on the concept refinement phase. The hierarchical RAM simulation model framework consists of RAM simulation models, class library and each model's input and output data lists. The hierarchical RAM simulation models are co-operated with 3 kinds of model - type I, II, III. Type I, II models are used to analyze the target operational availability and Type III is used to establish the initial RAM specifications. Each model's input and output data lists are defined by considering each model's purpose of RAM analysis. The class library is arranged with each model's classes for implementing the hierarchical simulation models. The proposed framework may be applied for executing the RAM activities effectively.

• Journal of Korea Multimedia Society
• /
• v.24 no.4
• /
• pp.550-557
• /
• 2021

Image steganalysis is a technique for detecting images with steganographic algorithms applied, called stego images. With state-of-the-art CNN-based steganalysis methods, we can detect stego images with high accuracy, but it is not possible to know which steganographic algorithm is used. Identifying stego images is essential for extracting embedded data. In this paper, as the first step for extracting data from stego images, we propose a hierarchical CNN structure for senary classification of steganographic algorithms. The hierarchical CNN structure consists of multiple CNN networks which are trained to classify each steganographic algorithm and performs binary or ternary classification. Thus, it classifies multiple steganogrphic algorithms hierarchically and stepwise, rather than classifying them at the same time. In experiments of comparing with several conventional methods, including those of classifying multiple steganographic algorithms at the same time, it is verified that using the hierarchical CNN structure can greatly improve the classification accuracy.

• Journal of Digital Contents Society
• /
• v.16 no.1
• /
• pp.33-41
• /
• 2015

Since bitmap indices are useful for OLAP queries over low-cardinality data columns, they are frequently used in data warehouses. In many data warehouse applications, the domain of a column tends to be hierarchical, such as categorical data and geographical data. When the domain of a column is hierarchical, hierarchical bitmap index is able to significantly improve the performance of queries with conditions on that column. This strategy, however, has a limitation in that when a large scale hierarchy is used, building a bimamp for each distinct node leads to a large space overhead. Thus, in this paper, we introduce the way to build hierarchical bitmap index on an attribute whose domain is organized into a large-scale hierarchy in space-constrained environments. Especially, in order to figure out space overhead of hierarchical bitmap indices, we propose the cut-selection strategy which divides the entire hierarchy into two exclusive regions.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.4
• /
• pp.1083-1090
• /
• 2016

In clinical studies, different types of outcomes (e.g. repeated measures data and time-to-event data) for the same subject tend to be observed, and these data can be correlated. For example, a response variable of interest can be measured repeatedly over time on the same subject and at the same time, an event time representing a terminating event is also obtained. Joint modelling using a shared random effect is useful for analyzing these data. Inferences based on marginal likelihood may involve the evaluation of analytically intractable integrations over the random-effect distributions. In this paper we propose a joint HGLM approach for analyzing such outcomes using the HGLM (hierarchical generalized linear model) method based on h-likelihood (i.e. hierarchical likelihood), which avoids these integration itself. The proposed method has been demonstrated using various numerical studies.

• Journal of IKEEE
• /
• v.18 no.2
• /
• pp.248-254
• /
• 2014

The hierarchical conference causes the data delay because the exchanged data between terminals in the conference go through the hierarchical structure. In this paper, we propose an algorithm which minimizes the average path distance between terminals in a non-incremental hierarchical conference, and which considers the computing resource. For terminals which want to join the ongoing hierarchical conference, our algorithm selects terminals that the new connection is possible among terminals in the conference with the computing resource consideration. Then, after all distance values between the selected terminals and terminals which want to join the ongoing hierarchical conference are computed, and the terminal-pair which have minimum distance value is selected, the ongoing hierarchical conference is extended with a connection of the terminal-pair which consists of a terminal among selected terminals and other terminal among terminals which want to join the ongoing hierarchical conference. This continues until all terminals are included in the conference. As the experimental results with the proposed non-incremental scheme, the hierarchical conference can be organized with 24% better performance than the earlier incremental scheme on the basis of average path distance between terminals.