• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.2
• /
• pp.10-18
• /
• 2003

This paper presents a method for designing guaranteed cost fuzzy filter with a desired H$_{\infty}$ disturbance rejection constraint of delayed fuzzy dynamic systems. This method not only guarantees an induced L$_2$ norm bound constraint on disturbance attenuation, but also minimizes an upper bound on a linear quadratic performance measure. A sufficient condition for the existence of guaranteed cost fuzzy filter with H$_{\infty}$ constraint is then presented in terms of linear matrix inequalities(LMIs). A simulation example is given to illustrate the design procedures and performances of the proposed methods.

• Korean Journal of Construction Engineering and Management
• /
• v.7 no.3 s.31
• /
• pp.149-158
• /
• 2006

For construction projects, it is required to estimate the Environmental Management Cost(EMC) for pollution prevention, using the calculation standards prescribed in the Construction Technology Management Law(CTML). However, the EMC standards are difficult to utilize without definite site information. Therefore, it is needed a new calculation method reflecting project site information. According to the definition of EMC in the CTML, this study identifies the EMC items and classifies them into the pollution types such as air, water, noise, waste and others. With this EMC classification, the stud:』 analyzes using the SPSS the EMC for the 78 new multi-housing projects, which were executed during the past three years, 2000-2002. And then an EMC estimating matrix is developed with simple information such as site location and size of area from historical data. The proposed matrix can be effectively used to check and control budgeting and estimating the EMC of the multi-housing projects. In addition, the proposed EMC matrix are validated through a case study.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2006.05b
• /
• pp.553-556
• /
• 2006

Generally, concrete is one of the most widely used construction materials, because of its good durability to cost ratio. However, when subjected to severe environments its durability can significantly decline due to various harmful conditions. In this article, we would like to investigate a chloride ion diffusion of cement matrix with inert filler, which ground calcium carbonate(GCC). For the experimental results of the chloride ion diffusion, as the addition of GCC makes decreasing the permeability by micro-filler effect, the matrix of 5-15% ratio of replacement are superior to the GCC0 mortar matrix with respect to durability of cement matrix in this scope.

• Ceramist
• /
• v.9 no.6
• /
• pp.18-23
• /
• 2006

In this article, the present activities regarding research and development of continuous SiC fiber reinforced ceramic matrix composites (CFCC) in Japan are reviewed. The key technologies in SiC fiber composites are interphase between fiber and matrix and its oxidation resistance. To improve oxidation resistance of interphase, various kinds of technologies such as environment barrier coating, high dense matrix, unti-oxidation matrix, multi-layered intephase have been developed. It is suggested that high performance, affordable processing cost, and excellent reliability will be important factors to be in practical use of CMCs in future.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.26 no.3
• /
• pp.115-121
• /
• 2014

HVAC&R system costs can often be one of the most expensive components, representing approximately 15% of the total construction cost for office buildings. Despite their significant importance, there is a lack of a consistent and homogeneous framework to approximate the estimate research. This research deals with the prediction methodology of HVAC&R system cost with the aim of establishing a common idea for the analysis of the construction cost estimate. Our approach deals with the concept of an HVAC&R set that is composed of subsystems. The matrix combination analysis is examined, and total 960 HVAC&R system cost estimation can be implemented to large scale office buildings.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.19-23
• /
• 2000

In this paper, we deal with the problem of designing guaranteed cost state feedback controller for the generalized time-varying delay systems with delayed state and control input. The generalized time delay system problems solved on the basis of LMI(linear matrix inequality) technique considering time-varying delays. The sufficient condition for the existence of controller and guaranteed cost state feedback controller design methods are presented. Also, using some changes of variables and Schur complements, the obtained sufficient condition can be reformulated as LMI forms in terms of transformed variables. Therefore, all solutions of LMIs, guaranteed cost controller gain, and guaranteed cost are obtained at the same time. The proposed controller design method can be extended into the problem of robust guaranteed cost controller design method for parameter uncertain systems with time-varying delays easily.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3057-3075
• /
• 2020

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• Journal of Korean Society of Water and Wastewater
• /
• v.22 no.4
• /
• pp.437-444
• /
• 2008

Many other countries have investigated the new backwash water treatment process to save the existing water resource. There are various methods for reusing backwash water, but the membrane system has received the most interest for its efficiency. The objective of this study was to certify the application of membrane filtration system for the backwash water treatment. The experiment equipment was composed of Lab scale tubular membrane filtration system. Generally, cross-flow operation mode is used in the tubular membrane system but cross-flow operation mode demands high electric cost mainly for the pump energy. So to cut off electric cost, dead-end operation mode was used in this experiment. Filtration and bleed operation cycle was used in this membrane system. Backwash water was concentrated during the filtration process and when backwash water reached our target suspended solid concentration, it was discharged from this system. For efficient operation of filtration and bleed, mathematical matrix was drawn up and with this matrix we could simulate various sets of filtration and bleed time.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.129-139
• /
• 2009

This paper provides an efficient algorithm for computing the ${\eta}_T$ pairing on supersingular elliptic curves over fields of characteristic two. In the proposed algorithm, we deploy a modified multiplication in $F_{2^{4n}}$ using the Vandermonde matrix. For F, G ${\in}$ $F_{2^{4n}}$ the proposed multiplication method computes ${\beta}{\cdot}F{\cdot}G$ instead of $F{\cdot}G$ with some ${\beta}$ ${\in}$ $F^*_{2n}$ because ${\beta}$ is eliminated by the final exponentiation of the ${\eta}_T$ pairing computation. The proposed multiplication method asymptotically requires only 7 multiplications in $F_{2^n}$ as n ${\rightarrow}$ ${\infty}$, while the cost of the previously fastest Karatsuba method is 9 multiplications in $F_{2^n}$. Consequently, the cost of the ${\eta}_T$ pairing computation is reduced by 14.3%.