• Title/Summary/Keyword: Combinatorial method

Search Result 226, Processing Time 0.027 seconds

Design of Interleaved Thinned Planar Arrays Using Cyclic Difference Set (Cyclic Difference Set을 이용한 Interleaved Thinned 평면 배열 설계)

  • Kwon, Gina;Hwang, Keum Cheol;Park, Joon-Young;Kim, Seon-Joo;Kim, Dong-Hwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.12
    • /
    • pp.1351-1358
    • /
    • 2012
  • In this paper, an analytical technique is proposed for the design of interleaved thinned planar array with well-behaved and predictable sidelobes. The interleaved arrays are composed of thinned planar subarrays based on cyclic difference sets(DSs). Becauce sidelobes of thinned planar subarrays based on DS are predictable by DS parameters, the subarrays exhibit very similar sidelobe levels by utilizing DS and complementary DS with similar autocorrelations each other. The combinatorial method also allows the design of interleaved placements with simultaneously optimum peak sidelobe levels(PSLs) of subarrays using cyclic shift-a property of DSs. The optimized PSLs of the interleaved array are -12.47 dB and -10.34 dB.

Investigating the Morphology and Kinetics of Three-Dimensional Neuronal Networks on Electro-Spun Microstructured Scaffolds

  • Kim, Dongyoon;Kim, Seong-Min;Kang, Donghee;Baek, Goeun;Yoon, Myung-Han
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2013.08a
    • /
    • pp.277.2-277.2
    • /
    • 2013
  • Petri dishes and glass slides have been widely used as general substrates for in vitro mammalian cell cultures due to their culture viability, optical transparency, experimental convenience, and relatively low cost. Despite the aforementioned benefit, however, the flat two-dimensional substrates exhibit limited capability in terms of realistically mimicking cellular polarization, intercellular interaction, and differentiation in the non-physiological culture environment. Here, we report a protocol of culturing embryonic rat hippocampal neurons on the electro-spun polymeric network and the results from examination of neuronal cell behavior and network formation on this culture platform. A combinatorial method of laser-scanning confocal fluorescence microscopy and live-cell imaging technique was employed to track axonal outgrowth and synaptic connectivity of the neuronal cells deposited on this model culture environment. The present microfiber-based scaffold supports the prolonged viability of three-dimensionally-formed neuronal networks and their microscopic geometric parameters (i.e., microfiber diameter) strongly influence the axonal outgrowth and synaptic connection pattern. These results implies that electro-spun fiber scaffolds with fine control over surface chemistry and nano/microscopic geometry may be used as an economic and general platform for three-dimensional mammalian culture systems, particularly, neuronal lineage and other network forming cell lines.

  • PDF

Greedy-based Neighbor Generation Methods of Local Search for the Traveling Salesman Problem

  • Hwang, Junha;Kim, Yongho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.9
    • /
    • pp.69-76
    • /
    • 2022
  • The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.

Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved (전역 최적 경로가 향상되지 않는 반복 탐색 횟수를 고려한 개미 집단 시스템)

  • Lee, Seung-Gwan;Lee, Dae-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.9-15
    • /
    • 2009
  • Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

Exploring Efficient Solutions for the 0/1 Knapsack Problem

  • Dalal M. Althawadi;Sara Aldossary;Aryam Alnemari;Malak Alghamdi;Fatema Alqahtani;Atta-ur Rahman;Aghiad Bakry;Sghaier Chabani
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.2
    • /
    • pp.15-24
    • /
    • 2024
  • One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

Tryptophan-Based Hyperproduction of Bioindigo by Combinatorial Overexpression of Two Different Tryptophan Transporters

  • Hyun Jin Kim;Sion Ham;Nara-Shin;Jeong Hyeon Hwang;Suk Jin Oh;Tae-Rim Choi;Jeong Chan Joo;Shashi Kant Bhatia;Yung-Hun Yang
    • Journal of Microbiology and Biotechnology
    • /
    • v.34 no.4
    • /
    • pp.969-977
    • /
    • 2024
  • Indigo is a valuable, natural blue dye that has been used for centuries in the textile industry. The large-scale commercial production of indigo relies on its extraction from plants and chemical synthesis. Studies are being conducted to develop methods for environment-friendly and sustainable production of indigo using genetically engineered microbes. Here, to enhance the yield of bioindigo from an E. coli whole-cell system containing tryptophanase (TnaA) and flavin-containing monooxygenase (FMO), we evaluated tryptophan transporters to improve the transport of aromatic compounds, such as indole and tryptophan, which are not easily soluble and passable through cell walls. Among the three transporters, Mtr, AroP, and TnaB, AroP enhanced indigo production the most. The combination of each transporter with AroP was also evaluated, and the combination of AroP and TnaB showed the best performance compared to the single transporters and two transporters. Bioindigo production was then optimized by examining the culture medium, temperature, isopropyl β-D-1-thiogalactopyranoside concentration, shaking speed (rpm), and pH. The novel strain containing aroP and tnaB plasmid with tnaA and FMO produced 8.77 mM (2.3 g/l) of bioindigo after 66 h of culture. The produced bioindigo was further recovered using a simple method and used as a watercolor dye, showing good mixing with other colors and color retention for a relatively long time. This study presents an effective strategy for enhancing indigo production using a combination of transporters.

Screening of Eu3+-and Tb3+-Activated Phosphors for PDP in the System of CaO-Gd2O3-Al2O3 (CaO-Gd2O3-Al2O3계에서의 PDP용 Eu3+와 Tb3+ 활성 형광체의 탐색)

  • Park, Sang-Mi;Kim, Chang-Hae;Park, Hui-Dong;Jang, Ho-Gyeom;Park, Jun-Taek
    • Journal of the Korean Chemical Society
    • /
    • v.46 no.4
    • /
    • pp.336-345
    • /
    • 2002
  • In this study, we have screened $Eu^{3+}$- and $Tb^{3+}$-activated candidate phosphors for PDP in the sys-tems of CaO-Gd$_2$O$_3$-Al$_2$O$_3$ by combinatorial chemistry and investigated the synthetic temperature, optimum com-position and luminescent properties about the candidate phosphors. To construct the emission intensity library by VUV PL, we have synthesized 210 different compositional samples using a polymerized-complex method. Good luminescent samples were identified by X-ray diffraction method. $Ca_$\alpha$$G$d_{0.95-$\alpha$-$\beta$}Al_$\beta$O_$\delta$$ : Eu(0.02< $\alpha$+$\beta$ <0.04) phos-phors screened as a red phosphor have good color purity than commercial phosphor. In the candidate phosphors of CaGdAl$_3O_7$ : Tb, Ca$Al_{12}O_{19}$ : Tb, Gd$_4$Al$_2O_9$ : Tb, and Gd$_3Al_5O_{12}$ : Tb CaGdAl$_3O_7$ : Tb, and Ca$Al_{12}O_{19}$ : Tb have shorter decay time than commercial phosphor.

FCAnalyzer: A Functional Clustering Analysis Tool for Predicted Transcription Regulatory Elements and Gene Ontology Terms

  • Kim, Sang-Bae;Ryu, Gil-Mi;Kim, Young-Jin;Heo, Jee-Yeon;Park, Chan;Oh, Berm-Seok;Kim, Hyung-Lae;Kimm, Ku-Chan;Kim, Kyu-Won;Kim, Young-Youl
    • Genomics & Informatics
    • /
    • v.5 no.1
    • /
    • pp.10-18
    • /
    • 2007
  • Numerous studies have reported that genes with similar expression patterns are co-regulated. From gene expression data, we have assumed that genes having similar expression pattern would share similar transcription factor binding sites (TFBSs). These function as the binding regions for transcription factors (TFs) and thereby regulate gene expression. In this context, various analysis tools have been developed. However, they have shortcomings in the combined analysis of expression patterns and significant TFBSs and in the functional analysis of target genes of significantly overrepresented putative regulators. In this study, we present a web-based A Functional Clustering Analysis Tool for Predicted Transcription Regulatory Elements and Gene Ontology Terms (FCAnalyzer). This system integrates microarray clustering data with similar expression patterns, and TFBS data in each cluster. FCAnalyzer is designed to perform two independent clustering procedures. The first process clusters gene expression profiles using the K-means clustering method, and the second process clusters predicted TFBSs in the upstream region of previously clustered genes using the hierarchical biclustering method for simultaneous grouping of genes and samples. This system offers retrieved information for predicted TFBSs in each cluster using $Match^{TM}$ in the TRANSFAC database. We used gene ontology term analysis for functional annotation of genes in the same cluster. We also provide the user with a combinatorial TFBS analysis of TFBS pairs. The enrichment of TFBS analysis and GO term analysis is statistically by the calculation of P values based on Fisher’s exact test, hypergeometric distribution and Bonferroni correction. FCAnalyzer is a web-based, user-friendly functional clustering analysis system that facilitates the transcriptional regulatory analysis of co-expressed genes. This system presents the analyses of clustered genes, significant TFBSs, significantly enriched TFBS combinations, their target genes and TFBS-TF pairs.

Comparison of Association Rule Learning and Subgroup Discovery for Mining Traffic Accident Data (교통사고 데이터의 마이닝을 위한 연관규칙 학습기법과 서브그룹 발견기법의 비교)

  • Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.1-16
    • /
    • 2015
  • Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

Augmented Plasticity: Giving Morphological Editability to Physical Objects (증강가소성: 물리적 오브젝트에 형태적 편집가능성 부여하기)

  • Lee, Woo-Hun;Kang, Hye-Kyoung
    • Archives of design research
    • /
    • v.19 no.1 s.63
    • /
    • pp.225-234
    • /
    • 2006
  • Product designers sketch various ideas of foreground figures(detail design) onto background figures(basic form) and evaluate numerous combinations of them in the late stages of design process. Designers have to test their ideas elaborately with a high-fidelity physical model that looks like a real product. However, due to the requirements of time and expense in making high-fidelity design models, it is impossible to evaluate such a number of combinatorial solutions of background and foreground figures. Contrary to digital models, physical design models are not easily modifiable and so designers cannot easily develope ideas through iterative design-evaluation process. To address these problems, we proposed a new concept 'Augmented Plasticity' that gives morphological editability to a rigid physical object using Augmented Reality technology and implemented the idea as Digital Skin system. Digital Skin system figures out the position and orientation of object surface with ARToolKit visual marker and superimposes a deformed surface image seamlessly using differential rendering method. We tried to apply Digital Skin system to detail design, redesign of product, and material exploration task. In consequence, it was found that Digital Skin system has potential to allow designers to implement and test their ideas very efficiently in the late stages of design process.

  • PDF