• Title/Summary/Keyword: time windows

Search Result 799, Processing Time 0.028 seconds

Study on Thermal Comfort in according to Rate of Opening Windows of Flat-type Apartment (판상형 아파트의 창문개폐율에 따른 열쾌적도 분석)

  • Kim, Sung Gil
    • KIEAE Journal
    • /
    • v.13 no.6
    • /
    • pp.93-98
    • /
    • 2013
  • The purpose of this study is to analyze the rate of opening windows that makes residents of a flat-type apartment feel pleasant in summer time. A few conditions were simulated on the wind flow that pass through internal and external spaces of the flat-type apartment, utilizing CFX program. The simulation was made with the criteria for the rates of opening window at 20%, 50%, 70% and 100%. When the rate of window opening was more 50%, the wind speed(more than 1m/s) that makes the residents feel pleasant was observed in more 60% of the internal space. When the all windows of the apartments were opened, the heat island phenomenon was almost disappeared and the pleasant wind flow was more evenly distributed in the external spaces. If residents of apartments recognize the result of this study and practice in agrement on opening windows in summer, it is expected to contribute to minimizing the energy consumption for air conditioning.

Comparison of Window Functions for the Estimation of Leak Location for Underground Plastic Pipes (지하매설 플라스틱 배관의 누수지점 추정을 위한 창함수 비교 연구)

  • Lee, Young-Sup
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.6
    • /
    • pp.568-576
    • /
    • 2010
  • It is widely known that the leak locating of underground plastic pipelines is much more difficult than that of cast iron pipelines. The precision of the leak locating depends upon the speed of leak signal and the time delay estimation between the two sensors on the pipeline. In this paper, six different windowing filters are considered to improve the time delay estimation especially for the plastic pipelines. The time delay is usually estimated from the peak time of cross-correlation functions. The filtering windows including rectangle, Roth, Wiener, SCOT, PHAT and maximum likelihood are applied to derive the generalized cross-correlation function and compared each other. Experimental results for the actual plastic underground water supply pipeline show that the introduction of the filtering windows improved the precision of time delay estimation. Some window functions provide excellent leak locating capability for the plastic pipe of 98 m long, which is less than 1 % of the pipe lengths. Also a new probabilistic approach that the combinations of all results from each filtering window is suggested for the better leak locating.

An Adaptive Genetic Algorithm for a Dynamic Lot-sizing and Dispatching Problem with Multiple Vehicle Types and Delivery Time Windows (다종의 차량과 납품시간창을 고려한 동적 로트크기 결정 및 디스패칭 문제를 위한 자율유전알고리즘)

  • Kim, Byung-Soo;Lee, Woon-Seek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.4
    • /
    • pp.331-341
    • /
    • 2011
  • This paper considers an inbound lot-sizing and outbound dispatching problem for a single product in a thirdparty logistics (3PL) distribution center. Demands are dynamic and finite over the discrete time horizon, and moreover, each demand has a delivery time window which is the time interval with the dates between the earliest and the latest delivery dates All the product amounts must be delivered to the customer in the time window. Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.

Implementation of Real Time Multi-User Communication System with MPEG-4 CELP (MPEG-4 CELP를 이용한 실시간 다자간 통신시스템의 구현)

  • 김헌중;우광희;차형태
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.3
    • /
    • pp.57-62
    • /
    • 2000
  • In recent, the innovative improvement of a internet and computing environment make users desire the capability of processing information in real time. In this paper we implement a PC-to-PC real time multi-user communication system on the internet environment using the efficient algorithm for a real time processing and the MFEG-4 CELP codec which can be used for a low bit-rate coding from 6 to 24kbps. The implemented system produces a compressed bit-streams with the MPEG-4 CEU Mode-I 18200bps mode. There is 5 frames for a package and 1 frame has 160 samples. We can use this system to communicate with 4 users simultaneously in real time. The system is designed and examined on the Windows operating system.

  • PDF

Improved Code Timing Estimator for DS-CDMA Systems Using Correlated Antennas in Time-Varying Fading Channels (시변 페이딩 채널에서 상관관계가 있는 안테나를 사용하는 DS-CDMA 통신 시스템을 위한 개선된 최대가능도 코드 타이밍 추정기)

  • Kim Sang-Choon;Jeong Bong-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.910-920
    • /
    • 2006
  • We consider the problem of estimating a code-timing of DS-CDMA signal in antenna array systems in the presence of flat fading channels and near-far environments. We derive an approximate maximum likelihood algorithm of estimating the code-timing of a desired user for DS-CDMA systems to better utilize the time-varying characteristics of the fading process. In the development of code timing estimator, the given observation bits are divided into many sets of sub-windows with each sufficiently large. The proposed method uses sub-windows with equal size associated with the coherence time of channel fading. The alternative approach is that without the estimation of the fading rate, the sufficiently given observation bits are simply separated into two consecutive sets of sub-windows. The derivation of the proposed algorithms is based on multiple antennas partially correlated in space. The impacts of spatial fading correlation on acquisition and men acquisition time performance of the proposed algorithms are also examined.

The Bias Error due to Windows for the Wigner-Ville Distribution Estimation (위그너-빌 분포함수의 계산시 창문함수의 적용에 의한 바이어스 오차)

  • 박연규;김양한
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.80-85
    • /
    • 1995
  • Too see the effects of finite record on the estimation of WVD in practice, a window which has time varying length is examined. Its length increases linearly with time in the first half of the record, and decreases from the center of the record. The bias error due to this window decreases inversely proportionally to the window length as time increases in the first half. In the second half, the bias error increases and the resolution decreases as time increases. The bias error due to the smoothing of WVD, which is obtained by two-dimensional convolution of the true WVD and the smoothing window, which has fixed lengths along time and frequency axes, is derived for arbitrary smoothing window function. In the case of using a Gaussian window as a smoothing window, the bias error is found to be expressed as an infinite summation of differential operators. It is demonstrated that the derived formula is well applicable to the continuous WVD, but when WVD has some discontinuities, it shows the trend of the error. This is a consequence of the assumption of the derivation, that is the continuity of WVD. For windows other than Gaussian window, the derived equation is shown to be well applicable for the prediction of the bias error.

  • PDF

A Dynamic Lot-Sizing and Outbound Dispatching Problem with Delivery Time Windows and Heterogeneous Container Types (납품시간창과 다종의 컨테이너를 고려한 동적 로트크기결정 및 아웃바운드 디스패칭 문제)

  • Seo, Wonchul;Lee, Woon-Seek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.4
    • /
    • pp.435-441
    • /
    • 2014
  • This paper considers a single-product problem for inbound lot-sizing and outbound dispatching at a third-party warehouse, where the demand is dynamic over the discrete time horizon. Each demand must be delivered into the corresponding delivery time window which is the time interval characterized by the earliest and latest delivery dates of the demand. Ordered products are shipped by heterogeneous container types. Each container type has type-dependent carrying capacity and the unit freight cost depends on each container type. Total freight cost is proportional to the number of each container type used. Also it is assumed that related cost functions are concave and backlogging is not allowed. The objective of the paper is to simultaneously determine the optimal inbound lot-sizing and outbound dispatching plans that minimize total costs which include ordering, shipping, and inventory holding costs. The optimal solution properties are characterized for the problem and then a dynamic programming algorithm is presented to find the optimal solution.

Generalization of Window Construction for Subsequence Matching in Time-Series Databases (시계열 데이터베이스에서의 서브시퀀스 매칭을 위한 윈도우 구성의 일반화)

  • Moon, Yang-Sae;Han, Wook-Shin;Whang, Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.357-372
    • /
    • 2001
  • In this paper, we present the concept of generalization in constructing windows for subsequence matching and propose a new subsequence matching method. GeneralMatch, based on the generalization. The earlier work of Faloutsos et al.(FRM in short) causes a lot of false alarms due to lack of the point-filtering effect. DualMatch, which has been proposed by the authors, improves performance significantly over FRM by exploiting the point filtering effect, but it has the problem of having a smaller maximum window size (half that FRM) given the minimum query length. GeneralMatch, an improvement of DualMatch, offers advantages of both methods: it can use large windows like FRM and, at the same time, can exploit the point-filtering effect like DualMatch. GeneralMatch divides data sequences into J-sliding windows (generalized sliding windows) and the query sequence into J-disjoint windows (generalized disjoint windows). We formally prove that our GeneralMatch is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of GeneralMatch. We then propose a method of determining the value of J that minimizes the number of page accesses, Experimental results for real stock data show that, for low selectivities ($10^{-6}~10^{-4}$), GeneralMatch improves performance by 114% over DualMatch and by 998% iver FRM on the average; for high selectivities ($10^{-6}~10^{-4}$), by 46% over DualMatch and by 65% over FRM on the average.

  • PDF

A Performance Evaluation of the Variations of Ant Colony Optimization for Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로문제를 위한 Ant Colony Optimization의 변형들의 성능평가)

  • Hong, Sung-Chul;Park, Yang-Byung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.319-322
    • /
    • 2004
  • 물류/택배업계의 공급사슬관리에서 차량에 의한 고객의 요구 서비스 시간대 만족은 고객의 재고수준을 낮추고 또한 서비스 수준의 향상에 매우 중요한 제약조건이다. 최근에 소개된 메타휴리스틱인 개미해법(Ant Colony Optimization: ACO)은 NP-hard 문제의 해공간 탐색에 있어서 상당한 장점을 가지고 있으나, 시간대 제약이 있는 차량경로문제(Vehicle Routing Problems with Time Windows: VRPTW)에 대한 적용은 아주 미비한 실정이다. 따라서, 본 연구에서는 ACO 를 VRPTW에 적용하여 최선의 차량경로 해를 구하기 위한 여러 변형을 제시하고, 이들의 영향을 다양한 실험문제를 이용하여 분석하고자 한다. 계산실험 결과, 기본 ACO 에 여러 설계 요소들을 추가함에 따라 계산시간이 다소 증가하지만 보다 우수한 차량경로 해를 구할 수 있었다.

  • PDF

Sub-surface imaging and vector precision from high resolution down-hole TEM logging

  • Chull, James;Massie, Duncan
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2005.09a
    • /
    • pp.11-18
    • /
    • 2005
  • Filament inversion routines are highly effective for target definition whenever total-field DHTEM vectors can be obtained using three-component logging tools. However most cross-hole components contain significant noise related to sensor design and errors in observation of probe rotation. Standard stacking methods can be used to improve data quality but additional statistical methods based on cross-correlation and spatial averaging of orthogonal components may be required to ensure a consistent vector migration path. Apart from assisting with spatial averaging, multiple filaments generated for successive time-windows can provide additional imaging information relating to target geometry and current migration. New digital receiver systems provide additional time-windows to provide better tracking options necessary for high-resolution imaging of this type.

  • PDF