• Title/Summary/Keyword: 링크 결합

Search Result 213, Processing Time 0.023 seconds

Stiffness Analysis of Spring Mechanism for Semi-Automatic Gripper Motion of Tendon-Driven Remote Manipulator (와이어 구동방식 원격조작기용 그리퍼의 반자동 파지 및 해제 동작을 위한 스프링 강성 분석)

  • Yu, Seung-Nam;Lee, Jong-Kwang
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.11
    • /
    • pp.1405-1411
    • /
    • 2012
  • Remote handling manipulators are widely used for performing hazardous tasks, and it is essential to ensure the reliable performance of such systems. Toward this end, tendon-driven mechanisms are adopted in such systems to reduce the weight of the distal parts of the manipulator while maintaining the handling performance. In this study, several approaches for the design of a gripper system for a tendon-driven remote handling system are introduced. Basically, this gripper has an underactuated spring mechanism that is combined with a slave manipulator triggered by a master operator. Based on the requirements under the specified tendon-driven mechanism, the connecting position of the spring system on the gripper mechanism and kinematic influence coefficient (KIC) analysis are performed. As a result, a suitable combination of components for the proper design of the target system is presented and verified.

A Methodology of Path based User Equilibrium Assignment in the Signalized Urban Road Networks (도시부 도로 네트워크에서 교통신호제어와 결합된 경로기반 통행배정 모형 연구)

  • Han, Dong-Hee;Park, Jun-Hwan;Lee, Young-Ihn;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.2
    • /
    • pp.89-100
    • /
    • 2008
  • In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

A Joint Power Allocation and Scheduling Algorithm for CDMA-based High-rate Packet Data Systems (CDMA기반 고속 패킷 데이터 전송 시스템을 위한 전력제어가 결합된 스케쥴링 알고리즘)

  • Koo In-Soo;Kim Ki-Seon
    • Journal of Internet Computing and Services
    • /
    • v.7 no.3
    • /
    • pp.41-51
    • /
    • 2006
  • In the case of CDMA-based packet data systems such as 1xEV-DO which are designed to support high rate services, BSs transmit data packets with a maximum power based on time multiplexing mode such that only one user can be serviced at a time. In this paper, we propose a joint power allocation and scheduling algorithm for 1xEV-DO-like systems in which we adopt a code division multiplexing (CDM) transmission method in the downlink common channel in order to utilize channel orthogonality such that we can serve more than one user at a time slot especially when there exist remaining resources after serving the firstly selected user by the scheduler. Simulation results demonstrate that the proposed scheme can improve the performances of conventional schemes such as the maximum rate and the proportional fair algorithms.

  • PDF

An Efficient Concurrency Control Algorithm for Multi-dimensional Index Structures (다차원 색인구조를 위한 효율적인 동시성 제어기법)

  • 김영호;송석일;유재수
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.80-94
    • /
    • 2003
  • In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

An Experimental Study on Feature Selection Using Wikipedia for Text Categorization (위키피디아를 이용한 분류자질 선정에 관한 연구)

  • Kim, Yong-Hwan;Chung, Young-Mee
    • Journal of the Korean Society for information Management
    • /
    • v.29 no.2
    • /
    • pp.155-171
    • /
    • 2012
  • In text categorization, core terms of an input document are hardly selected as classification features if they do not occur in a training document set. Besides, synonymous terms with the same concept are usually treated as different features. This study aims to improve text categorization performance by integrating synonyms into a single feature and by replacing input terms not in the training document set with the most similar term occurring in training documents using Wikipedia. For the selection of classification features, experiments were performed in various settings composed of three different conditions: the use of category information of non-training terms, the part of Wikipedia used for measuring term-term similarity, and the type of similarity measures. The categorization performance of a kNN classifier was improved by 0.35~1.85% in $F_1$ value in all the experimental settings when non-learning terms were replaced by the learning term with the highest similarity above the threshold value. Although the improvement ratio is not as high as expected, several semantic as well as structural devices of Wikipedia could be used for selecting more effective classification features.

Synergy Effect of Sun Protection Factor Using Method of Forming Self-Assembly of Hybrid Titanium Dioxide (하이브리드 이산화티탄의 자기조직체 형성공법을 이용하여 제조된 하이브리드 이산화티탄의 자외선차단 상승효과)

  • Cho, Hyun Dae;Park, Soo Nam
    • Journal of the Korean Applied Science and Technology
    • /
    • v.31 no.4
    • /
    • pp.748-758
    • /
    • 2014
  • The purpose of this study is to find the optimum conditions for manufacturing titanium dioxide using a hybrid self-assembly forming method, to confirm the shape, properties and synergy effect of UV protection for hybrid titanium dioxide. Hybrid titanium dioxide, manufactured by forming self-assembly of different sizes consisting of two kinds of titanium dioxides, has micro titanium dioxide (250nm~300nm) for support material, Nano titanium dioxide (20~30nm) for surface material, coating support material. Adjustment experiments of $AlCl_3$ concentration and both titanium dioxide ratio were conducted to find the optimized conditions for the surface coating of titanium dioxide striking a negative charge, a sample made of the optimized process was confirmed through an optical analysis, particle size analysis, and potentiometric analysis. The SPF in-vitro value of the cosmetics samples containing hybrid titanium dioxide showed 15~30% higher levels than the cosmetics samples containing both titanium dioxides mixture.

Joint Power-Saving and Routing Algorithm for Lifetime Maximization in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 생존시간 최대화를 위한 전력절감과 라우팅 결합 알고리즘)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2826-2834
    • /
    • 2013
  • In mobile ad hoc networks (MANET), power-saving technology of mobile nodes is divided into transmit power control (TPC), power-saving mode (PSM), and routing. TPC and PSM are operated in physical layer but the routing is managed in network layer, so the design of a joint algorithm is needed to provide better performance. Therefore, in this paper, we propose a joint power-saving and routing algorithm for maximizing the network lifetime while satisfying the end-to-end data rate in ad hoc networks. The proposed algorithm first applies the TPC or PSM to reduce the power consumption of mobile nodes and then performs the routing by considering the decided node lifetime in order to maximize the path lifetime. Simulation results show that the proposed algorithm maximize the lifetime while satisfying the required rate according to the number of mobile nodes and the level of interference.

SLNR-Based Precoder Design for Multiuser MIMO in Distributed Antenna Systems (분산 안테나 시스템에서 다중 사용자 MIMO를 위한 SLNR 기반의 프리코더 설계)

  • Seo, Bangwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.75-82
    • /
    • 2018
  • In this paper, we consider a precoder design for downlink multiuser multiple-input multiple-output (MU-MIMO) in distributed antenna systems (DAS). In DAS, remote radio heads (RRHs) are placed at geographically different locations within a cell area. Three different precoder design schemes are proposed to maximize the separate or joint signal-to-leakage-plus-noise ratio (SLNR) metrics by considering RRH sum power or per-RRH power constraints. The analytical closed-form form solution for each optimization problem is presented. Through computer simulation, we show that the joint SLNR based precoding schemes have better signal-to-interference-plus-noise ratio (SINR) and bit error rate (BER) performances than the separate SLNR based schemes. Also, it is shown that the precoding scheme with RRH sum power constraint has better performance than the precoding scheme with per-RRH power constraint.

Dynamic Network Loading Model based on Moving Cell Theory (Moving Cell Theory를 이용한 동적 교통망 부하 모형의 개발)

  • 김현명
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.113-130
    • /
    • 2002
  • In this paper, we developed DNL(Dynamic Network Loading) model based on Moving cell theory to analyze the dynamic characteristics of traffic flow in congested network. In this paper vehicles entered into link at same interval would construct one cell, and the cells moved according to Cell following rule. In the past researches relating to DNL model a continuous single link is separated into two sections such as running section and queuing section to describe physical queue so that various dynamic states generated in real link are only simplified by running and queuing state. However, the approach has some difficulties in simulating various dynamic flow characteristics. To overcome these problems, we present Moving cell theory which is developed by combining Car following theory and Lagrangian method mainly using for the analysis of air pollutants dispersion. In Moving cell theory platoons are represented by cells and each cell is processed by Cell following theory. This type of simulation model is firstly presented by Cremer et al(1999). However they did not develop merging and diverging model because their model was applied to basic freeway section. Moreover they set the number of vehicles which can be included in one cell in one interval so this formulation cant apply to signalized intersection in urban network. To solve these difficulties we develop new approach using Moving cell theory and simulate traffic flow dynamics continuously by movement and state transition of the cells. The developed model are played on simple network including merging and diverging section and it shows improved abilities to describe flow dynamics comparing past DNL models.

Improvement on The Complexity of Distributed Depth First Search Protocol (분산깊이 우선 탐색 프로토콜의 복잡도 개선을 위한 연구)

  • Choe, Jong-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.926-937
    • /
    • 1996
  • A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

  • PDF