• International Journal of Concrete Structures and Materials
• /
• v.6 no.3
• /
• pp.135-144
• /
• 2012

This article reviews the tailoring of engineered cementitious composites (ECC), a type of high performance fiber reinforced cementitious composites with a theoretical design basis, for special attributes or functions. The design basis, a set of analytic tools built on micromechanics, provides guidelines for tailoring of fiber, matrix, and fiber/matrix interfaces to attain tensile ductility in ECC. If conditions for controlled multiple cracking are disturbed by the need to introduce ingredients to attain a special attribute or function, micromechanics then serve as a systematic and rational means to efficiently recover composite tensile ductility. Three examples of ECCs with attributes of lightweight, high early strength, and self-healing functions, are used to illustrate these tailoring concepts. The fundamental approach, however, is broadly applicable to a wide variety of ECCs designed for targeted fresh and/or hardened characteristics required for specific applications.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.601-604
• /
• 1999

This Paper proposes the simple and efficient image retrieval algorithm using subregional texture features. In order to retrieve images in terms of its contents, it is required to obtain a precise segmentation. However, it is very difficult and takes a long computing time. Therefore. this paper proposes a simple segmentation method, which is to divide an image into high and low entropy regions by using Picture Information Measure (PIM). Also, in order to describe texture characteristics of each region, this paper suggest six different texture features produced on the basis of co-occurrence matrix. For an image retrieval system, a normalised correlation is adopted as a similarity function, which is not dependent on the range of each texture feature values. Finally, this proposed algorithm is applied to a various images and produces competitive results.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2851-2865
• /
• 2014

To improve the rate-distortion performance of distributed video compressive sensing (DVCS), the adaptive sparse basis and nonlocal similarity of video are proposed to jointly reconstruct the video signal in this paper. Due to the lack of motion information between frames and the appearance of some noises in the reference frames, the sparse dictionary, which is constructed using the examples directly extracted from the reference frames, has already not better obtained the sparse representation of the interpolated block. This paper proposes a method to construct the sparse dictionary. Firstly, the example-based data matrix is constructed by using the motion information between frames, and then the principle components analysis (PCA) is used to compute some significant principle components of data matrix. Finally, the sparse dictionary is constructed by these significant principle components. The merit of the proposed sparse dictionary is that it can not only adaptively change in terms of the spatial-temporal characteristics, but also has ability to suppress noises. Besides, considering that the sparse priors cannot preserve the edges and textures of video frames well, the nonlocal similarity regularization term has also been introduced into reconstruction model. Experimental results show that the proposed algorithm can improve the objective and subjective quality of video frame, and achieve the better rate-distortion performance of DVCS system at the cost of a certain computational complexity.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.3
• /
• pp.487-494
• /
• 2012

This paper discusses a method for getting a basis set of estimable functions of model parameters in a two-way fixed effects model. Since the fixed effects model has more parameters than those that can be estimated, model parameters are not estimable. So it is not possible to make inferences for nonestimable functions of parameters. When the assumed model of matrix notation is reparameterized by the estimable functions in a basis set, it also discusses how to use projections for the estimation of estimable functions.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.187-188
• /
• 2008

This paper presents a lattice reduction aided (LRA) MIMO receiver using dual basis. By reducing the basis of channel inversion matrix which directly boosts the noise power, the LRA-MIMO receiver using dual basis has better performance than that using primal basis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.4
• /
• pp.184-193
• /
• 2008

We examine the performance of genetic algorithms using binary encoding, with respect to a change of basis. Changing the basis can result in a change in the linkage structure inherent in the fitness function. We test three simple functions with differing linkage strengths and analyze the results. Based on an empirical analysis, we show that a better basis results in a smoother fitness landscape, hence genetic algorithms based on the new encoding method provide better performance.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.137-142
• /
• 2004

In this paper, we propose a new scheme for geometry coding of three-dimensional (3-D) mesh models using a fixed spectral basis. In order to code the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the 3-D mesh topology. After we partition a 3-D mesh model into several independent sub-meshes to reduce coding complexity, the mesh geometry information is projected onto the generated orthonormal bases which are the eigenvectors of the Laplacian matrix of the 3-D mesh. Finally, spectral coefficients are coded by a quantizer and a variable length coder. The proposed scheme can not only overcome difficulty of generating a fixed spectral basis, but also reduce coding complexity. Moreover, we can provide an efficient multi-resolution representation of 3-D meshes.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.128-147
• /
• 1991

We propose a dynamic incidence matrix (DIM) for reflecting states and time conditions of a timed Petri net (TPN) explicitly. Since a DIM consists of a conventional incidence matrix, two time-related vectors and two state-related vectors, we can get the advantages inherent in the conventional incidence matrix of describing a static structure of a system as well as another advantage of expressing time dependent state transitions. We introduce an algorithm providing the DIM with a state transition mechanism. Because the algorithm is, in fact, an algorithmic model for discrete event simulation of TPN models, we provide a theoretical basis of model transformation of a TPN model into a DEVS(Discrete Event system Specification) model. By executing the algorithm we can carry out performance analysis of computer communication protocols which are represented TPN models.

• Nuclear Engineering and Technology
• /
• v.33 no.5
• /
• pp.539-546
• /
• 2001

Systematic procedure of developing radionuclide release scenarios was established based on FEP list and Interaction Matrix for near-surface LILW repository. FEPs were screened by experts＇review in terms of domestic situation and combined into scenarios on the basis of Interaction Matrix analysis. Under the assumption of design scenario, The system domain was divided into three sections: Near-field, Far-field and Biosphere. Sub-scenarios for each section were developed, and then scenarios for entire system were built up with sub-scenarios of each section. Finally, sixteen design scenarios for near-surface repository were evaluated A reference scenario and other noteworthy scenarios were selected through experts＇scenario screening.