• 제목/요약/키워드: end-to-end approach.

검색결과 1,383건 처리시간 0.031초

폐가전제품 회수물류 네트웍 최적화 (Optimizing Reverse Logistics Network for End-of-Life Electrical Appliances)

  • 김현수;류재환;홍민선;임석철
    • 산업공학
    • /
    • 제20권2호
    • /
    • pp.154-161
    • /
    • 2007
  • When the electrical appliances such as TVs and refrigerators become obsolete, they must be collected to the recycling centers to avoid environmental damages. The obsolete home appliances are first moved to the regional collection point; and then transported to one of the recycling centers. Each recycling center has a limited capacity; and some recycling centers can process only certain types of products. For given locations of the existing collection points and recycling centers, optimally assigning the obsolete home appliances of each type from each collection point to the recycling centers can significantly reduce the total transportation cost. We formulate this problem as an LP problem. We also present an approach to determine the locations of additional recycling centers in order to alleviate the over-utilization of the current recycling centers.

기관협착증에 대한 기관 성형술 (Surgical Management of Trachea Stenosis)

  • 김치경
    • Journal of Chest Surgery
    • /
    • 제25권12호
    • /
    • pp.1508-1515
    • /
    • 1992
  • Between 1975 and 1992, forty five patients with trachea stenosis received tracheoplasty for relief of obstruction. The causes of airway problem are brain contusion[19 cases, 40%], cerebrovascular disease[3 cases, 7%], drug intoxication[8 cases, 18%], psychotic problem[2 cases, 4%], trachea tumor[3 cases, 7%], adult respiratory distress syndrome[9 cases, 20%] and direct trauma[1 case, 2%]. Direct causes of trachea stenosis were complications of tracheostomy[36 cases, 80%], complications of nasotracheal intubation[5 cases, 11%], tumor[3 cases, 6%] and trauma[1 case, 2%]. Thirty one patients underwent the sleeve resection and end-to-end anastomosis. Five patients performed a wedge resection and end-to-end anastomosis. Forteen patients received the Montgomery T-tube for relief of airway obstruction. Four patients have done simple excision of granulation tissue. Two, subglottic stenosis patients were received Rethi procedure[anterior division of cricoid cartilage, wedge partial resection of lower thyroid cartilage and Montgomery T-tube molding] and the other subglottic stenosis patient underwent permanent trachea fenestration. Including cervical flexion in all patients postoperatively, additional surgical techniques for obtain tension-free anastomosis were hyoid bone release technique in two cases, and hilar mobilization, division of inferior pulmonary ligament and mobilization of pulmonary vessel at the pericardium were performed in one case. Cervical approach was used in 39 cases, cervicomediastinal in 12 cases and transthoracic in one case. Complications of tracheoplasty were formation of granulation tissue at the anastomosis site[3 cases], restenosis[9 cases], trachea-innominate artery fistula[2 cases], wound infection[2 cases], separation of anastomosis[2 cases], air leakage[3 cases], injury to a recurrent laryngeal nerve[temporary 8 cases, permanent 2 cases] and hypoxemia[1 case]. Surgical mortality for resection with primary reconstruction was 6.7%, with one death due to postoperative respiratory failure and two deaths due to tracheo-innominate artery fistula.

  • PDF

측면가공에서 마이크로 엔드밀의 공구변형에 의한 절삭가공오차 보상에 관한 연구 (A Study of Machining Error Compensation for Tool Deflection in Side-Cutting Processes using Micro End-mill)

  • 전두성;서태일;윤길상
    • 한국공작기계학회논문집
    • /
    • 제17권2호
    • /
    • pp.128-134
    • /
    • 2008
  • This paper presents a machining error compensation methodology due to deflection of micro cutting tools in side cutting processes. Generally in order to compensate for tool deflection errors it is necessary to carry out a series of simulations, cutting force prediction, tool deflection estimation and compensation method. These can induce numerous calculations and expensive costs. This study proposes an improved approach which can compensate for machining errors without simulation processes concerning prediction of cutting force and tool deflection. Based on SEM images of test cutting specimens, polynomial relationships between machining errors and corrected tool positions were induced. Taking into account changes of cutting conditions caused by tool position variation, an iterative algorithm was applied in order to determine corrected tool position. Experimental works were carried out to validate the proposed approach. Comparing machining errors of nominal cutting with those of compensated cutting, overall machining errors could be remarkably reduced.

OPTIMAL PERIOD AND PRIORITY ASSIGNMENT FOR A NETWORKED CONTROL SYSTEM SCHEDULED BY A FIXED PRIORITY SCHEDULING SYSTEM

  • Shin, M.;SunWoo, M.
    • International Journal of Automotive Technology
    • /
    • 제8권1호
    • /
    • pp.39-48
    • /
    • 2007
  • This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

OBSTACLE-AVOIDANCE ALGORITHM WITH DYNAMIC STABILITY FOR REDUNDANT ROBOT MANIPULATOR WITH FRUIT-ILARVESTING APPLICATIONS

  • Ryu, Y.S.h;Ryu, K.H.
    • 한국농업기계학회:학술대회논문집
    • /
    • 한국농업기계학회 1996년도 International Conference on Agricultural Machinery Engineering Proceedings
    • /
    • pp.1063-1072
    • /
    • 1996
  • Fruit harvesting robots should have more diversity and flexibility in the working conditions and environments than industrial robots. This paper presents an efficient optimization algorithm for redundant manipulators to avoid obstacles using dynamic performance criteria, while the optimization schemes of the previous studies used the performance criteria using kinematic approach. Feasibility and effectiveness of this algorithm were tested through simulations on a 3-degrees-of-freedom manipulator made for this study. Only the position of the end-effector was controlled , which requires only three degrees of freedom. Remaining joints, except for the wrist roll joint, which does not contribute to the end-effector linear velocity, provide two degrees of redundancy. The algorithm was effective to avoid obstacles in the workspace even through the collision occurred in extended workspace, and it was found be to a useful design tool which gives more flexibility to design conditions nd to find the mechanical constraints for fruit harvesting robots.

  • PDF

Reinforcement Learning-based Duty Cycle Interval Control in Wireless Sensor Networks

  • Akter, Shathee;Yoon, Seokhoon
    • International journal of advanced smart convergence
    • /
    • 제7권4호
    • /
    • pp.19-26
    • /
    • 2018
  • One of the distinct features of Wireless Sensor Networks (WSNs) is duty cycling mechanism, which is used to conserve energy and extend the network lifetime. Large duty cycle interval introduces lower energy consumption, meanwhile longer end-to-end (E2E) delay. In this paper, we introduce an energy consumption minimization problem for duty-cycled WSNs. We have applied Q-learning algorithm to obtain the maximum duty cycle interval which supports various delay requirements and given Delay Success ratio (DSR) i.e. the required probability of packets arriving at the sink before given delay bound. Our approach only requires sink to compute Q-leaning which makes it practical to implement. Nodes in the different group have the different duty cycle interval in our proposed method and nodes don't need to know the information of the neighboring node. Performance metrics show that our proposed scheme outperforms existing algorithms in terms of energy efficiency while assuring the required delay bound and DSR.

시각정보에 의한 로보트 매니퓰레이터의 위치.자세 제어 - 신경회로망의 이용 (Visral Control of Robotic Manipulators Based on Neural Network)

  • 심귀보
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.1042-1046
    • /
    • 1993
  • This paper describes a control scheme for a robot manipulator system which uses visual information to position and orientate the end-effector. In this scheme, the position and orientation of the target workpiece with respect to the base frame of the robot are assumed to be unknown, but the desired relative position and orientation of the end-effector to the target workpiece are given in advance. The control scheme directly integrates visual data into the servoing process without subdividing the process into determination of the position and orientation of the workpiece and inverse kinematics calculation. A neural network system is used for determining the change in joint angles required in order to achieve the desired position and orientation. The proposed system can be control the robot so that it approach the desired position and orientation from arbitrary initial ones. Simulation for the robot manipulator with six degrees of freedom will be done. The validity and the effectiveness of the proposed control scheme will be verified by computer simulations.

  • PDF

A Node Scheduling Algorithm in Duty-Cycled Wireless Sensor Networks

  • Thi, Nga Dao;Dasgupta, Rumpa;Yoon, Seokhoon
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2015년도 춘계학술대회
    • /
    • pp.593-594
    • /
    • 2015
  • In wireless sensor networks (WSNs), due to the very low data rate, the sleeping schedule is usually used to save consumed energy and prolong the lifetime of nodes. However, duty-cycled approach can cause a high end-to-end (E2E) delay. In this paper, we study a node scheduling algorithm in WSNs such that E2E delay meets bounded delay with a given probability. We have applied the probability theory to spot the relationship between E2E delay and node interval. Simulation result illustrates that we can create the network to achieve given delay with prior probability and high energy use efficient as well.

  • PDF

Security Framework for Hybrid Wireless Mesh Protocol in Wireless Mesh Networks

  • Avula, Mallikarjun;Lee, Sang-Gon;Yoo, Seong-Moo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권6호
    • /
    • pp.1982-2004
    • /
    • 2014
  • Wireless Mesh Networks (WMNs) are emerging as promising, convenient next generation wireless network technology. There is a great need for a secure framework for routing in WMNs and several research studies have proposed secure versions of the default routing protocol of WMNs. In this paper, we propose a security framework for Hybrid Wireless Mesh Protocol (HWMP) in WMNs. Contrary to existing schemes, our proposed framework ensures both end-to-end and point-to-point authentication and integrity to both mutable and non-mutable fields of routing frames by adding message extension fields to the HWMP path selection frame elements. Security analysis and simulation results show that the proposed approach performs significantly well in spite of the cryptographic computations involved in routing.

Novel Approach to Analytical Jitter Modeling

  • Huremovic, Adnan;Hadzialic, Mesud
    • Journal of Communications and Networks
    • /
    • 제17권5호
    • /
    • pp.534-540
    • /
    • 2015
  • In this paper we propose an analytical model for jitter, wherein we implement the interrupted Poisson process (IPP) for incoming traffic. First, we obtain an analytical model for the jitter on one node with respect to the phase probabilities, traffic load, and tagged traffic share in the aggregate traffic flow. Then, we analyze N-node cases, and propose a model for end-to-end jitter. Our analysis leads to some fast-to-compute approximations that can be used for future network design or admission control. Finally, we validate our analytical results by comparing them with previous results for limit cases, as well as with event-driven simulations. We propose the use of our results as guidelines for jitter evaluation of real IP traffic.