• Title/Summary/Keyword: combinatorial model

Search Result 100, Processing Time 0.027 seconds

Diagnosing Multiple Faults using Multiple Context Spaces (다중 상황공간을 이용한 다중 오류의 고장 진단)

  • Lee, Gye-Sung;Gwon, Gyeong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.137-148
    • /
    • 1997
  • Diagnostic problem solving is a major application area of knowledge-based systems research. However, most of the current approaches, both heuristic and model-based, are designed to identify single faults, and do not generalize easily to multiple fault diagnosis without exhibiting exponential behavior in the amount of computation required. In this paper, we employ a decomposition approach based on system configuration to generate an efficient algorithm for multiple fault diagnosis. The basic idea of the algorithm is to reduce the inherent combinatorial explosion that occurs in generating multiple faults by partitioning the circuit into groups that correspond to output measurement points. Rules are multiple faults by partitioning the circuit into groups that correspond to output measurement points. rules are developed for combining candidates from individual groups, and forming consistent sets of minimal candidates.

  • PDF

The Model to Generate Optimum Maintenance Scenario for Steel Bridges considering Life-Cycle Cost and Performance (강교량의 최적 유지관리 시나리오 선정 모델)

  • Park, Kyung Hoon;Lee, Sang Yoon;Kim, Jung Ho;Cho, Hyo Nam;Kong, Jung Sik
    • Journal of Korean Society of Steel Construction
    • /
    • v.18 no.6
    • /
    • pp.677-686
    • /
    • 2006
  • In this paper, a more practical and realistic method is proposed to establish the lifetime optimum maintenance strategies of the deteriorating bridges considering the life-cycle performance as well as life-cycle cost. The genetic algorithm is applied to generate the set of maintenance scenarios that is the multi-objective combinatorial optimization problem related to lifetime performance and cost as separate objective functions, and the technique to select optimum tradeoff maintenance scenario is presented. Optimum maintenance scenarios could be generated not only at the individual member level but also at the system level of the bridge. Through the analytical results of applying the proposed methodology to the existing bridge, it is expected that the methodology will be effectively used to determine the optimum maintenance strategy for introducing a real preventive maintenance system and overcoming the limits of existing maintenance methods.

GRASP Algorithm for Dynamic Weapon-Target Assignment Problem (동적 무장할당 문제에서의 GRASP 알고리즘 연구)

  • Park, Kuk-Kwon;Kang, Tae Young;Ryoo, Chang-Kyung;Jung, YoungRan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.12
    • /
    • pp.856-864
    • /
    • 2019
  • The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space (이산적 입지 공간의 경쟁적 입지 문제를 해결하기 위한 GIS 기반 기하학적 방법론 연구)

  • Lee, Gun-Hak
    • Journal of the Korean Geographical Society
    • /
    • v.46 no.3
    • /
    • pp.366-381
    • /
    • 2011
  • A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

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

Adaptive Learning Path Recommendation based on Graph Theory and an Improved Immune Algorithm

  • BIAN, Cun-Ling;WANG, De-Liang;LIU, Shi-Yu;LU, Wei-Gang;DONG, Jun-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2277-2298
    • /
    • 2019
  • Adaptive learning in e-learning has garnered researchers' interest. In it, learning resources could be recommended automatically to achieve a personalized learning experience. There are various ways to realize it. One of the realistic ways is adaptive learning path recommendation, in which learning resources are provided according to learners' requirements. This paper summarizes existing works and proposes an innovative approach. Firstly, a learner-centred concept map is created using graph theory based on the features of the learners and concepts. Then, the approach generates a linear concept sequence from the concept map using the proposed traversal algorithm. Finally, Learning Objects (LOs), which are the smallest concrete units that make up a learning path, are organized based on the concept sequences. In order to realize this step, we model it as a multi-objective combinatorial optimization problem, and an improved immune algorithm (IIA) is proposed to solve it. In the experimental stage, a series of simulated experiments are conducted on nine datasets with different levels of complexity. The results show that the proposed algorithm increases the computational efficiency and effectiveness. Moreover, an empirical study is carried out to validate the proposed approach from a pedagogical view. Compared with a self-selection based approach and the other evolutionary algorithm based approaches, the proposed approach produces better outcomes in terms of learners' homework, final exam grades and satisfaction.

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

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

Herbal extract THI improves metabolic abnormality in mice fed a high-fat diet

  • Han, So-Ra;Oh, Ki-Sook;Yoon, Yoo-Sik;Park, Jeong-Su;Park, Yun-Sun;Han, Jeong-Hye;Jeong, Ae-Lee;Lee, Sun-Yi;Park, Mi-Young;Choi, Yeon-A;Lim, Jong-Seok;Yang, Young
    • Nutrition Research and Practice
    • /
    • v.5 no.3
    • /
    • pp.198-204
    • /
    • 2011
  • Target herbal ingredient (THI) is an extract made from two herbs, Scutellariae Radix and Platycodi Radix. It has been developed as a treatment for metabolic diseases such as hyperlipidemia, atherosclerosis, and hypertension. One component of these two herbs has been reported to have anti-inflammatory, anti-hyperlipidemic, and anti-obesity activities. However, there have been no reports about the effects of the mixed extract of these two herbs on metabolic diseases. In this study, we investigated the metabolic effects of THI using a diet-induced obesity (DIO) mouse model. High-fat diet (HFD) mice were orally administered daily with 250 mg/kg of THI. After 10 weeks of treatment, the THI-administered HFD mice showed reduction of body weights and epididymal white adipose tissue weights as well as improved glucose tolerance. In addition, the level of total cholesterol in the serum was markedly reduced. To elucidate the molecular mechanism of the metabolic effects of THI in vitro, 3T3-L1 cells were treated with THI, after which the mRNA levels of adipogenic transcription factors, including C/$EBP{\alpha}$ and $PPAR{\gamma}$, were measured. The results show that the expression of these two transcription factors was down regulated by THI in a dose-dependent manner. We also examined the combinatorial effects of THI and swimming exercise on metabolic status. THI administration simultaneously accompanied by swimming exercise had a synergistic effect on serum cholesterol levels. These findings suggest that THI could be developed as a supplement for improving metabolic status.

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.