• 제목/요약/키워드: Decomposing

검색결과 506건 처리시간 0.035초

Isolation, Identification, and Expression of Microbial Cellulases from the Gut of Odontotermes formosanus

  • Duan, Jiwei;Liu, Jun;Ma, Xueling;Zhang, Yue;Wang, Xiaohua;Zhao, Kai
    • Journal of Microbiology and Biotechnology
    • /
    • 제27권1호
    • /
    • pp.122-129
    • /
    • 2017
  • Termites are destructive to agriculture, forestry, and buildings, but they can also promote agro-ecosystem balance through the degradation of lignocellulose. Termite-triggered cellulose digestion may be clarified through microbial metabolism of cellulose products. In the present study, we characterized the activities of cellulase and its three components synthesized by the cellulase-producing fungal strain HDZK-BYTF620 isolated from the gut of Odontotermes formosanus. The protein components of cellulases were synthesized by strain HDZK-BYTF620, which were isolated and characterized using polyacrylamide gel electrophoresis, and the expression of the cellulases was studied at the proteome level.

Defect Estimation of a Crack in Underground Pipelines by CMFL Type NDT System

  • Kim, Hui Min;Park, Gwan Soo
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권6호
    • /
    • pp.2218-2223
    • /
    • 2014
  • A crack which is axially oriented with small size is hard to detect in conventional system. CMFL(Circumferential Magnetic Flux Leakage) type PIG(Pipelines Inspection Gauge) in the NDT(Nondestructive Testing), is operated to detect this defect called axially oriented cracks in the pipe. It is necessary to decompose the size and shapes of cracks for the maintenance of underground pipelines. This article is mainly focused on the decomposing method of the size and shape of the axially oriented cracks by using inspection signal data for defect.

수정(修正)된 다중선택(多重選択) 배낭문제(背囊問題)의 해법(解法)에 관한 연구(硏究) (A Study on the Modified Multiple Choice Knapsack Problem)

  • 원중연;정성진
    • 대한산업공학회지
    • /
    • 제9권2호
    • /
    • pp.3-8
    • /
    • 1983
  • The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

  • PDF

On elastic and plastic length scales in strain gradient plasticity

  • Liu, Jinxing;Wang, Wen;Zhao, Ziyu;Soh, Ai Kah
    • Structural Engineering and Mechanics
    • /
    • 제61권2호
    • /
    • pp.275-282
    • /
    • 2017
  • The Fleck-Hutchinson theory on strain gradient plasticity (SGP), proposed in Adv. Appl Mech 33 (1997) 295, has recently been reformulated by adopting the strategy of decomposing the second order strain presented by Lam et al. in J Mech Pays Solids 51 (2003) 1477. The newly built SGP satisfies the non negativity of plastic dissipation, which is still an outstanding issue in other SGP theories. Furthermore, it explicitly shows how elastic strain gradients and corresponding elastic characteristic length scales come into play in general elastic-plastic loading histories. In this study, the relation between elastic length scales and plastic length scales is investigated by taking wire torsion as an example. It is concluded that the size effects arising when two sets of length scales are of the same order are essentially elastic instead of plastic.

Recovering Incomplete Data using Tucker Model for Tensor with Low-n-rank

  • Thieu, Thao Nguyen;Yang, Hyung-Jeong;Vu, Tien Duong;Kim, Sun-Hee
    • International Journal of Contents
    • /
    • 제12권3호
    • /
    • pp.22-28
    • /
    • 2016
  • Tensor with missing or incomplete values is a ubiquitous problem in various fields such as biomedical signal processing, image processing, and social network analysis. In this paper, we considered how to reconstruct a dataset with missing values by using tensor form which is called tensor completion process. We applied Tucker factorization to solve tensor completion which was built base on optimization problem. We formulated the optimization objective function using components of Tucker model after decomposing. The weighted least square matric contained only known values of the tensor with low rank in its modes. A first order optimization method, namely Nonlinear Conjugated Gradient, was applied to solve the optimization problem. We demonstrated the effectiveness of the proposed method in EEG signals with about 70% missing entries compared to other algorithms. The relative error was proposed to compare the difference between original tensor and the process output.

최소 면적의 CMOS 기능셀 설계도면을 찾는 휴리스틱 알고리즘 (A Heuristic Algorithm for Minimal Area CMOS Cell Layout)

  • 권용준;경종민
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1463-1466
    • /
    • 1987
  • The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

  • PDF

Wavelet-based Feature Extraction Algorithm for an Iris Recognition System

  • Panganiban, Ayra;Linsangan, Noel;Caluyo, Felicito
    • Journal of Information Processing Systems
    • /
    • 제7권3호
    • /
    • pp.425-434
    • /
    • 2011
  • The success of iris recognition depends mainly on two factors: image acquisition and an iris recognition algorithm. In this study, we present a system that considers both factors and focuses on the latter. The proposed algorithm aims to find out the most efficient wavelet family and its coefficients for encoding the iris template of the experiment samples. The algorithm implemented in software performs segmentation, normalization, feature encoding, data storage, and matching. By using the Haar and Biorthogonal wavelet families at various levels feature encoding is performed by decomposing the normalized iris image. The vertical coefficient is encoded into the iris template and is stored in the database. The performance of the system is evaluated by using the number of degrees of freedom, False Reject Rate (FRR), False Accept Rate (FAR), and Equal Error Rate (EER) and the metrics show that the proposed algorithm can be employed for an iris recognition system.

A modified multidisciplinary feasible formulation for MDO using integrated coupled approximate models

  • Choi, Eun-Ho;Cho, Jin-Rae;Lim, O-Kaung
    • Structural Engineering and Mechanics
    • /
    • 제52권1호
    • /
    • pp.205-220
    • /
    • 2014
  • This paper is concerned with the modification of multidisciplinary feasible formulation for MDO problems using the integrated coupled approximate models. A drawback of conventional MDFs is the numerical difficulty in decomposing the design variables and deriving the coupled equations of state. To overcome such a drawback of conventional methods, the coupling in analysis and design is resolved by approximating the state variables in each discipline by the response surface method and by modifying the optimization formulation using the corresponding integrated coupled approximate models. The validity, reliability and effectiveness of the proposed method are illustrated and verified through two optimization problems, a mathematical MDF problem and the multidisciplinary optimum design of suspension unit of wheeled armored vehicle.

다중해상도 알고리즘을 이용한 자동 해석모델 생성 (Automatic Generation of Analysis Model Using Multi-resolution Modeling Algorithm)

  • 김민철;이건우;김성찬
    • 한국CDE학회논문집
    • /
    • 제11권3호
    • /
    • pp.172-182
    • /
    • 2006
  • This paper presents a method to convert 3D CAD model to an appropriate analysis model using wrap-around, smooth-out and thinning operators that have been originally developed to realize the multi-resolution modeling. Wrap-around and smooth-out operators are used to simplify 3D model, and thinning operator is to reduce the dimension of a target object with simultaneously decomposing the simplified 3D model to 1D or 2D shapes. By using the simplification and dimension-reduction operations in an appropriate way, the user can generate an analysis model that matches specific applications. The advantage of this method is that the user can create optimized analysis models of various simplification levels by selecting appropriate number of detailed features and removing them.

임의의 1 차원 신호의 최소 위상 신호화와 2차원 위상복원문제에의 응용 (Enforcing minimum-phase conditions on an arbitrry one-dimensional signal and its application ot two-dimensional phase retrieval problem)

  • 김우식
    • 전자공학회논문지S
    • /
    • 제34S권1호
    • /
    • pp.105-114
    • /
    • 1997
  • The phase retrieval problem is concerned with the reconstruction of a signal or its fourier transform phase form the fourier transform magnitude of the signal. This problem does not have a unique solution, in general. If, however, the desired signal is minimum-phase, then it can be decided uniquely. This paper shows that we can make a minimum-phase signal by adding a delta function having a large value at the origin of an arbitrary one-dimensional signal, and a two-dimensional signal can be uniquely specified from its fourier transform magnitude if it is added by a delta function having a large value at the origin, and finally we can solve a two-dimensional phase retrieval problem by decomposing it into several ine-dimensional phase retrieval problems.

  • PDF