• Title/Summary/Keyword: dual problems

Search Result 490, Processing Time 0.034 seconds

Real-Time fuzzy Control for Dual-Arm Robot Based-on TMS320C80 Chip (TMS320C80칩을 이용한 이중암 로봇의 실시간 퍼지제어)

  • 김홍래;김종수;한성현
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.04a
    • /
    • pp.327-339
    • /
    • 2003
  • In this paper, a self-organizing fuzzy controller(SOFC) for the industrial robot manipulator with a actuator located at the base is studied A fuzzy login composed of linguistic conditional statements is employed by defining the relations of input-output variable of the controller, In the synthesis of a FLC, one of the most difficult problems is the determination of linguistic control rules from the human operators. To overcome this difficult SOFC is proposed for a hierarchical control structure consisting of basic level and high level that modify control rules. The proposed SOFC scheme is simple in structure, fast in computations and suitable for implementation of real-time control. Performance of the SOFC is illustrated by simulation and experimental results for robot with low joints.

  • PDF

A New ZCS PWM Boost Converter with operating Dual Converter (Dual 컨버터로 동작하는 새로운 ZCS PWM Boost Converter)

  • Kim Tea-Woo;Chin Gi-Ho;Kim Hack-Sung
    • Proceedings of the KIPE Conference
    • /
    • 2002.07a
    • /
    • pp.525-528
    • /
    • 2002
  • A Novel Zero Current Switching(ZCS) Pulse Width Modulation(PWM) boost converter for reducing two rectifiers reverse recovery related losses Is proposed. The switches of the proposed converter are operating to work alternatively turn-on and turn-off with soft switching(ZVS, ZCS) condition. The reverse recovery related switching losses and EMI problems of the proposed converter eliminates the reverse recovery current of the freewheeling diode(D, Dl) by adding the resonant inductor Lr, in series with the switch S2. The voltage and current stresses of the components are similar to those in its conventional hard switching counterpats. As mentioned above, the characteristics are verified through experimental results.

  • PDF

A High-Resolution Dual-Loop Digital DLL

  • Kim, Jongsun;Han, Sang-woo
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.520-527
    • /
    • 2016
  • A new dual-loop digital delay-locked loop (DLL) using a hybrid (binary + sequential) search algorithm is presented to achieve both wide-range operation and high delay resolution. A new phase-interpolation range selector (PIRS) and a variable successive approximation register (VSAR) algorithm are adopted to resolve the boundary switching and harmonic locking problems of conventional digital DLLs. The proposed digital DLL, implemented in a $0.18-{\mu}m$ CMOS process, occupies an active area of $0.19mm^2$ and operates over a wide frequency range of 0.15-1.5 GHz. The DLL dissipates a power of 11.3 mW from a 1.8 V supply at 1 GHz. The measured peak-to-peak output clock jitter is 24 ps (effective pk-pk jitter = 16.5 ps) with an input clock jitter of 7.5 ps at 1.5 GHz. The delay resolution is only 2.2 ps.

Design of Distributed Beamforming for Dual-Hop Multiple-Access Relay Networks

  • Liu, Binyue
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.625-634
    • /
    • 2014
  • This paper studies a dual-hop multiple-access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single-antenna amplify-and-forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low-complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.

Upward Influence to Overcome Hierarchical Authority Expectations: A New Approach for Stakeholder Management

  • Fan, Yang;Anantatmula, Vittal
    • Journal of Construction Engineering and Project Management
    • /
    • v.2 no.2
    • /
    • pp.28-35
    • /
    • 2012
  • Critical to project success is effective stakeholder management. This paper presents a challenge for the project manager who uses traditional approaches to manage mid-level stakeholders in an organization. Dual roles of a mid-level stakeholder (as a stakeholder of a project and as an agent of the corporate) may cause problems that would result in difficulties for project managers in identifying the stakeholder's attributes and overcoming hierarchical authority expectation. However, the dual roles of the stakeholder result in its weakness in the project-stakeholder relationship. Can a project leverage its strategic role for effective upward influence by linking project objectives to corporate strategic objectives? To address this research question, case study method was used to gain a deeper understanding of mid-level stakeholder's salience. This research proposes an upward influence strategy to embed a project-stakeholder relationship in a hierarchical stakeholder network.

A Genetic Algorithm for Assignments of Dual Homing Cell-To-Switch under Mobile Communication Networks (이동 통신 네트워크에서의 듀얼 호밍 셀 스위치 할당을 위한 유전자 알고리듬)

  • Woo Hoon-Shik;Hwang Sun-Tae
    • Journal of Information Technology Applications and Management
    • /
    • v.13 no.2
    • /
    • pp.29-39
    • /
    • 2006
  • There has been a tremendous need for dual homing cell switch assignment problems where calling volume and patterns are different at different times of the day. This problem of assigning cells to switches in the planning phase of mobile networks consists in finding an assignment plan which minimizes the communication costs taking into account some constraints such as capacity of switches. This optimization problem is known to be difficult to solve, such that heuristic methods are usually utilized to find good solutions in a reasonable amount of time. In this paper, we propose an evolutionary approach, based on the genetic algorithm paradigm, for solving this problem. Simulation results confirm the appropriateness and effectiveness of this approach which yields solutions of good quality.

  • PDF

Super Coupling Dual-gate Ion-Sensitive Field-Effect Transistors

  • Jang, Hyun-June;Cho, Won-Ju
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2013.08a
    • /
    • pp.239-239
    • /
    • 2013
  • For more than four decades, ion-sensitive field-effect transistor (ISFET) sensors that respond to the change of surface potential on a membrane have been intensively investigated in the chemical, environmental, and biological spheres, because of their potential, in particular their compatibility with CMOS manufacturing technology. Here, we demonstrate a new type of ISFET with dual-gate (DG) structure fabricated on ultra-thin body (UTB), which highly boosts sensitivity, as well as enhancing chemical stability. The classic ion-sensitive field-effect transistor (ISFET) has been confronted with chronic problems; the Nernstian response, and detection limit with in the Debye length. The super-coupling effects imposed on the ultra thin film serve to not only maximize sensitivity of the DG ISFET, but also to strongly suppress its leakage currents, leading to a better chemical stability. This geometry will allow the ISFET based biosensor platform to continue enhancement into the next decade.

  • PDF

New large-update primal interior point algorithms based on kernel functions for LCPs

  • Kim, Min-Kyung;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.69-88
    • /
    • 2007
  • In this paper we propose new large-update primal-dual interior point algorithms for $P_{\neq}({\kappa})$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on a specific class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{t^{-q}-1}{q}}$, q>0, $p{\in}[0,\;1]$, which are the generalized form of the ones in [3] and [12]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$LCPs. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have the best known complexity $O((1+2{\kappa}){\sqrt{2n}}(log2n)log{\frac{n}{\varepsilon}})$ when p=1 and $q=\frac{1}{2}(log2n)-1$.

  • PDF

Dual-Stream Fusion and Graph Convolutional Network for Skeleton-Based Action Recognition

  • Hu, Zeyuan;Feng, Yiran;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.3
    • /
    • pp.423-430
    • /
    • 2021
  • Aiming Graph convolutional networks (GCNs) have achieved outstanding performances on skeleton-based action recognition. However, several problems remain in existing GCN-based methods, and the problem of low recognition rate caused by single input data information has not been effectively solved. In this article, we propose a Dual-stream fusion method that combines video data and skeleton data. The two networks respectively identify skeleton data and video data and fuse the probabilities of the two outputs to achieve the effect of information fusion. Experiments on two large dataset, Kinetics and NTU-RGBC+D Human Action Dataset, illustrate that our proposed method achieves state-of-the-art. Compared with the traditional method, the recognition accuracy is improved better.

COMPLEXITY ANALYSIS OF IPM FOR $P_*(\kappa)$ LCPS BASED ON ELIGIBLE KERNEL FUNCTIONS

  • Kim, Min-Kyung;Cho, Gyeong-Mi
    • East Asian mathematical journal
    • /
    • v.25 no.1
    • /
    • pp.55-68
    • /
    • 2009
  • In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.