• Journal of Microbiology and Biotechnology
• /
• v.3 no.3
• /
• pp.146-155
• /
• 1993

A DNA fragment from an alkali-tolerent Bacillus sp., conferring strong promoter activity, was subcloned into the promoter probe plasmid pPL703 and the nucleotide sequence of this promoter region was determined. The sequence analysis suggested that this highly efficient promoter region containing the complex clustered promoters comprised three kinds of promoters (P1, P2 and P3), which are transcribed by $\sigma^B (formerly \sigma^{37}), \sigma^E(formerly \sigma^{29}) and \sigma^A (formerly \sigma^{43})$ RNA polymerase holoenzymes which play major rules at the onset of endospore formation, during sporulation and at the vegetative phase of growth, respectively. S1 nuclease mapping experiments showed that all three promoters had staggered transcription initiation points. The results of chloramphenicol acetyltransferase assay after the subcloning experiments also indicated that the expression of these clustered promoters was correlated with the programs of growth and endospore development. Promoter P1, P2 and P3 were preceded by 75% AT, 79% AT and 81% AT regions, respectively, and a partial deletion of AT-rich region prevented transcription from promoter P1 in vivo. Two sets of 5 -AGTGTT-3 sequences and inverted repeat sequences located around the promoter P1 were speculated as the possible cis acting sites for the catabolite repression in B. subtilis. In vivo transcripts from these sequence regions may be able to form a secondary structure, however, the possibility that a regulatory protein induced by the excess amount of glucose could be bound to such a domain for crucial action remains to be determined.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2001.10a
• /
• pp.165-196
• /
• 2001

DNA chip 또는 microarray는 다수의 유전자 또는 유전자 조각을 (보통 수천내지 수만 개)칩상에 고정시켜 놓고 DNA hybridization 반응을 이용하여 유전자들의 발현 양상을 분석할 수 있는 기술이다. 이러한 high-throughput기술은 예전에는 생각하지 못했던 여러가지 분자생물학의 문제에 대한 해답을 제시해 줄 수 있을 뿐 만 아니라, 분자수준에서의 질병 진단, 신약 개발, 환경 오염 문제의 해결 등 그 응용 가능성이 무한하다. 이 기술의 실용적인 적용을 위해서는 DNA chip을 제작하기 위한 하드웨어/웻웨어 기술 외에도 이러한 데이터로부터 최대한 유용하고 새로운 지식을 창출하기 위한 bioinformatics 기술이 핵심이라고 할 수 있다. 유전자 발현 패턴을 데이터마이닝하는 문제는 크게 clustering, classification, dependency analysis로 구분할 수 있으며 이러한 기술은 통계학과인공지능 기계학습에 기반을 두고 있다. 주로 사용된 기법으로는 principal component analysis, hierarchical clustering, k-means, self-organizing maps, decision trees, multilayer perceptron neural networks, association rules 등이다. 본 세미나에서는 이러한 기본적인 기계학습 기술 외에 최근에 연구되고 있는 새로운 학습 기술로서 probabilistic graphical model (PGM)을 소개하고 이를 DNA chip 데이터 분석에 응용하는 연구를 살펴본다. PGM은 인공신경망, 그래프 이론, 확률 이론이 결합되어 형성된 기계학습 모델로서 인간 두뇌의 기억과 학습 기작에 기반을 두고 있으며 다른 기계학습 모델과의 큰 차이점 중의 하나는 generative model이라는 것이다. 즉 일단 모델이 만들어지면 이것으로부터 새로운 데이터를 생성할 수 있는 능력이 있어서, 만들어진 모델을 검증하고 이로부터 새로운 사실을 추론해 낼 수 있어 biological data mining 문제에서와 같이 새로운 지식을 발견하는 exploratory analysis에 적합하다. 또한probabilistic graphical model은 기존의 신경망 모델과는 달리 deterministic한의사결정이 아니라 확률에 기반한 soft inference를 하고 학습된 모델로부터 관련된 요인들간의 인과관계(causal relationship) 또는 상호의존관계(dependency)를 분석하기에 적합한 장점이 있다. 군체적인 PGM 모델의 예로서, Bayesian network, nonnegative matrix factorization (NMF), generative topographic mapping (GTM)의 구조와 학습 및 추론알고리즘을소개하고 이를 DNA칩 데이터 분석 평가 대회인 CAMDA-2000과 CAMDA-2001에서 사용된cancer diagnosis 문제와 gene-drug dependency analysis 문제에 적용한 결과를 살펴본다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.4 s.22
• /
• pp.69-76
• /
• 2002

Nowadays information is very important for Civil Engineering. This information is acquiredmostly via Surveying & Geo-spatial Information System. Also this information is close to the ITS(Intelligent Transformation System), Navigation, Facility Management, and Digital Mapping, etc and applicable to versatile fields from now on. And in surveying fields, GPS satellites are introduced newly and play a great rules. In this study, RTK(Real-Time Kinematic GPS), one of the positioning technology with GPS satellites, is used for the production of Plane Figure of Campus. The results shows that it is possible to extract the information for some part of a flowerbed and road, but not so for the buildings surrounded. Therefore this give occasion to the a lowering of work effectiveness over the total work-flow. So at such a time, it will be expected that the supplementary systems such TS(Total Station), Plane-table, and theodolite, etc have to be used.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.131-144
• /
• 2012

MDD is suitable to satisfy constraints of development of mobile applications. So, there are various studies about applying MDD to the developments of mobile application but systematic development methods about UML profile for PIM/PSM of mobile applications and model transformation techniques are needed. This paper suggests that a development technique about UML profile for PIM/PSM of mobile applications and a model transformation techniques with the profiles. We classify stereotypes by the characteristics of mobile application to compose profiles and suggest development guidelines of profiles for PIM/PSM. On the suggested model transformation process, the PIM with the profiles is transformed to the intial PSM with the mapping rules and the PSM is transformed to the refined PSM with templates which reflected detailed information of a mobile platform. We developed a location based service mobile application with the suggested techniques on the Android platform and compared with other techniques to validate usefulness of the suggested techniques.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2000

Model checking is a formal verification technique which checks the consistency between a requirement specification and a behavior model of the system by explorating the state space of the model. We apply model checking to the formal verification of the concurrent object-oriented system, using an existing model checker SPIN which has been successful in verifying concurrent systems. First, we propose an Actor-based modeling language, called APromela, by extending the modeling language Promela which is a modeling language supported in SPIN. APromela supports not only all the primitives of Promela, but additional primitives needed to model concurrent object-oriented systems, such as class definition, object instantiation, message send, and synchronization.Second, we provide translation rules for mapping APromela's such modeling primitives to Promela's. As an application of APromela, we suggest a verification method for UML models. By giving an example of specification, translation, and verification, we also demonstrate the applicability of our proposed approach, and discuss the limitations and further research issues.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2047-2058
• /
• 2007

The business environment of enterprises could be difficult to obviate redundancy to filtrate data source occurred on data integrated to standard rules and meta-data and to produce integration of data and single viewer in geographical and spatial distributed environment. Specially, To can interchange various data from a heterogeneous system or various applications without types and forms and synchronize continually exactly integrated information#s is of paramount concern. Therefore data hub system based on SQL/XMDR message to overcome a problem of meaning interoperability occurred on exchanging or jointing between each legacy systems are proposed in this paper. This system use message mapping technique of query transform system to maintain data modified in real-time on cooperating data. It can consistently maintain data modified in realtime on exchanging or jointing data for cooperating legacy systems, it improve clarity and availability of data by providing a single interface on data retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.107-114
• /
• 2022

Delegation is a powerful mechanism that allocates access rights to users to provide flexible and dynamic access control decisions. It is also particularly useful in a distributed environment. Among the representative delegation models, the RBDM0 and RDM2000 models are role delegation as the user to user delegation. However, In RBAC, the concept of inheritance of the role class is not well harmonized with the management rules of the actual corporate organization. In this paper, we propose an Adding Attributes on Permission-Based Delegation Model (ABDM) that guarantees the permanence of delegated permissions. It does not violate the separation of duty and security principle of least privilege. ABDM based on RBAC model, supports both the role to role and user to user delegation with an attribute. whenever the delegator wants the permission can be withdrawn, and A delegator can give permission to a delegatee.

• Journal of the Korean Society for Library and Information Science
• /
• v.47 no.3
• /
• pp.119-137
• /
• 2013

This study was to compare the description of content types(content forms) and media types of RDA and ISBD in order to revise GMD of KCR4. Test and survey were conducted as the research methods for comparing content types and media types description of RDA and ISBD. As a result, RDA content types description is better than ISBD in aspects of uniformity and correct rates. Especially, detailed list of content types in RDA could make the resources to be expressed completely, but content forms with adding the content qualification in ISBD could make the resource to be expressed with many errors. Therefore, there were some considerations to describe content types. First, content types terms in RDA need to be specified more. Second, some detailed rules need to be regulated on the combination of content qualification of ISBD. Third, the mapping tables between RDA content types and ISBD content forms need to be revised. Fourth, RDA content types list will be more applicable in KCR4 based on the uniformity and correct rates in the test. This study will contribute to analyze and suggest RDA and ISBD terms list of content types and media types for KCR4.

• Investigative Magnetic Resonance Imaging
• /
• v.6 no.2
• /
• pp.137-146
• /
• 2002

Purpose : This paper introduces an improved classification approach which adopts a deterministic relaxation method and an agglomerative clustering technique for the classification of MRI using neural network. The proposed approach can solve the problems of convergency to local optima and computational burden caused by a large number of input patterns when a neural network is used for image classification. Materials and methods : Application of Hopfield neural network has been solving various optimization problems. However, major problem of mapping an image classification problem into a neural network is that network is opt to converge to local optima and its convergency toward the global solution with a standard stochastic relaxation spends much time. Therefore, to avoid local solutions and to achieve fast convergency toward a global optimization, we adopt MFA to a Hopfield network during the classification. MFA replaces the stochastic nature of simulated annealing method with a set of deterministic update rules that act on the average value of the variable. By minimizing averages, it is possible to converge to an equilibrium state considerably faster than standard simulated annealing method. Moreover, the proposed agglomerative clustering algorithm which determines the underlying clusters of the image provides initial input values of Hopfield neural network. Results : The proposed approach which uses agglomerative clustering and deterministic relaxation approach resolves the problem of local optimization and achieves fast convergency toward a global optimization when a neural network is used for MRI classification. Conclusion : In this paper, we introduce a new paradigm to classify MRI using clustering analysis and deterministic relaxation for neural network to improve the classification results.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1219-1229
• /
• 1999

일반적으로 AND, OR, NOT과 같은 연산자를 사용하는 불리언 질의는 사용자의 검색의도를 정확하게 표현할 수 있기 때문에 검색 전문가들은 불리언 질의를 사용하여 높은 검색성능을 얻는다고 알려져 있지만, 일반 사용자는 자신이 원하는 정보를 불리언 형태로 표현하는데 익숙하지 않다. 본 논문에서는 검색성능의 향상과 사용자 편의성을 동시에 만족하기 위하여 사용자의 자연어 질의를 확장 불리언 질의로 자동 변환하는 방법론을 제안한다. 먼저 자연어 질의를 범주문법에 기반한 구문분석을 수행하여 구문트리를 생성하고 연산자 및 키워드 정보를 추출하여 구문트리를 간략화한다. 다음으로 간략화된 구문트리로부터 명사구를 합성하고 키워드들에 대한 가중치를 부여한 후 불리언 질의를 생성하여 검색을 수행한다. 또한 구문분석의 오류로 인한 검색성능 저하를 최소화하기 위하여 상위 N개 구문트리에 대해 각각 불리언 질의를 생성하여 검색하는 N-BEST average 방법을 제안하였다. 정보검색 실험용 데이타 모음인 KTSET2.0으로 실험한 결과 제안된 방법은 수동으로 추출한 불리언 질의보다 8% 더 우수한 성능을 보였고, 기존의 벡터공간 모델에 기반한 자연어질의 시스템에 비해 23% 성능향상을 보였다. Abstract There have been a considerable evidence that trained users can achieve a good search effectiveness through a boolean query because a structural boolean query containing operators such as AND, OR, and NOT can make a more accurate representation of user's information need. However, it is not easy for ordinary users to construct a boolean query using appropriate boolean operators. In this paper, we propose a boolean query formulation method that automatically transforms a user's natural language query into a extended boolean query for both effectiveness and user convenience. First, a user's natural language query is syntactically analyzed using KCCG(Korean Combinatory Categorial Grammar) parser and resulting syntactic trees are structurally simplified using a tree-simplifying mechanism in order to catch the logical relationships between keywords. Next, in a simplified tree, plausible noun phrases are identified and added into the same tree as new additional keywords. Finally, a simplified syntactic tree is automatically converted into a boolean query using some mapping rules and linguistic heuristics. We also propose an N-BEST average method that uses top N syntactic trees to compensate for bad effects of single incorrect top syntactic tree. In experiments using KTSET2.0, we showed that a proposed method outperformed a traditional vector space model by 23%, and surprisingly manually constructed boolean queries by 8%.