• Title/Summary/Keyword: Setup

Search Result 2,350, Processing Time 0.024 seconds

Taming of large diameter triaxial setup

  • Nair, Asha M.;Madhavi Latha, G.
    • Geomechanics and Engineering
    • /
    • v.4 no.4
    • /
    • pp.251-262
    • /
    • 2012
  • Triaxial tests are essential to estimate the shear strength properties of the soil or rock. Normally triaxial tests are carried out on samples of 38 mm diameter and 76 mm height. Granular materials, predominantly used in base/sub-base construction of pavements or in railways have size range of 60-75 mm. Determination of shear strength parameters of those materials can be made possible only through triaxial tests on large diameter samples. This paper describes a large diameter cyclic triaxial testing facility set up in the Geotechnical Engineering lab of Indian Institute of Science. This setup consists of 100 kN capacity dynamic loading frame, which facilitates testing of samples of up to 300 mm diameter and 600 mm height. The loading ram can be actuated up to a maximum frequency of 10 Hz, with maximum amplitude of 100 mm. The setup is capable of carrying out static as well as dynamic triaxial tests under isotropic, anisotropic conditions with a maximum confining pressure of 1 MPa. Working with this setup is a difficult task because of the size of the sample. In this paper, a detailed discussion on the various problems encountered during the initial testing using the equipment, the ideas and solutions adopted to solve them are presented. Pilot experiments on granular sub-base material of 53 mm down size are also presented.

A Send-ahead Policy for a Semiconductor Wafer Fabrication Process

  • Moon, Ilkyeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.119-126
    • /
    • 1993
  • We study a manufacturing process that is quite common in semiconductor wafer fabrication of semiconductor chip production. A machine is used to process a job consisting of J wafers. Each job requires a setup, and the i$_{th}$ setup for a job is sucessful with probability P$_{i}$. The setup is prone to failure, which results in the loss of expensive wafers. Therefore, a tiral run is first conducted on a small batch. If the set up is successful, the test is passed and the balance of the job can be processed. If the setup is unsuccessful, the exposed wafers are lost to scrap and the mask is realigned. The process then repeats on the balance of the job. We call this as send-ahead policy and consider general policies in which the number of wafers that are sent shead depend on the cost of the raw wafer, the sequence of success probabilities, and the balance of the job. We model this process and determine the expected number of good wafers per job,the expected time to process a job, and the long run average throughput. An algorithm to minimize the cost per good wafer subject to a demand constraint is provided.d.d.

  • PDF

A Bluetooth Scatternet Reformation Algorithm

  • Lee Han-Wook;Kauh Sang-Ken
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.59-69
    • /
    • 2006
  • Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

Post-Silicon Tuning Based on Flexible Flip-Flop Timing

  • Seo, Hyungjung;Heo, Jeongwoo;Kim, Taewhan
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.1
    • /
    • pp.11-22
    • /
    • 2016
  • Clock skew scheduling is one of the essential steps to be carefully performed during the design process. This work addresses the clock skew optimization problem integrated with the consideration of the inter-dependent relation between the setup and hold times, and clock to-Q delay of flip-flops, so that the time margin is more accurately and reliably set aside over that of the previous methods, which have never taken the integrated problem into account. Precisely, based on an accurate flexible model of setup time, hold time, and clock-to-Q delay, we propose a stepwise clock skew scheduling technique in which at each iteration, the worst slack of setup and hold times is systematically and incrementally relaxed to maximally extend the time margin. The effectiveness of the proposed method is shown through experiments with benchmark circuits, demonstrating that our method relaxes the worst slack of circuits, so that the clock period ($T_{clk}$) is shortened by 4.2% on average, namely the clock speed is improved from 369 MHz~2.23 GHz to 385 MHz~2.33 GHz with no time violation. In addition, it reduces the total numbers of setup and hold time violations by 27.7%, 9.5%, and 6.7% when the clock periods are set to 95%, 90%, and 85% of the value of Tclk, respectively.

A Generalization of CCTV Setting in Smart Surveillance System (스마트 관제 시스템에서 CCTV 설정의 일반화)

  • Kim, Kiyong;Lee, Keonbae
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.266-273
    • /
    • 2018
  • Smart surveillance system obtains the positional information of users using GPS receivers embedded in smart devices, and provide them with services of tracking, monitoring, and protecting by controlling CCTVs nearby them. In order to apply and operate these systems to new environment, the overall setup process of the system is increased proportionally to the number of CCTVs. Therefore if there is a large number of CCTVs, the amount of time required during the setup process is very lengthy, and the operation of them becomes inoperable. In this paper, we propose a method to reduce these setting process. As the result of applying and simulation the proposed method, the setup method is simple, and as the CCTV increases, it consumes less time the previous system, and the system can be operated during setup.

Developing a Data Model of Product Manufacturing Flow for an IC Packaging WIP System

  • Lin, Long-Chin;Chen, Wen-Chin;Sun, Chin-Huang;Tsai, Chih-Hung
    • International Journal of Quality Innovation
    • /
    • v.6 no.3
    • /
    • pp.70-94
    • /
    • 2005
  • The IC packaging industry heavily relies on shop floor information, necessitating the development of a model to flexibly define shop floor information and timely handle manufacturing data. This study presents a novel data model of product manufacturing flow to define shop floor information to effectively respond to accelerated developments in IC package industry. The proposed data model consists of four modules: operation template setup, general process setup, enhanced bill of manufacture (EBOMfr) setup, and work-order process setup. The data model can flexibly define the required shop floor information and decision rules for shop floor product manufacturing flow, allowing one to easily adopt changes of the product and on the shop floor. However, to handle floor dynamics of the IC packaging industry, this work also proposes a WIP (i.e. work-in-process) system for monitoring and controlling the product manufacturing flow on the shop floor. The WIP system integrates the data model with a WIP execution module. Furthermore, an illustrative example, the MIRL WIP System, developed by Mechanical Industrial Research Laboratories of Industrial Technology Research Institute, demonstrates the effectiveness of the proposed model.

Performance Evaluation of control and management protocol for Dynamic lightpath setup based GMPLS network (GMPLS 기반의 동적 경로 설정을 위한 제어 및 관리 프로토콜 성능 평가)

  • Kim Kyoung-Mok;Oh Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.9-14
    • /
    • 2004
  • As the internet traffic type and size have bun diversified in recent years, the GMPLS-based distributed control and management protocol have surfaced as a serious issue for dynamic optical lightpath setup. In this reason, we investigated and analyzed network performance and protocols using global information-based link state approach and local information based link state approach. We calculated connection setup time, required control bandwidth and setup blocking probability that made from network update period and threshold metrics according to traffic arrival rate. The evaluated results will be used in broadband network and adopted for high speed network in the future widely.

Fast Link-Setup Protocol for Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크를 위한 고속 링크 설정 프로토콜)

  • Pak, Wooguil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.3
    • /
    • pp.247-254
    • /
    • 2014
  • For wireless multimedia sensor network (WMSN), it is crucial to select appropriate channels to deliver multimedia data stream generated by image and voice sensors periodically or continuously. Although most of previous researches assume that fixed channels are used for wireless sensor networks, they causes limit to support various application areas. In this paper, we apply link-setup algorithms developed for wireless cognitive radio networks for searching common channels between two nodes without common control channels. We also show the algorithm causes serious performance degradation as the total number of used channels increases, and then propose a new link-setup algorithm to resolve the problem. Therefore, the proposed algorithm shows 30 % higher performance compared to existing algorithms.

Experimental Study on the Surface Pressure Characteristics of a Rear-Guider for the Various Design Factors of a Cross-Flow Fan (관류홴의 설계인자 변화에 따른 리어가이더의 표면압력 특성에 관한 실험적 연구)

  • Kim, J.K.
    • Journal of Power System Engineering
    • /
    • v.9 no.3
    • /
    • pp.50-57
    • /
    • 2005
  • A cross-flow fan is strongly influenced by the various design factors of a rear-guider and a stabilizer. The purpose of this paper is to investigate the effects of a rear-guider and a stabilizer on the surface pressure of a rear-guider in an indoor room air-conditioner using a cross-flow fan. The design factors considered in this paper are a rear-guider clearance, a stabilizer clearance, and a stabilizer setup angle, respectively. The operating condition of a cross-flow fan was controlled by changing the static pressure and flowrate using a fan tester. All surface pressures of a rear-guider are differently distributed according to the stabilizer setup angle, and show a zero value in the flow coefficient, ${\Phi}{\fallingdotseq}0.5$ only of a stabilizer setup angle, $45^{\circ}$. Especially, they show a big negative value in the expansion angle larger than $34^{\circ}$ regardless of a rear-guider clearance, a stabilizer clearance, and a stabilizer setup angle. On the other hand, surface pressures for various stabilizer cutoff clearances are better than those for various rear-guider clearances.

  • PDF

Assignment-Change Optimization for the Problem of Bid Evaluation (입찰 평가 문제의 배정-변경 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.171-176
    • /
    • 2021
  • This paper deals with bid evaluation problem that chooses the vendors and quantity with minimum purchasing cost for bid information of setup cost and unit price. For this problem, the branch-and-bound(BB) and branch-and-cut(BC) methods are well-known. But these methods can be fail to obtain the optimal solution. This paper gets the initial feasible solution with procuring quantity assignment principle in accordance with the unit price or setup cost rank-first. Then procuring quantity moving optimization(vendor change) is execute take account of unit price or setup cost rank. As a result of experimentation, the propose algorithm is significantly lower compared to BB and BC.