• 대한토목학회논문집
• /
• 제34권1호
• /
• pp.333-340
• /
• 2014

보행자들의 선호도 및 선호공간의 특성을 고찰하기 위하여 다차원척도법(MDS)을 이용하여 분석을 실시한 결과, 차원 1의 보행공간 특성은 보행자 전용도로의 유무여부, 보차분리가 되어 있는 공간과 보차분리가 되어 있지 않은 공간적 특성을 가지는 "보차분리(보행자 전용도로)"의 차원으로 해석된다. 차원 2는 자연적이고 한적한 경관적 특성을 가지는 공간과 복잡하고 혼잡한 도시적 특성을 가지는 공간으로 "자연성-도회성"의 차원으로 해석된다. 또한 보행자들의 선호공간 벡터를 분석한 결과 주거단지 사이의 보행자 전용도로, 소공원 보행공간, 근린공원 보행공간, 공공시설 주변 보행공간 등이 가장 선호되는 공간으로 나타났고, 단독주택주변 보행공간은 반대로 가장 선호하지 않는 공간으로 분석된다.

• 한국재료학회지
• /
• 제21권1호
• /
• pp.56-66
• /
• 2011

Multi-source evaporation is one of the methods to improve the thickness uniformity of thin films deposited by evaporation. In this study, a simulator for the relative thickness profile of a thin film deposited by a multi-source evaporation system was developed. Using this simulator, the relative thickness profiles of the evaporated thin films were simulated under various conditions, such as the number and arrangements of sources and source-to-substrate distance. The optimum conditions, in which the thickness uniformity is minimized, and the corresponding efficiency, were obtained. The substrate was a 5th generation substrate (dimensions of 1300 mm ${\times}$ 1100 mm). The number of sources and source-to-substrate distance were varied from 1 to 6 and 0 to the length of the major axis of the substrate (1300 mm), respectively. When the source plane, the area on which sources can be located, is limited to the substrate dimension, the minimum thickness uniformity, obtained when the number of sources is 6, was 3.3%; the corresponding efficiency was 16.6%. When the dimension of the source plane is enlarged two times, the thickness uniformity is remarkably improved while the efficiency is decreased. The minimum thickness uniformity, obtained when the number of sources is 6, was 0.5%; the corresponding efficiency was decreased to 9.1%. The expansion of the source plane brings about not only the improvement of the thickness uniformity, but also a decrement of the efficiency and an enlargement of equipment.

• Journal of applied mathematics & informatics
• /
• 제35권5_6호
• /
• pp.623-649
• /
• 2017

Retrial queues have been widely used to model the many practical situations arising from telephone systems, telecommunication networks and call centers. An approximation method for a simple Markovian retrial queue by reducing the two dimensional problem to one dimensional problem was presented by Fredericks and Reisner in 1979. The method seems to be a promising approach to approximate the retrial queues with complex structure, but the method has not been attracted a lot of attention for about thirty years. In this paper, we exposit the method in detail and show the usefulness of the method by presenting the recent results for approximating the retrial queues with complex structure such as multi-server retrial queues with phase type distribution of retrial time, impatient customers with general persistent function and/or multiclass customers, etc.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 1999년도 춘계학술발표논문집 논문집
• /
• pp.39-44
• /
• 1999

The purpose of this study was to extract emotional dimensions from Korean adjectives relating to apartment noise. Noise-related 296 Korean adjectives were extracted from a dictionary and three evaluators selected 96 adjectives from those by removing very similar ones in meaning. Two types of 96 7-point scales were conducted to college students for evaluation, whether each adjective describes apartment noise appropriately. From this evaluation, 28 adjectives having above 4.5 points were selected. Again, 8 different types of 7-point scales on 378 adjective pairs(28 x 27/2) were administrated to separate college students to evaluate the degree of similarity between 28 adjectives. Based upon this evaluation, 14 adjectives were finally selected and scores on similarity sere analyzed through two different statistical analyses (Multi-dimensional scale and Cluster analysis). The results showed that three dimensions (displeasure, sensitivity and perceived loudness) exist in peoples' emotional response state to apartment noise. The previous studies have treated annoyance and sensitivity as separate measures to noise. However, this study showed that these two factors were on the same emotional dimension labeled as 'sensitivity' In addition, new dimension, labeled as 'displeasure', was found.

• 한국인쇄학회지
• /
• 제16권3호
• /
• pp.97-108
• /
• 1998

Spectral reflectance of the object should be measured to predict the color of object under various illuminants. The spectral reflectance can be represented in a multi-dimension space. Generally the information of inputed image by digital camera and color scanner is represented with 3-dimension color signals such as RGB. In other to predict the color of inputed image under any illuminant, we should be estimated spectral reflectance of the object. In this paper, we described the method to predict spectral reflectance by einenvector using the skin color of printed image, confirmed availability and propriety through experiment. we estimated spectral reflectance of skin color taken by RGB color signals and than reproduced skin color according to various illuminants on CRT.

• 전자공학회논문지D
• /
• 제35D권10호
• /
• pp.7-12
• /
• 1998

본 논문에서는 다양한 물질에 접촉해 있는 여러 형태의 동축선 끝단에서의 전파반사를 FDTD 방법으로 해석하였다. 3차원의 해석 구조를 2차원 원통 좌표계로 변환하여 매우 효율적으로 계산할 수 있었다. FDTD 계산결과를 통하여, 주파수가 높아지거나 또는 동축선로의 직경이 증가할 때 동축선 끝단에서의 반사크기가 줄어든다는 것을 알았다. 이 방법을 적용하여 다층 구조에서의 전파반사도 해석하였으며, 측정결과와 이론식을 이용하여 본 해석 방법을 검증하였다.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권4호
• /
• pp.172-179
• /
• 2001

A component based method out of load modeling is to aggregate component load model according to the composition rate of each component load at load bus based on the circuit theory. But the most of component loads respond complex nonlinear characteristics respect to voltage and frequency variation due to the control techniques and semiconductor elements applied to component load. It needs to verify this approach through actual experiment of the aggregation of component load even if it can be down. To identify this aggregation method well known, this paper is proposed the classifying method of component load characteristics for component loads to group by quantitative analysis. The component load characteristics were divided into several types by KSOM (kohonen self organizing map), which can classify multi-dimension vector, component load pattern, into two-dimension vector. Some ambiguous cases happened from KSOM were classified by the proposed closing degree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3348-3364
• /
• 2021

Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.