• Title/Summary/Keyword: large solution

Search Result 2,869, Processing Time 0.029 seconds

A Branch-and-Bound Algorithm for Finding an Optimal Solution of Transductive Support Vector Machines (Transductive SVM을 위한 분지-한계 알고리즘)

  • Park Chan-Kyoo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.69-85
    • /
    • 2006
  • Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

Growth of Ice Crystal with Concentration of Surfactant in Water Solution (계면활성제 농도가 빙결정의 입자크기에 미치는 영향)

  • ;稻葉英男
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.26 no.2
    • /
    • pp.240-247
    • /
    • 2002
  • Recently, a thermal energy storage system has been developed actively fur the purpose of saving energy and reducing the peak electrical demand. Especially, ice slurry is a promising working fluid for low temperature energy storage systems. A flow of ice crystals has a large cooling capacity as a result of the involvement of latent heat. However, there are still problems related to the recrystallization of ice crystals for realizing long term storage and long distance transportation. To find improvements fur this, a method for the creation of ice crystals resistant to recrystallization has been proposed and researched by the use of an antifreeze protein (AFP) solution etc. In the present study, it has been investigated the growth of ice crystal in several kinds of water solution added non-ionic surfactant. The results shows that size of ice crystal was smaller with increasing in added surfactant. And ice crystal was not increased with added surfactant.

A Study on Performance Characteristics of A Single Effect LiBr/Water Refrigeration Cycle (단효용 LiBr/물 흡수식 냉동사이클의 성능특성에 관한 연구)

  • 연제문;임삼택;오주원;이경우
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2001.05a
    • /
    • pp.95-99
    • /
    • 2001
  • As a way to use energy effectively, the present study is aimed at investigating the performance characteristics of a Single Effect LiBr/Water Absorption Refrigerator using a low temperature driving heat-source. It was carried out by changing the driving heat-source temperature, the cold water outlet temperature(the refrigeration load), the cooling water inlet temperature, and the weak solution flow rate and this study compares the performance characteristics of refrigerator against the existence and non-existence of the Recirculation of the Weak solution which is used as a method to improve the performance of refrigerator. In case of Recirculation of the weak solution, more improved the Refrigeration Capacity and COP was obtained, and these effects became more larger in the high temperature of driving heat-source and large quantity of solution.

  • PDF

A Study of A Design Optimization Problem with Many Design Variables Using Genetic Algorithm (유전자 알고리듬을 이용할 대량의 설계변수를 가지는 문제의 최적화에 관한 연구)

  • 이원창;성활경
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.11
    • /
    • pp.117-126
    • /
    • 2003
  • GA(genetic algorithm) has a powerful searching ability and is comparatively easy to use and to apply as well. By that reason, GA is in the spotlight these days as an optimization skill for mechanical systems.$^1$However, GA has a low efficiency caused by a huge amount of repetitive computation and an inefficiency that GA meanders near the optimum. It also can be shown a phenomenon such as genetic drifting which converges to a wrong solution.$^{8}$ These defects are the reasons why GA is not widdy applied to real world problems. However, the low efficiency problem and the meandering problem of GA can be overcomed by introducing parallel computation$^{7}$ and gray code$^4$, respectively. Standard GA(SGA)$^{9}$ works fine on small to medium scale problems. However, SGA done not work well for large-scale problems. Large-scale problems with more than 500-bit of sere's have never been tested and published in papers. In the result of using the SGA, the powerful searching ability of SGA doesn't have no effect on optimizing the problem that has 96 design valuables and 1536 bits of gene's length. So it converges to a solution which is not considered as a global optimum. Therefore, this study proposes ExpGA(experience GA) which is a new genetic algorithm made by applying a new probability parameter called by the experience value. Furthermore, this study finds the solution throughout the whole field searching, with applying ExpGA which is a optimization technique for the structure having genetic drifting by the standard GA and not making a optimization close to the best fitted value. In addition to them, this study also makes a research about the possibility of GA as a optimization technique of large-scale design variable problems.

Optimization of Unit Commitment Schedule using Parallel Tabu Search (병렬 타부 탐색을 이용한 발전기 기동정지계획의 최적화)

  • Lee, yong-Hwan;Hwang, Jun-ha;Ryu, Kwang-Ryel;Park, Jun-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.645-653
    • /
    • 2002
  • The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

The Current Distribution of Revolution-Body Using Conjugate Gradient Method (C. G. M을 이용한 회전형 완전도체의 전류분포해석)

  • 이광천;김정기
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1987.04a
    • /
    • pp.184-187
    • /
    • 1987
  • The method of Conjugate Gradient(C.G.M) is applied to the solution of current distribution from body of revolution (B.O.R).Using the C.G.M it is possible to analyze electrically large arbtrarily oriented B.O.R. The fundamental differences between C.G.M and moment method are outlined. This method converges for any initial guess and this techniqe gurantees a monotonic convergence. Numerical results are presented for electromagnetic case which show good agreement with moment solution.

  • PDF

Network Enlarging Search Technique (NEST) for the Crew Scheduling Problem

  • Paek, Gwan-Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.2
    • /
    • pp.177-198
    • /
    • 1994
  • We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

  • PDF

NONLINEAR BIHARMONIC EQUATION WITH POLYNOMIAL GROWTH NONLINEAR TERM

  • JUNG, TACKSUN;CHOI, Q-HEUNG
    • Korean Journal of Mathematics
    • /
    • v.23 no.3
    • /
    • pp.379-391
    • /
    • 2015
  • We investigate the existence of solutions of the nonlinear biharmonic equation with variable coefficient polynomial growth nonlinear term and Dirichlet boundary condition. We get a theorem which shows that there exists a bounded solution and a large norm solution depending on the variable coefficient. We obtain this result by variational method, generalized mountain pass geometry and critical point theory.

UTD-Supplemented Mode-matching Method Analysis of High-Frequency Wave Coupling into Large Parallel Plate Waveguides (모스정합을 결합한 UTD에 의한 큰 평행도파관의 고주파간섭 해석)

  • 권도훈;선영식;명노훈
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.10
    • /
    • pp.48-53
    • /
    • 1994
  • The problem of a plane wave impinging upon a semi-infinite paralle-plate waveguide is investigated. The interior fields can be analyzed by converting the initial field into vaveguide modes. Kirchhoff approximation is usually made at the waveguide aperture in the literature. In this paper, a modified approximation is made using the Uniform Gemetrical Theory of Diffraction(UTD). Numerical results show excellent agreement between UTD-supplemented mode-matching solution and UTD solution.

  • PDF

LED Driver Solution for Backlighting large TFT-LCD Panels with Adaptive Power Control & Video Synchronization

  • Dhayagude, Tushar;Dilip, S;Santo, Hendrik;Vi, Kien;Chen, Sean;Kim, Min-Jong;Schindler, Matt;Ghoman, Ran
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2008.10a
    • /
    • pp.1487-1490
    • /
    • 2008
  • mSilica developed a scalable integrated circuit solution for driving multiple arrays of LEDs to backlight TFT-LCD panels. The drivers incorporate adaptive power control of the DC-DC power supply powering the LEDs to improve the efficiency while synchronizing PWM dimming with video timing signals VSYNC and HSYNC to reduce motion blur.

  • PDF