• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.923-928
• /
• 1993

Genetic algorithms are powerful optimization methods based on the mechanism of natural genetics and natural selection. Genetic algorithms reduce chance of searching local optima unlike most conventional search algorithms and especially show good performances in complex nonlinear optimization problems because they do not require any information except objective function value. This paper presents a new model based on sexual reproduction in nature. In the proposed Sexual Reproduction model(SR model), individuals consist of the diploid of chromosomes, which are artificially coded as binary string in computer program. The meiosis is modeled to produce the sexual cell(gamete). In the artificial meiosis, crossover between homologous chromosomes plays an essential role for exchanging genetic informations. We apply proposed SR model to optimization of the design parameters of Single-sided Linear Induction Motor(SLIM). Sequential Unconstrained Minimization Technique(SUMT) is used to transform the nonlinear optimization problem with many constraints of SLIM to a simple unconstrained problem, We perform optimal design of SLIM available to FA conveyer systems and discuss its results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.133-148
• /
• 2005

Since understanding of similarities and differences among protein structures is very important for the study of the relationship between structure and function, many protein structure comparison systems have been developed. Hut, unfortunately, these systems introduce their own protein data derived from the PDB(Protein Data Bank), which are needed in their algorithms for comparing protein structures. In addition, according to the rapid increase in the size of PDB, these systems require much more computation to search for common substructures in their databases. In this paper, we introduce a protein structure comparison system named WS4E(A Web-Based Searching Substructures of Secondary Structure Elements) based on a PSAML database which stores PSAML documents using the eXist open XML DBMS. PSAML(Protein Structure Abstraction Markup Language) is an XML representation of protein data, describing a protein structure as the secondary structures of the protein and their relationships. Using the PSAML database, the WS4E provides web services searching for common substructures among proteins represented in PSAML. In addition, to reduce the number of candidate protein structures to be compared in the PSAML database, we used topology strings which contain the spatial information of secondary structures in a protein.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.2
• /
• pp.499-503
• /
• 2024

Broadcasting programs are provided to various media such as Internet replay, OTT, and IPTV services as well as self-broadcasting. In this case, it is very important to provide keywords for search that represent the characteristics of the content well. Broadcasters mainly use the method of manually entering key keywords in the production process and the archive process. This method is insufficient in terms of quantity to secure core metadata, and also reveals limitations in recommending and using content in other media services. This study supports securing a large number of metadata by utilizing closed caption data pre-archived through the DTV closed captioning server developed in EBS. First, core metadata was automatically extracted by applying Google's natural language AI technology. The next step is to propose a method of finding core metadata by reflecting priorities and content characteristics as core research contents. As a technology to obtain differentiated metadata weights, the importance was classified by applying the TF-IDF calculation method. Successful weight data were obtained as a result of the experiment. The string metadata obtained by this study, when combined with future string similarity measurement studies, becomes the basis for securing sophisticated content recommendation metadata from content services provided to other media.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.8
• /
• pp.4553-4557
• /
• 2013

Objective: The purpose of this study was to identify genes related to bladder cancer with samples from normal and disease cases by microarray chip. Methods: After downloading the gene expression profile GSE3167 from Gene Expression Omnibus database which includes 50 bladder samples, comprising 9 normal and 41 disease samples, differentially expressed genes were identified with packages in R language. The selected differentially expressed genes were further analyzed using bioinformatics methods. Firstly, molecular functions, biological processes and cell component analysis were researched by software Gestalt. Then, software String was used to search interaction relationships among differentially expressed genes, and hub genes of the network were selected. Finally, by using plugins of software Cytoscape, Mcode and Bingo, module analysis of hub-genes was performed. Results: A total of 221 genes were identified as differentially expressed by comparing normal and disease bladder samples, and a network as well as the hub gene C1QBP was obtained from the network. The C1QBP module had the closest relationship to production of molecular mediators involved in inflammatory responses. Conclusion: We obtained differentially expressed genes of bladder cancer by microarray, and both PRDX2 and YWHAZ in the module with hub gene C1QBP were most significantly related to production of molecular mediators involved in inflammatory responses. From knowledge of inflammatory responses and cancer, our results showed that, the hub gene and its module could induce inflammation in bladder cancer. These related genes are candidate bio-markers for bladder cancer diagnosis and might be helpful in designing novel therapies.

• Asian-Australasian Journal of Animal Sciences
• /
• v.17 no.3
• /
• pp.309-312
• /
• 2004

We performed exon trapping in order to locate functional genes on chicken chromosomes (GGA) and to identify functional gene sequences from chicken cosmids. Sequence analysis of 100 clones revealed 17 putative exons, five of which were identified with known sequences in a gene database search: thymopoietin beta (TMPO), U5 snRNP-specific 40 kDa protein (HPRP8BP), dihydropyridine receptor alpha 1 subunit (CACNL1A3), cystein string protein (CPS) and C15orf4. We attempted to map the genes to chicken chromosomes by using FISH and linkage analysis. The chromosomal localizations were GGA1 (TMPO), GGA10 (C15orf4), GGA23 (HPRP8BP) and GGA28 (CPS) by FISH and linkage analysis, while that of CACNL1A3 was predicted to be on a microchromosome by FISH but not by linkage analysis. Comparative mapping analyses between chickens and humans for the genes revealed both known and new synteny. The syntenic conservation between GGA1 and human chromosome (HSA) 12q23 (TMPO) and between GGA10 and HSA15q25 (C15orf4), were consistent with a recent publication, while two new syntenies were observed between GGA28 and HSA20q13.3 in CPS and between GGA23 and HSA1p34-35 in HPRP8BP. The information of presently mapped genes can contribute as anchor markers based on functional genes and the construction of a comparative map.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.3016-3022
• /
• 2013

In this paper, we propose a novel design and implementation method to detect musical plagiarism which can provide human experts evidences to decide plagiarism using cutting-edge information technologies and thereby can solve exhaustive disputes on cases of musical plagiarism when the cases are decided by human experts' emotional preferences. We first search digital music elements to analyze music source and examine how to use these in plagiarism analysis using IT techniques. Therefore we designed music plagiarism analysis system by using MusicString which is supported in JFugue and construct AST to manipulate music plagiarism analysis efficiently.

• Proceedings of the KIEE Conference
• /
• 2004.11b
• /
• pp.190-193
• /
• 2004

Optimal Power Flow (OPF) is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. So this paper presents parallel genetic algorithm-tap search for the solution of the OPF. The control variables modeled unit active power outputs, generator-bus voltage magnitudes and transformer-tap settings. A number of functional operating constraints, such as branch flow limits, load bus boltage magnitude limits and generator reactive capabilities are included as penalties in the fitness function. In parallel GA-TS, GA operators are executed for each process. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper three populations to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on an IEEE 30-bus system in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient for the OPF.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• Spatial Information Research
• /
• v.20 no.5
• /
• pp.99-109
• /
• 2012

Recently, due to the growth of social media and spread of smart-phone, the amount of data has considerably increased by full use of SNS (Social Network Service). According to it, the Big Data concept is come up and many researchers are seeking solutions to make the best use of big data. To maximize the creative value of the big data held by many companies, it is required to combine them with existing data. The physical and theoretical storage structures of data sources are so different that a system which can integrate and manage them is needed. In order to process big data, MapReduce is developed as a system which has advantages over processing data fast by distributed processing. However, it is difficult to construct and store a system for all key words. Due to the process of storage and search, it is to some extent difficult to do real-time processing. And it makes extra expenses to process complex event without structure of processing different data. In order to solve this problem, the existing Complex Event Processing System is supposed to be used. When it comes to complex event processing system, it gets data from different sources and combines them with each other to make it possible to do complex event processing that is useful for real-time processing specially in stream data. Nevertheless, unstructured data based on text of SNS and internet articles is managed as text type and there is a need to compare strings every time the query processing should be done. And it results in poor performance. Therefore, we try to make it possible to manage unstructured data and do query process fast in complex event processing system. And we extend the data complex function for giving theoretical schema of string. It is completed by changing the string key word into integer type with filtering which uses keyword set. In addition, by using the Complex Event Processing System and processing stream data at real-time of in-memory, we try to reduce the time of reading the query processing after it is stored in the disk.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.