• Title/Summary/Keyword: combinatorial model

Search Result 100, Processing Time 0.025 seconds

Design and Implementation of Multimedia Supported SPRT System (멀티미디어가 지원되는 SPRT 시스템 설계 및 구현)

  • 범수균;오암석
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.6
    • /
    • pp.638-645
    • /
    • 2002
  • One of the potential advantages of computer-based instruction is individualization of instruction. However, this goal has not been fully realized in practice, due largely to limitations of natural language understanding and to combinatorial explosion. It is nonetheless possible to develop CAT(Computer- based Adaptive Testing) Programs which can adapt to students, depending on their performance, by adjusting the length of computer-based tests. The number of questions can be significantly reduced for many individuals, while mastery and nonmastery decisions remain highly accurate. In this paper, We design and implement a Diagnosis System using SPRT(Sequential Probability Ratio Testing). This system supports multimedia object, client/server environment, indvidual feedback, multi-SPRT and maintain student model for individualization of instruction. besides, this system measures coefficient alpha of each problem.

  • PDF

An Application of advanced Dijkstra algorithm and Fuzzy rule to search a restoration topology in Distribution Systems (배전계통 사고복구 구성탐색을 위한 개선된 다익스트라 알고리즘과 퍼지규칙의 적용)

  • Kim, Hoon;Jeon, Young-Jae;Kim, Jae-Chul;Choi, Do-Hyuk;Chung, Yong-Chul;Choo, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.537-540
    • /
    • 2000
  • The Distribution System consist of many tie-line switches and sectionalizing switches, operated a radial type. When an outage occurs in Distribution System, outage areas are isolated by system switches, has to restored as soon as possible. At this time, system operator have to get a information about network topology for service restoration of outage areas. Therefore, the searching result of restorative topology has to fast computation time and reliable result topology for to restore a electric service to outage areas, equal to optimal switching operation problem. So, the problem can be defined as combinatorial optimization problem. The service restoration problem is so important problem which have outage area minimization, outage loss minimization. Many researcher is applying to the service restoration problem with various techniques. In this paper, advanced Dijkstra algorithm is applied to searching a restoration topology, is so efficient to searching a shortest path in graph type network. Additionally, fuzzy rules and operator are applied to overcome a fuzziness of correlation with input data. The present technique has superior results which are fast computation time and searching results than previous researches, demonstrated by example distribution model system which has 3 feeders, 26 buses. For a application capability to real distribution system, additionally demonstrated by real distribution system of KEPCO(Korea Electric Power Corporation) which has 8 feeders and 140 buses.

  • PDF

Optimal Connection Algorithm of Two Kinds of Parts to Pairs using Hopfield Network (Hopfield Network를 이용한 이종 부품 결합의 최적화 알고리즘)

  • 오제휘;차영엽;고경용
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.2
    • /
    • pp.174-179
    • /
    • 1999
  • In this paper, we propose an optimal algorithm for finding the shortest connection of two kinds of parts to pairs. If total part numbers are of size N, then there are order 2ㆍ(N/2)$^{N}$ possible solutions, of which we want the one that minimizes the energy function. The appropriate dynamic rule and parameters used in network are proposed by a new energy function which is minimized when 3-constraints are satisfied. This dynamic nile has three important parameters, an enhancement variable connected to pairs, a normalized distance term and a time variable. The enhancement variable connected to pairs have to a perfect connection of two kinds of parts to pairs. The normalized distance term get rids of a unstable states caused by the change of total part numbers. And the time variable removes the un-optimal connection in the case of distance constraint and the wrong or not connection of two kinds of parts to pairs. First of all, we review the theoretical basis for Hopfield model and present a new energy function. Then, the connection matrix and the offset bias created by a new energy function and used in dynamic nile are shown. Finally, we show examples through computer simulation with 20, 30 and 40 parts and discuss the stability and feasibility of the resultant solutions for the proposed connection algorithm.m.

  • PDF

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.2
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

Adaptive Application Component Mapping for Parallel Computation Offloading in Variable Environments

  • Fan, Wenhao;Liu, Yuan'an;Tang, Bihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4347-4366
    • /
    • 2015
  • Distinguished with traditional strategies which offload an application's computation to a single server, parallel computation offloading can promote the performance by simultaneously delivering the computation to multiple computing resources around the mobile terminal. However, due to the variability of communication and computation environments, static application component multi-partitioning algorithms are difficult to maintain the optimality of their solutions in time-varying scenarios, whereas, over-frequent algorithm executions triggered by changes of environments may bring excessive algorithm costs. To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource communication costs. It can provide the terminal a suitable solution for the current environment with a low incremental algorithm cost. We represent the application component multi-partitioning problem as a graph mapping model, then convert it into a pathfinding problem. A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed as transmission and processing speeds change. Simulation results demonstrate that our algorithm can promote the performance efficiently, and it is superior to the traditional approaches under variable environments to a large extent.

Investigation of Angiotensin Glycosylation by MALDI-TOF and ESI Tandem Mass Spectrometry

  • Park, Soo-Jin;Park, Deok-Hie;Sul, Soo-Hwan;Oh, Sung-Hwan F.;Park, In-Sook;Chung, Doo-Soo;Kim, Hie-Joon;Kim, Min-Sik;Lee, Sang-Won
    • Bulletin of the Korean Chemical Society
    • /
    • v.25 no.12
    • /
    • pp.1791-1800
    • /
    • 2004
  • Angiotensin I, a model decapeptide, was glycosylated and partially hydrolyzed with HCl (6 N, 80 $^{\circ}C$, 4 h), aminopeptidase, and carboxypeptidase Y. A single peptide mass map obtained from truncated peptides in the partial acid hydrolysate of angiotensin and its glycosylation product mixture by matrix-assisted laser desorption/ionization time-of-flight (MALDI-TOF) mass spectrometry enabled sequencing of angiotensin by a combinatorial procedure. MALDI-TOF and electrospray ionization (ESI) tandem mass spectrometric results indicate that both the N-terminal amino group of aspartic acid and the guanidinium group of the second residue arginine are glycosylated.

Fuzzy Learning Method Using Genetic Algorithms

  • Choi, Sangho;Cho, Kyung-Dal;Park, Sa-Joon;Lee, Malrey;Kim, Kitae
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.6
    • /
    • pp.841-850
    • /
    • 2004
  • This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.

  • PDF

Dose-response assessment of the anti-cancer efficacy of soy isoflavones in dimethylhydrazine-treated rats fed 6% fructooligosaccharide

  • Sung, Rye-Young;Choi, Young-Sun
    • Nutrition Research and Practice
    • /
    • v.2 no.2
    • /
    • pp.55-61
    • /
    • 2008
  • We investigated the combinatorial effects of different doses of dietary soy isoflavones (SI) and fructooligosaccharide (FOS) in a rat model of colon cancer. We hypothesized that increased bioavailability of SI metabolites due to dietary FOS may increase production of bioactive equol and affect colon carcinogenesis in a dose-dependent manner. Sprague-Dawley male rats were injected with 12-dimethylhydrazine (DMH) and were providec experimental diets that contained 0, 10, 50, 150, or 500 mg SI per kg of diet and 6% FOS for 12 weeks. The number of aberrant crypt foci (ACF) and the expression of cyclooxygenase-2 (COX-2) in colonic tissues were significantly decreased in the 6% FOS-fed groups compared to the control group. Gut transit time and fecal pH were significantly lower, and fecal concentrations of bifidobacteria were increased with 6% FOS. However, dietary SI supplementation in combination with 6% dietary FOS did not affect ACF formation or COX-2 expression. Plasma equol concentrations were dose-dependently increased by supplementation of SI up to 500 mg/kg of diet. In conclusion, SI supplementation up to 500 mg/kg of diet appeared to have no additive beneficial effects in rats with chemically-induced colon cancer that were fed 6% FOS, although plasma equol was dose-dependently increased.

A cache placement algorithm based on comprehensive utility in big data multi-access edge computing

  • Liu, Yanpei;Huang, Wei;Han, Li;Wang, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.3892-3912
    • /
    • 2021
  • The recent rapid growth of mobile network traffic places multi-access edge computing in an important position to reduce network load and improve network capacity and service quality. Contrasting with traditional mobile cloud computing, multi-access edge computing includes a base station cooperative cache layer and user cooperative cache layer. Selecting the most appropriate cache content according to actual needs and determining the most appropriate location to optimize the cache performance have emerged as serious issues in multi-access edge computing that must be solved urgently. For this reason, a cache placement algorithm based on comprehensive utility in big data multi-access edge computing (CPBCU) is proposed in this work. Firstly, the cache value generated by cache placement is calculated using the cache capacity, data popularity, and node replacement rate. Secondly, the cache placement problem is then modeled according to the cache value, data object acquisition, and replacement cost. The cache placement model is then transformed into a combinatorial optimization problem and the cache objects are placed on the appropriate data nodes using tabu search algorithm. Finally, to verify the feasibility and effectiveness of the algorithm, a multi-access edge computing experimental environment is built. Experimental results show that CPBCU provides a significant improvement in cache service rate, data response time, and replacement number compared with other cache placement algorithms.

A generalized ANFIS controller for vibration mitigation of uncertain building structure

  • Javad Palizvan Zand;Javad Katebi;Saman Yaghmaei-Sabegh
    • Structural Engineering and Mechanics
    • /
    • v.87 no.3
    • /
    • pp.231-242
    • /
    • 2023
  • A novel combinatorial type-2 adaptive neuro-fuzzy inference system (T2-ANFIS) and robust proportional integral derivative (PID) control framework for intelligent vibration mitigation of uncertain structural system is introduced. The fuzzy logic controllers (FLCs), are designed independently of the mathematical model of the system. The type-1 FLCs, have a limited ability to reduce the effect of uncertainty, due to their fuzzy sets with a crisp degree of membership. In real applications, the consequent part of the fuzzy rules is uncertain. The type-2 FLCs, are robust to the fuzzy rules and the process parameters due to the fuzzy degree of membership functions and footprint of uncertainty (FOU). The adaptivity of the proposed method is provided with the optimum tuning of the parameters using the neural network training algorithms. In our approach, the PID control force is obtained using the generalized type-2 neuro-fuzzy in such a way that the stability and robustness of the controller are guaranteed. The robust performance and stability of the presented framework are demonstrated in a numerical study for an eleven-story seismically-excited building structure combined with an active tuned mass damper (ATMD). The results indicate that the introduced type-2 neuro-fuzzy PID control scheme is effective to attenuate plant states in the presence of the structured and unstructured uncertainties, compared to the conventional, type-1 FLC, type-2 FLC, and type-1 neuro-fuzzy PID controllers.