• Title/Summary/Keyword: dual problem

Search Result 710, Processing Time 0.026 seconds

The Problem and Improvement Direction of China Arbitration System (중국(中國) 상사중재제도(商事仲裁制度)의 문제점(問題點) 및 개선방향(改善方向))

  • Kim, Tae-Gyeong
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.29
    • /
    • pp.3-37
    • /
    • 2006
  • This writing is for the purpose of investigating the specific character and problem point of China arbitration system which has near 90 years history and overviewing the drift of system improvement which happens recently. The arbitration system of China which traditionally does not acknowledge ad hoc arbitration, unlike most of the other nations that employ The UNCITRAL model law and make it their own legislation, is restrictive to the parties concerned principle of private autonomy considerably. Also the independence of arbitration is delicate, because of a civil characteristic weakness of the arbitral institutions and the intervention of the courts on the arbitration procedure and award. The dual system of domestic and international arbitration which maintains after enforcement of 1994 arbitration law is often to be a primary factor interrupting the development of Chinese arbitration system and making it vulnerable to challenges. The system improvement demand of the recent time reflects this point and makes the arbitration system of China to a international standard rather than now, so it is a desirable direction for China to be as the member of the world economy to be globalization.

  • PDF

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.

Multiplicity of Flows in a Rayleigh-Benard Problem with Non-Uniform Wall Temperatures (불균일 벽면 온도를 갖는 Rayleigh-Benard 문제에서의 유동의 다수성)

  • Yoo, Joo-Sik;Kim, Yong-Jin
    • 대한공업교육학회지
    • /
    • v.30 no.2
    • /
    • pp.123-129
    • /
    • 2005
  • A Rayleigh-Benard problem with non-uniform wall temperatures of the form, $T_L=T_1+{\delta}{\Delta}T{\sin}kx$ and $T_U=T_2-{\delta}{\Delta}{\sin (kx)$, is numerically investigated. In the conduction-dominated regime with small a Rayleigh number, a two-tier structure appears with two counter-rotating rolls stacked on the top of each other. The flow becomes unstable with increase of the Rayleigh number, and multicellular convection occurs above a critical Rayleigh number. The multicellular flows at high Rayleigh numbers consist of approximetely square-shape cells. Four multiple flows and dual flows classified by the number of cells are found at k=0.5 and k=1, respectively.

Cross-Layer Resource Allocation in Multi-interface Multi-channel Wireless Multi-hop Networks

  • Feng, Wei;Feng, Suili;Zhang, Yongzhong;Xia, Xiaowei
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.960-967
    • /
    • 2014
  • In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

Development of the catenary system for the narrow tunnel with design speed of 160km/h (160km/h가 가능한 협소터널용 터널가선시스템 설계 및 개발)

  • 권삼영;조용현;창상훈;이희성
    • Proceedings of the KSR Conference
    • /
    • 2002.05a
    • /
    • pp.509-515
    • /
    • 2002
  • While performing the advisory services of the electrification of conventional lines for KTX(Korea High Speed Train), we faced the speed-up problem of catenary system for the existing narrow tunnel. To solve this problem, the new system, to be named "Oblique encumbrance tunnel catenary", was developed. This system is mainly characterized by a simple catenary type, a dual bracket, a oblique encumbrance, a small system height and the same bracket used for the radial tension load and compression one. In this paper, the basic concepts, overall system configuration and main points considered in a design phase for the ′oblique encumbrance tunnel catenary′ are described. Moreover, the detail design criteria and other contents like manufacturing pilot products and verifying the performance through a factory and site test are added.

  • PDF

Cross-Layer and End-to-End Optimization for the Integrated Wireless and Wireline Network

  • Gong, Seong-Lyong;Roh, Hee-Tae;Lee, Jang-Won
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.554-565
    • /
    • 2012
  • In this paper, we study a cross-layer and end-to-end optimization problem for the integrated wireless and wireline network that consists of one wireline core network and multiple wireless access networks. We consider joint end-to-end flow control/distribution at the transport and network layers and opportunistic scheduling at the data link and physical layers. We formulate a single stochastic optimization problem and solve it by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way, vertically among communication layers and horizontally among all entities in the network, clearly showing what should be done at each layer and each entity and what parameters should be exchanged between layers and between entities. Numerical results show that our cross-layer and end-to-end optimization approach provides more efficient resource allocation than the conventional layered and separated optimization approach.

Homogeneous Aligned Single Gap Transflective Display driven by Fring-field using a Liquid Crystal with Positive Dielectic Anisotropy (유전율 이방성이 양인액정을 이용한 Fringe-Field 구동형 수평배향된 단일갭 반투과형 디스플레이)

  • Lim, Young-Jin;Choi, Min-Oh;Lee, Seung-Hee
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2005.05a
    • /
    • pp.54-57
    • /
    • 2005
  • We have designed a single gap transflective liquid crystal display (LCD) driven by a fringe electric field, in which the +LC (${\Delta}{\varepsilon}$=7.4, rubbing angle= $80^{\circ}$) is homogeneously aligned in the initial state. This device is a problem that the voltage-dependent transmittance and reflectance curves do not match each other. Thus a dual driving circuit is required. This study shows that optimization of the rubbing angle in the transmissive and reflective regions solves this problem so that the transflective display with a single cell gap and single gamma curve for reflective and transmissive region is possible.

  • PDF

Study on Improving Vulhearability in IPv4/IPv6 Header Translation Mechanism (IPv4/IPv6 헤더변환 방식에서의 취약성 개선에 관한 연구)

  • 황호준;유승재;김귀남
    • Convergence Security Journal
    • /
    • v.3 no.1
    • /
    • pp.73-84
    • /
    • 2003
  • The IPv4 that used to be generally used as a medium of computer communications in 1980s has reached its limits now. IPv6 (IP Version 6) is being prepared to solve the limitations of the IPv4. However, the biggest problem of IPv6 is that it is not compatible with the IPv4. To resolve the compatibility issue, Dual Stack, Tunneling and Header Converting methods have been proposed. The Header Converting method allows communications between the IPv4 and IPv6 networks with the converter. This method's strength is that it is easy to embody and the procedures for embodiment is simple. However, this method still contains the weaknesses that the existing IPv4 has. On the current document, the Header Converting method among the three methods is discussed to resolve the problems this method has. To solve the Header Converting method's weakness, the security problem between sections, the IP Header field values are converted to the relative field values and IPSec (IP Security) and ESP (Encapsulation Security Payload) are applied. The proposed "Encrypted Header Converting Method" that is encrypted in packet units has solved the weakness that the pre-existing Header Converting method used to have.d to have.

  • PDF

A New Efficient Detection Method in Lane Road Environment (도로 환경에 효율적인 새로운 차선 검출 방법)

  • Lee, Kyung-Min;Lin, Chi-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.1
    • /
    • pp.129-136
    • /
    • 2018
  • In this paper, we propose a new real-time lane detection method that is efficient for road environment. Existing methods have a problem of low reliability under environmental changes. In order to overcome this problem, we emphasize the lane candidate area by using gray level division. And Extracts a straight line component near the lane by using the Hough transform, and generates an ROI for each straight line based on the extracted coordinates. And integrates the generated ROI images. Then, the lane is determined by dividing the object using the dual queue in the ROI image. The proposed method is able to detect lanes even in the environmental change unlike the conventional method. And It is possible to obtain an advantage that the area corresponding to the background such as sky, mountain, etc. is efficiently removed and high reliability is obtained.

Optimal Time Scheduling Algorithm for Decoupled RF Energy Harvesting Networks (비결합 무선 에너지 하비스팅 네트워크를 위한 최적 시간 스케줄링 알고리즘)

  • Jung, Jun Hee;Hwang, Yu Min;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.11 no.2
    • /
    • pp.55-59
    • /
    • 2016
  • Conventional RF energy harvesting systems can harvest energy and decode information from same source as an Hybirid-AP (H-AP). However, harvesting efficiency is seriously dependent on distance between users and H-AP. Therefore, in this paper, we proposed a transmission model for RF harvesting consisting of information and power source separately called Decoupled RF Energy harvesting networks. Main purpose of this paper is to maximize energy efficiency under various constraints of transmit power from H-AP and power beacon (PB), minimum quality of service and quality of harvested power of each users. To measure proposed model's performance, we proposed optimal time scheduling algorithms for energy efficiency (EE) maximization using Lagrangian dual decomposition theory that locally maximizes the EE by obtaining suboptimal values of three arguments : transmit power of H-AP, transmit power of PB, frame splitting factor. Experiment results show that the proposed energy-efficient algorithms converge within a few iterations with its optimality and greatly improve the EE compared to that of baseline schemes.