• Title/Summary/Keyword: ARRIVE

Search Result 529, Processing Time 0.034 seconds

Prediction of compressive strength of concrete based on accelerated strength

  • Shelke, N.L.;Gadve, Sangeeta
    • Structural Engineering and Mechanics
    • /
    • v.58 no.6
    • /
    • pp.989-999
    • /
    • 2016
  • Moist curing of concrete is a time consuming procedure. It takes minimum 28 days of curing to obtain the characteristic strength of concrete. However, under certain situations such as shortage of time, weather conditions, on the spot changes in project and speedy construction, waiting for entire curing period becomes unaffordable. This situation demands early strength of concrete which can be met using accelerated curing methods. It becomes necessary to obtain early strength of concrete rather than waiting for entire period of curing which proves to be uneconomical. In India, accelerated curing methods are used to arrive upon the actual strength by resorting to the equations suggested by Bureau of Indian Standards' (BIS). However, it has been observed that the results obtained using above equations are exaggerated. In the present experimental investigations, the results of the accelerated compressive strength of the concrete are used to develop the regression models for predicting the short term and long term compressive strength of concrete. The proposed regression models show better agreement with the actual compressive strength than the existing model suggested by BIS specification.

Analysis of Barrier Waiting Times in Data Parallel Programs (데이터 병렬 프로그램에서 배리어 대기시간의 분석)

  • Jung, In-Bum
    • Journal of Industrial Technology
    • /
    • v.21 no.A
    • /
    • pp.73-80
    • /
    • 2001
  • Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs are executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within partitioned grains result in the difference in arrival time of processors at the barrier.

  • PDF

Development of control module for FMS construction (FMS 구축을 위한 제어 module 개발)

  • 최홍태;배용환;박재홍;이석희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.1090-1095
    • /
    • 1992
  • This paper describes the systematic control method of process information transfer and machine cell control in FMS implementation. We have constructed an experimental FMS computer network and control system. The system hardware consists of host computer to manage process data and information transfer of machine cells, cell control computers to control machine cells(NC lathe, machining center). On the other hand, software is made up of oredr management module, NC program searching and generation module, NC part program error check module and cell control module. In this study, we could arrive at conclusion as following : The first, each task could be accomplihed by the efficient information transfer in hierachical computer network. The second, data base system of part programs and process control data is needed for the efficint information transfer and production management. Lastly, expansion of FMS control system could be achieved by the hierachical and decentralized computer control system.

  • PDF

Zero locus of a beam with varying actuator and sensor locations and dynamical analysis (Actuator와 sensor의 위치 변화에 따른 beam의 zero궤적과 동역학적 해석)

  • 이영재
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.474-478
    • /
    • 1992
  • The non-rational transfer function of a Bernoulli-Euler beam, as an important component of a flexible structure, is analyzed. The true pattern of zeros of that transfer function is investigated as a function of sensor and actuator seperation. Translational displacement sensors are used for two cases in which a force input and a moment input are seperately applied. When the displacement sensor is located at a certain point, the first pair of zeros on the real axis of the s-plane arrive at the origin and cancel the rigid-body mode. The location of the translational displacement sensors on the beamat which the rigid-body mode of the beam is unobservable is analyzed as the center of percussion and is uniquely located for each case. If sensor is moved beyond such a point, a pair of zeros appear on the imaginary axis and move away from the origin along the imaginary axis of the s-plane.

  • PDF

An Algorithm for train conflict detection and resolution occurring in large station with high density traffic (대형.고밀도역 역내 열차 경합 검지 및 해소를 위한 수리 모형 및 해법)

  • Park, Bum-Hwan;Kim, Kyung-Min;Hong, Soon-Heum;Kim, Young-Hoon;Ahn, Jin;Lee, Young-Su;Ha, Sung-Tae
    • Proceedings of the KSR Conference
    • /
    • 2007.05a
    • /
    • pp.1466-1474
    • /
    • 2007
  • In large station with high density traffic, trains is hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within the station such as departs and arrivals of many trains from different lines and shunting trains between yards and platforms, etc. Therefore station dispatcher has to make quick decision about how to schedule all trains including trains to arrive and depart before long. And such decisions become harder when an unexpected delay occurs. This study suggests a mathematical model and algorithm about how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

  • PDF

Multi-Stage Cold Forging Process Design with A* Searching Algorithm (탐색 알고리즘을 이용한 냉간 단조 공정 설계)

  • 김홍석;임용택
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1995.10a
    • /
    • pp.30-36
    • /
    • 1995
  • Conventionally design for multi-stage cold forging depends on the designer's experience and decision-making. Due to such non-deterministic nature of the process sequence design, a flexible inference engine is needed for process design expert system. In this study, A* searching algorithm was introduced to arrive at the vetter process sequence design considering the number of forming stages and levels of effective strain, effective stress, and forming load during the porcess. In order to optimize the process sequence in producing the final part, cost function was defined and minimized using the proposed A* searching algorithm. For verification of the designed forming sequences, forming experiments and finite element analyses were carried out in the present investigation. The developed expert system using A* searching algorithm can produce a flexible design system based on changes in the number of forming stages and weights.

  • PDF

Design of a knowledge-based controller for job scheduling in assembly (조립 작업에서의 생산계획 수립을 위한 지식베이스형 제어기의 설계)

  • 김성수;서기성;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.514-518
    • /
    • 1990
  • This paper describes an experimental Knowledge-Based Control System, named KBCS, for manufacturing and assembly. The KBCS of five parts and function : data-base, knowledge acquisition, optimization, and graphic monitoring. The KBCS is utilized for a FMS which is of five machine centers and automatic assembly lines. Each machine can perform almost all manufacturing functions which some difference in efficiency. Buffers store temporarily the incoming components and the outing components. Parts arrive at assembly lines after many steps of manufacturing, and the transfer path and time are determined by procedural knowledge of control systems. Nine different incoming components are set up. The total control system is expected to perform four algorithms, timing algorithm ,sequencing algorithm, penalty algorithm, and cart algorithm. The construction of controller require basic components of manufacturing systems in which knowledges are formulated on the base of the results and the repeated simulation of KBCS with graphic monitoring system. Simulation results by KBCS are compared with those by the other rules of manufacturing.

  • PDF

Design of an Image Processing Board Using DSP(TMS320C6211) and Its Applications (DSP(TMS320C6211)를 이용한 영상 처리 보드의 설계 및 응용)

  • 박무열;최중경;구본민;류한성;권정혁;하홍수;김진애
    • Proceedings of the IEEK Conference
    • /
    • 2002.06e
    • /
    • pp.227-230
    • /
    • 2002
  • In this paper, we designed and made an image processing board that converts analog NTSC CVBS from CCD camera into digital image, stores it in a memory and accomplishes an appropriate digital image processing suitable to our application. And then loaded it on the self-controlled mobile vehicle and verified its performance by controlling the self-controlled mobile vehicle to avoid obstacles and arrive at the destination through various digital image processes. From the result, the self-controled mobile vehicle system avoided obstacles and got the destination correctly. We knew that designed image processing board is enough to realize the real-time control system.

  • PDF

Traffic Information and Path Guidance System is based on Windows CE Board using GPS and HSDPA (GPS와 HSDPA를 이용한 Windows CE 보드 기반의 교통량 수집 장치 및 경로 서비스에 관한 연구)

  • Kim, Tae-Min;Kim, Sun-Kyun;Lee, Jong-Su
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.401-403
    • /
    • 2007
  • This paper present the Traffic information system that based on embedded WinCE board which has GPSand HSDPA. This system is able to overcome the limit of area using the Internet service other system can't provide. When the embedded board receives the data which has geometric and vehicle speed information, it transmits the data to server via HSDPN/the Internet. The server receives and processes the data for the path services. By an algorithm the data that road information is applied is provided to user. The users will be able to arrive there destination faster.

  • PDF

A Batch Arrival Queue with Bernoulli Vacation Schedule under Multiple Vacation Policy

  • Choudhury Gautam;Madan Kailash C.
    • Management Science and Financial Engineering
    • /
    • v.12 no.2
    • /
    • pp.1-18
    • /
    • 2006
  • We consider an $M^x/G/1$ queueing system with Bernoulli vacation schedule under multiple vacation policy. where after each vacation completion or service completion the server takes sequence of vacations until a batch of new customer arrive. This generalizes both $M^x/G/1$ queueing system with multiple vacation as well as M/G/1 Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further attempts have been made to unify the results of related batch arrival vacation models.