• 제목/요약/키워드: Linear programming problem

검색결과 577건 처리시간 0.027초

A Modified Approach to Density-Induced Support Vector Data Description

  • Park, Joo-Young;Kang, Dae-Sung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제7권1호
    • /
    • pp.1-6
    • /
    • 2007
  • The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

5축 가공의 특이영역에서 공구궤적 오차 - Part I: 궤적오차 모델링 - (Tool-trajectory Error at the Singular Area of Five-axis Machining - Part I: Trajectory Error Modeling -)

  • 소범식;정융호;윤재득
    • 한국CDE학회논문집
    • /
    • 제14권1호
    • /
    • pp.18-24
    • /
    • 2009
  • This paper proposes an analytical method of evaluating the maximum error by modeling the exact tool path for the tool traverse singular region in five-axis machining. It is known that the NC data from the inverse kinematics transformation of 5-axis machining can generate singular positions where incoherent movements of the rotary axes can appear. These lead to unexpected errors and abrupt operations, resulting in scoring on the machined surface. To resolve this problem, previous methods have calculated several tool positions during a singular operation, using inverse kinematics equations to predict tool trajectory and approximate the maximum error. This type of numerical approach, configuring the tool trajectory, requires much computation time to obtain a sufficient number of tool positions in a region. We have derived an analytical equation for the tool trajectory in a singular area by modeling the tool operation into a linear and a nonlinear part that is a general form of the tool trajectory in the singular area and that is suitable for all types of five-axis machine tools. In addition, we have evaluated the maximum tool-path error exactly, using our analytical model. Our algorithm can be used to modify NC data, making the operation smoother and bringing any errors to within tolerance.

Simulation of fracture in plain concrete modeled as a composite material

  • Bui, Thanh T.;Attard, Mario M.
    • Computers and Concrete
    • /
    • 제2권6호
    • /
    • pp.499-516
    • /
    • 2005
  • A composite model is used to represent the heterogeneity of plain concrete consisting of coarse aggregates, mortar matrix and the mortar-aggregate interface. The composite elements of plain concrete are modeled using triangular finite element units which have six interface nodes along the sides. Fracture is captured through a constitutive single branch softening-fracture law at the interface nodes, which bounds the elastic domain inside each triangular unit. The inelastic displacement at an interface node represents the crack opening or sliding displacement and is conjugate to the internodal force. The path-dependent softening behaviour is developed within a quasi-prescribed displacement control formulation. The crack profile is restricted to the interface boundaries of the defined mesh. No re-meshing is carried out. Solutions to the rate formulation are obtained using a mathematical programming procedure in the form of a linear complementary problem. An event by event solution strategy is adopted to eliminate solutions with simultaneous formation of softening zones in symmetric problems. The composite plain concrete model is compared to experimental results for the tensile crack growth in a Brazilian test and three-point bending tests on different sized specimens. The model is also used to simulate wedge-type shear-compression failure directly under the loading platen of a Brazilian test.

GDSS for the Mobile Internet

  • Cho, Yoon-Ho;Choi, Sang-Hyun;Kim, Jae-Kyeong
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2005년도 춘계학술대회
    • /
    • pp.283-291
    • /
    • 2005
  • The development of mobile applications is fast in recent years. However, nearly all applications are for messaging, financial, locating services based on simple interactions with mobile users because of the limited screen size, narrow network bandwidth, and low computing power. Processing an algorithm for supporting a group decision process on mobile devices becomes impossible. In this paper, we introduce the mobile-oriented simple interactive procedure for support a group decision making process. The interactive procedure is developed for multiple objective linear programming problems to help the group select a compromising solution in the mobile Internet environment. Our procedure lessens the burden of group decision makers, which is one of necessary conditions of the mobile environment. Only the partial weak order preferences of variables and objectives from group decision makers are enough for searching the best compromising solution. The methodology is designed to avoid any assumption about the shape or existence of the decision makers's utility function. For the purpose of the experimental study of the procedure, we developed a group decision support system in the mobile Internet environment, MOBIGSS and applied to an allocation problem of investor assets.

  • PDF

Power allocation for full-duplex NOMA relaying based underlay D2D communications

  • Li, Song;Li, Shuo;Sun, Yanjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권1호
    • /
    • pp.16-33
    • /
    • 2019
  • In this paper, a full-duplex NOMA relaying based underlay device-to-device (D2D) communication scheme is proposed, in which D2D transmitter assists cellular downlink transmission as a full-duplex relay. Specifically, D2D transmitter receives signals from base station and transmits the superposition signals to D2D receiver and cellular user in NOMA scheme simultaneously. Furthermore, we investigate the power allocation under the proposed scheme, aiming to maximize D2D link's achievable transmit rate under cellular link's transmit rate constraint and total power constraint. To tackle the power allocation problem, we first propose a power allocation method based on linear fractional programming. In addition, we derive closed-form expressions of the optimal transmit power for base station and D2D transmitter. Simulation results show that the performance of two solutions matches well and the proposed full-duplex NOMA relaying based underlay D2D communication scheme outperforms existing full-duplex relaying based D2D communication scheme.

애널리스트 목표가를 활용한 최적 투자의사결정 방안에 관한 연구 (Optimization of Investment Decision Making by Using Analysts' Target Prices)

  • 조수지;김흥규;이기광
    • 산업경영시스템학회지
    • /
    • 제43권4호
    • /
    • pp.229-235
    • /
    • 2020
  • Investors aim to maximize the return rate for their own investment, utilizing various information as possible as they can access. However those investors, especially individual investors, have limitations of interpretation of the domain-specific information or even the acquisition of the information itself. Thus, individual investors tend to make decision affectively and frequently, which may cause a loss in returns. This study aims to analyze analysts' target price and to suggest the strategy that could maximize individual's return rate. Most previous literature revealed that the optimistic bias exists in the analysts' target price and it is also confirmed in this study. In this context, this study suggests the upper limit of target rate of returns and the optimal value named 'alpha(α)' which performs the adjustment of proposed target rate to maximize excess earning returns eventually. To achieve this goal, this study developed an optimization problem using linear programming. Specifically, when the analysts' proposed target rate exceeds 30%, it could be adjusted to the extent of 59% of its own target rate. As apply this strategy, the investors could achieve 1.2% of excess earning rate on average. The result of this study has significance in that the individual investors could utilize analysts' target price practically.

IRSML: An intelligent routing algorithm based on machine learning in software defined wireless networking

  • Duong, Thuy-Van T.;Binh, Le Huu
    • ETRI Journal
    • /
    • 제44권5호
    • /
    • pp.733-745
    • /
    • 2022
  • In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권12호
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

The influence of concrete degradation on seismic performance of gravity dams

  • Ahmad Yamin Rasa;Ahmet Budak;Oguz Akin Duzgun
    • Earthquakes and Structures
    • /
    • 제26권1호
    • /
    • pp.59-75
    • /
    • 2024
  • This paper presents a dam-reservoir interaction model that includes, water compressibility, sloshing of surface water, and radiation damping at the far-end reservoir, to investigate the influence of concrete deterioration on seismic behavior along with seismic performance of gravity dams. Investigations on seismic performance of the dam body have been conducted using the linear time-history responses obtained under six real and 0.3 g normalized earthquake records with time durations from 10 sec to 80 sec. The deterioration of concrete is assumed to develop due to mechanical and chemical actions over the dam lifespan. Several computer programs have been developed in FORTRAN 90 and MATLAB programming languages to analyze the coupled problem considering two-dimensional (2D) plane-strain condition. According to the results obtained from this study, the dam structure shows critical responses at the later ages (75 years) that could cause disastrous consequences; the critical effects of some earthquake loads such as Chi-Chi with 36.5% damage and Loma with 56.2% damage at the later ages of the selected dam body cannot be negligible; and therefore, the deterioration of concrete along with its effects on the dam response should be considered in analysis and design.

L1-회귀추정량의 붕괴점 향상을 위한 알고리즘 (Algorithm for the L1-Regression Estimation with High Breakdown Point)

  • 김부용
    • Communications for Statistical Applications and Methods
    • /
    • 제17권4호
    • /
    • pp.541-550
    • /
    • 2010
  • $L_1$-회귀추정량이 수직이상점에 대해서는 매우 로버스트하지만 지렛점에 대해서는 전혀 로버스트하지 않다는 사실은 잘 알려져 있다. 본 논문에서는 수직이상점은 물론 지렛점에 대해서도 로버스트한 $L_1$-회귀추정을 위한 알고리즘을 제안한다. MCD 또는 MVE-추정량에 바탕을 둔 로버스트거리를 기준으로 지렛점들을 식별하고, 식별된 지렛점들의 영향력을 적절히 감소시키기 위한 가중치를 결정한다. 가중치에 의해 변환된 자료에 선형척도변환 기법에 바탕을 둔 선형계획 알고리즘을 적용함으로써 $L_1$-회귀추정량의 붕괴점을 향상시킨다. 다양한 형태와 규모의 자료에 대한 모의실험 결과, 제안된 알고리즘에 의한 $L_1$-회귀추정량의 붕괴점이 크게 향상되는 것으로 나타났다.