• Journal of the Korean Data and Information Science Society
• /
• 제26권1호
• /
• pp.31-39
• /
• 2015

본 논문은 확률효과모형에서 사영에 근거한 분산성분을 구하는 방법을 다루고 있다. 분산성분을 추정하기 위한 ANOVA방법에서 제곱합의 계산에 사영을 이용하는 방법을 제시하고 있다. 분산성분을 구하기 위한 사영의 이용은 모형행렬에 의한 사영공간을 분산성분별 제곱합을 얻기 위한 상호직교하는 부분공간들로 분할하게 된다. 부분공간들로 분할하기 위해 모형행렬 X로의 사영에 단계별 방법(stepwise procedure)을 적용하여 해당하는 공간으로의 사영행렬을 구하는 방법을 다루고 있다. 단계별 방법에 의해 주어지는 부분공간들의 직교성으로 인해 사영행렬의 곱은 영행렬로 주어지는 성질을 갖는다. 단계별 방법에 의한 순차적 사영은 해당하는 공간으로의 사영행렬에 대한 확인과 사영행렬의 구조를 파악할 수 있는 이점이 있다. 또한 분산성분의 추정을 위한 제1종 제곱합을 구하기 위한 방법으로 유용하다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권6호
• /
• pp.808-816
• /
• 2016

As the number of CPU/GPU cores and IPs in SOC increases and applications require explosive memory bandwidth, simultaneously achieving good throughput and fairness in the memory system among interfering applications is very challenging. Recent works proposed priority-based thread scheduling and channel partitioning to improve throughput and fairness. However, combining these different approaches leads to performance and fairness degradation. In this paper, we analyze the problems incurred when combining priority-based scheduling and channel partitioning and propose dynamic priority thread scheduling and adaptive channel partitioning method. In addition, we propose dynamic address mapping to further optimize the proposed scheme. Combining proposed methods could enhance weighted speedup and fairness for memory intensive applications by 4.2% and 10.2% over TCM or by 19.7% and 19.9% over FR-FCFS on average whereas the proposed scheme requires space less than TCM by 8%.

• 전기전자학회논문지
• /
• 제22권3호
• /
• pp.558-564
• /
• 2018

In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

• 전기학회논문지
• /
• 제58권1호
• /
• pp.173-180
• /
• 2009

It is difficult to predict non-stationary or chaotic time series which includes the drift and/or the non-linearity as well as uncertainty. To solve it, we propose an effective prediction method which adopts data preprocessing and multiple model TS fuzzy predictors combined with model selection mechanism. In data preprocessing procedure, the candidates of the optimal difference interval are determined based on the correlation analysis, and corresponding difference data sets are generated in order to use them as predictor input instead of the original ones because the difference data can stabilize the statistical characteristics of those time series and better reveals their implicit properties. Then, TS fuzzy predictors are constructed for multiple model bank, where k-means clustering algorithm is used for fuzzy partition of input space, and the least squares method is applied to parameter identification of fuzzy rules. Among the predictors in the model bank, the one which best minimizes the performance index is selected, and it is used for prediction thereafter. Finally, the error compensation procedure based on correlation analysis is added to improve the prediction accuracy. Some computer simulations are performed to verify the effectiveness of the proposed method.

• Journal of Computing Science and Engineering
• /
• 제4권3호
• /
• pp.207-224
• /
• 2010

This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.194-199
• /
• 2003

Data are an expression of the language or numerical values that show some features. And the information is extracted from data for the specific purposes. The knowledge is utilized as information to construct rules that recognize patterns or make a decision. Today, knowledge extraction and application of that are broadly accomplished for the easy comprehension and the performance improvement of systems in the several industrial fields. The knowledge extraction can be achieved by some steps that include the knowledge acquisition, expression, and implementation. Such extracted knowledge is drawn by rules with data mining techniques. Clustering (CL), input space partition (ISP), neuro-fuzzy (NF), neural network (NN), extension matrix (EM), etc. are employed for the knowledge expression based upon rules. In this paper, the various approaches of the knowledge extraction are surveyed and categorized by methodologies and applied industrial fields. Also, the trend and examples of each approaches are shown in the tables and graphes using the categories such as CL, ISP, NF, NN, EM, and so on.

• 한국국방경영분석학회지
• /
• 제25권2호
• /
• pp.15-30
• /
• 1999

A number of combat simulation models are scattered and the analytic solution approaches have experienced very difficult computational efforts. Today´s computer communication technology let people to do many unrealistic things possible and the use of those technologies is becoming increasingly prevalent throughout the military operation. Both DIS and ADS are welled defined computer aided military simulations. This study discusses a simulation of stochastic combat network modeling through Internet space. We have developed two separate simulation models, one for clients and another for server, and validated for conducting studies with these models. The object-oriented design was necessary to define the system entities and their relationship, to partition functionality into system entities, and to transform functional metrics into realizations derived from system component behaviors. Heterogeneous forces for each side are assumed at any battle node. The time trajectories for mean number of survivors and combat history at each node, some important combat measures, and relative difference computations between models were made. We observe and may conclude that the differences exit and some of these are significant based on a limited number of experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1188-1202
• /
• 2012

In this paper, we propose a new multi-scale connected coherence tree algorithm (MCCTA) by improving the connected coherence tree algorithm (CCTA). In contrast to many multi-scale image processing algorithms, MCCTA works on multiple scales space of an image and can adaptively change the parameters to capture the coarse and fine level details. Furthermore, we design a Multi-scale Connected Coherence Tree algorithm plus Spectral graph partitioning (MCCTSGP) by combining MCCTA and Spectral graph partitioning in to a new framework. Specifically, the graph nodes are the regions produced by CCTA and the image pixels, and the weights are the affinities between nodes. Then we run a spectral graph partitioning algorithm to partition on the graph which can consider the information both from pixels and regions to improve the quality of segments for providing image segmentation. The experimental results on Berkeley image database demonstrate the accuracy of our algorithm as compared to existing popular methods.

• 설비공학논문집
• /
• 제26권5호
• /
• pp.218-223
• /
• 2014

Korea District heating corp. recently give an attention to combine the district heating and supply pipes as a two pipe system that are in the present system separated with room heating and warm water supply pipe, and the two pipe system is commonly applied for heating service in European countries. In the new two pipe system, only one heat source is supplied to a house and partitioned into room heating and warm water supply by household substation. So the effective distribution of supplied heat source in accordance to user intention is very important. This paper presents the development and performance test of three-way proportional control valve for a combined heat source system in district heating. The proposed valve is controlled to partition heat source into two different directions : hot water distributor for space heating and household substation for warm water supply in response to the pressure drops of tap water caused by the user. The performance investigation is shown within 3% of error compared to the theoretical model of the three-way proportional valve and its controllability is verified.

• 자연과학논문집
• /
• 제7권
• /
• pp.27-35
• /
• 1995

정지영상이나 동영상 코딩에 적용되는 2-D DCT의 효율적인 VLSI 구현을 위한 방법을 제시하였다. 2차원 상태공간식에 근거한 알고리즘 및 데이타 분할기법을 활용하여 다중프로세서 구조에서 문제가 되는 프로세서간의 통신량을 크게 감축시켰으며, 모든 통신을 국부적(local)이 되도록 하였다. 순차 주사 방식의 영상데이타를 입력할 수 있도록 설계하여 입력장치에 소요되는 하드웨어를 최소화하였으며, 계산의 순서를 조정함으로써 일반적인 행.열 분할 방법을 사용하는 2-D DCT에서 필요로 하는 Transposition RAM을 제거하였다. 제안된 VLSI 구조는 실시간 one-chip 2-D DCT 및 보다 큰 2-D DCT로 확장될 수 있다.