• Title/Summary/Keyword: Input constraints

Search Result 324, Processing Time 0.028 seconds

A Performance Study of Embedded Multicore Processor Architectures (임베디드 멀티코어 프로세서의 성능 연구)

  • Lee, Jongbok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.163-169
    • /
    • 2013
  • Recently, the importance of embedded system is growing rapidly. In-order to satisfy the real-time constraints of the system, high performance embedded processor is required. Therefore, as in general purpose computer systems, embedded processor should be designed as multicore architecture as well. Using MiBench benchmarks as input, the trace-driven simulation has been performed and analyzed for the 2-core to 16-core embedded processor architectures with different types of cores from simple RISC to in-order and out-of-order superscalar processors, extensively. As a result, the achievable performance is as high as 23 times over the single core embedded RISC processor.

Dynamic Analysis of Multi-Robot System Forcing Closed Kinematic Chain (복수로봇 시스템의 동력학적 연구-대상물과 닫힌 체인을 형성할때의 문제-)

  • 유범상
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.4
    • /
    • pp.1023-1032
    • /
    • 1995
  • The multiple cooperating robot system plays an important role in the research of modern manufacturing system as the emphasis of production automation is more on the side of flexibility than before. While the kinematic and dynamic analysis of a single robot is performed as an open-loop chain, the dynamic formulation of robot in a multiple cooperating robot system differs from that of a single robot when the multiple cooperating robots form a closed kinematic chain holding an object simultaneously. The object may be any type from a rigid body to a multi-joint linkage. The mobility of the system depends on the kinematic configuration of the closed kinematic chain formed by robots and object, which also decides the number of independent input parameters. Since the mobility is not the same as the number of robot joints, proper constraint condition is sought. The constraints may be such that : the number of active robot joints is kept the same as mobility, all robot joints are active and have interrelations between each joint forces/torques, two robots have master-slave relation, or so on. The dynamic formulation of system is obtained. The formulation is based on recursive dual-number screw-calculus Newton-Eulerian approach which has been used for single robot analysis. This new scheme is recursive and compact symbolically and may facilitate the consideration of the object in real time.

A Study on the Robust Control of Horizontal-Shaft Magnetic Bearing System Considering Perturbation (불확실성을 고려한 횡축형 자기 베어링 시스템의 로버스트 제어에 관한 연구)

  • Kim, Chang-Hwa;Jung, Byung-Gun;Yang, Joo-Ho
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.34 no.1
    • /
    • pp.92-101
    • /
    • 2010
  • Recently, the magnetic bearings which have many advantages such as no noise, less mechanical friction are widely applied to the suspension of rotors on the rotary machineries. However, the magnetic bearing system is inherently unstable, nonlinear and MIMO(multi-input-multi-output) system as well. In this paper, we design a state feedback controller using linear matrix inequality(LMI) to the multi-objective synthesis, for the magnetic bearing system with integral type servo system. The design objectives include $H_{\infty}$ performance, asymptotic disturbance rejection, and time-domain constraints on the closed-loop pole location. The results of computer simulation show the validity of the designed controller.

An Optimization Approach to the Wind-driven Ocean Circulation Model (해수순환모델에 대한 최적화 방법)

  • KIM Jong-Kyu;RYU Cheong-Ro;CHANG Sun-duck
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.27 no.6
    • /
    • pp.787-793
    • /
    • 1994
  • It has been demonstrated for the finite-difference ocean circulation model that the problem of uncertain forcing and input data can be tackled with an optimization techniques. The uncertainty problem in interesting flow properties is exploring a finite difference ocean circulation model due to the uncertainty in the driving boundary conditions. The mathematical procedure is based upon optimization method by the conjugate gradient method using the simulated data and a simple barotropic model. An example for the ocean circulation model is discussed in which wind forcing and the steady-state circulation are determined from a simulated stream function.

  • PDF

Optimal Design of the Nuclear Steam Generator Digital Water Level Control System (증기발생기 디지탈 수위조절 시스템의 최적설계)

  • Lee, Yoon-Joon
    • Nuclear Engineering and Technology
    • /
    • v.26 no.1
    • /
    • pp.32-40
    • /
    • 1994
  • A digital control system for the steam generator oater level control is developed using the optimal control technique. To describe the more realistic situation, a feedwater valve actuator of the first order lag is included in the overall control system. The optimal gains are obtained by the LQ method which imposes the constraints on the feedwater valve motion as well as on the deviation between the input demand signal and the output feedwater. Developed also is a Kalman observer on account of the flow measurement uncertainty at low power. And a digital controller on the feedback loop is designed which makes the system maintain the same stability margins for all power ranges. The simulation results show that the optimal digital system has good control characteristics despite the adverse dynamics of the steam generator at low power.

  • PDF

Postsolving in interior-point methods (내부점 선형계획법에서의 사후처리)

  • 이상욱;임성묵;성명기;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.89-92
    • /
    • 2003
  • It is often that a large-scale linear programming(LP) problem may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. Presolving or preprocessing is a series of operations which removes the underlying redundancy or detects infeasibility in the given LP problem. It is essential for the speedup of an LP system solving large-scale problems to implement presolving techniques. For the recovery of an optimal solution for the original problem from an optimal solution for the presolved problem, a special procedure, so called postsolving, must be applied. In this paper, we present how a postsolving procedure is constructed and implemented in LPABO, a interior-point based LP system. Briefly, all presolving processes are logged in a data structure in LPABO, and after the end of the solution method an optimal solution for the original problem is obtained by tracing the logs. In each stage of the postsolving procedure, the optimality of intermediate solutions is maintained. We tested our postsolving procedure on Netlib, Gondzio and Kennington LP data sets, and concluded that the computational burden of the procedure is relatively negligible compared with the total solving time.

  • PDF

Measuring Inter-industry Convergence using Structural Holes Theory: Focusing on ICT Industries (구조적 공백 이론을 이용한 산업간 융합 측정 연구: ICT 산업을 중심으로)

  • Lee, Dong Hyun;Lee, Sang-Gun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.3
    • /
    • pp.11-19
    • /
    • 2020
  • This study seeks to measure inter-industry convergence systematically and quantitatively using structural holes theory. ICT industries were classified into ICT manufacturing and ICT service then efficiency and constraints were calculated using input-output tables. The results of the study revealed both ICT industries have very high information and control benefits in the process of industrial convergence, proving to be key industries with competitive advantage. Further implications were presented based on comparative analysis between ICT manufacturing and service and trend analysis over the past 15 years.

R&D Project Portfolio Selection Problem (R&D Project Portfolio 선정 문제)

  • Ahn, Tae-Ho;Kim, Myung-Gwan
    • Korean Management Science Review
    • /
    • v.25 no.1
    • /
    • pp.1-9
    • /
    • 2008
  • This paper investigates the R&D project portfolio selection problem. Despite its importance and impact on real world projects, there exist few practical techniques that help construct an non-dominated portfolio for a decision makers satisfaction. One of the difficulties constructing the portfolio is that such project portfolio problem is, in nature, a multi-attribute decision-making problem, which is an NP-hard class problem. This paper investigates the R&D project portfolio selection problem. Despite its importance and impact on real world projects, there exist few practical techniques that help construct an non-dominated portfolio for a decision makers satisfaction. One of the difficulties constructing the portfolio is that such project portfolio problem is, in nature, a multi-attribute decision-making problem, which is an NP-hard class problem. In order to obtain the non-dominated portfolio that a decision maker or a user is satisfied with, we devise a user-interface algorithm, in that the user provides the maximum/minimum input values for each project attribute. Then the system searches the non-dominated portfolio that satisfies all the given constraints if such a portfolio exists. The process that the user adjusts the maximum/minimum values on the basis of the portfolio found continues repeatedly until the user is optimally satisfied with. We illustrate the algorithm proposed, and the computational results show the efficacy of our procedure.

Hierarchical Cellular Network Design with Channel Allocation Using Genetic Algorithm (유전자 알고리즘을 이용한 다중계층 채널할당 셀룰러 네트워크 설계)

  • Lee, Sang-Heon;Park, Hyun-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.321-333
    • /
    • 2005
  • With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

  • PDF

A Study of Blockchain Technology-based Electronic Voting in Shareholders' Meeting (블록체인 기술 기반의 주주총회 전자투표에 관한 연구)

  • Kim, Seog;Jeen, Sungkwang;Kim, Hyekyung;Choi, Jeongil
    • Journal of Information Technology Services
    • /
    • v.19 no.3
    • /
    • pp.101-115
    • /
    • 2020
  • Electronic voting is one of information technology service to handle a wide range of functions, including registration, certification, input and results of voting, using electronic technology, depending on the degree of automation. It helps voters exercise their voting rights not only for individual suffrage but also for major corporate decisions as shareholders by expressing their opinions regardless of geographical and time constraints. Such electronic voting helps open and expand voting participation, but on the contrary, it is possible to identify who voted and what kind of vote, such voting cannot guarantee confidentiality. Therefore, if blockchain technology is applied to electronic voting, it can increase the speed of processing and confidentiality by encrypting voting information. In this regard, the study aims to identify institutional issues on how electronic voting can be activated at a company's shareholders' meeting, and to find ways to overcome the limitations of existing electronic voting by utilizing the technical characteristics of blockchain. This study proposes a consortium-type blockchain-based electronic voting system to enhance the convenience and reliability of electronic voting for shareholders' meetings. In addition, this paper suggests how to enhance shareholders' profits through electronic voting at shareholders' meetings, as well as its policy measures and future improvements.