• Title/Summary/Keyword: Time window

Search Result 1,449, Processing Time 0.034 seconds

A Study on Efficient Evaluation for Before and After of ERP Implementation using DEA in Manufacturing Industry (제조 업종의 ERP 도입 전후에 대한 DEA 상대적 효율성 비교 평가)

  • Hahm, Yongseok;Kim, Tai-Young;Park, Chang-Soon
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.3_spc
    • /
    • pp.169-185
    • /
    • 2013
  • In this research, for find out how operations efficiency for ERP systems, after introducing ERP to manufacturing firms with DEA technique. According to research analyzed relative time dependent efficiency, using Time Window Analysis. And for company group and the other firm within the each same Industry, the relative effectiveness of each company group establishment was compared using DEA.

Time Delay Estimation Using Automatic Tracking Window (자동추적윈도우를 이용한 시간지연 추정)

  • 윤병우;신윤기;박의열
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.5
    • /
    • pp.347-354
    • /
    • 1991
  • In this paper, the Automatic Tracking Window(ATW) algorithm is applied to the Generalized Cross-Correlation(GCC) time delay estimation algorithm as a preprocessing. The Linear Prediction(LP) algorithm, which is a pararmetric spectral estimation algorithm, is applied to the time delay estimation. And the ATW, a preprocessing algorithm is applied to this algorithm too. This paper shows that the ATW algorithm attenuates the sidelobes very much and improves the resolution of the timedelay estimation.

  • PDF

A New Convergence Acceleration Technique for Scramjet Flowfields

  • Bernard Parent;Jeung, In-Seuck
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2004.03a
    • /
    • pp.15-25
    • /
    • 2004
  • This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

  • PDF

A Study on The Optimal Data Link Window Flow Control for ISDN (ISDN을 위한 최적 데이타 링크 흐름 제어에 관한 연구)

  • Kim, Dong-Yon;Shin, Woo-Cheol;Park, Mig-Non;Lee, Sang-Bae
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1174-1177
    • /
    • 1987
  • The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

  • PDF

Analysis of Generalized Impact Factors and the Indices of Journals

  • Abbas, Ash Mohammad
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.341-354
    • /
    • 2011
  • Analyzing the relationships among the parameters for quantifying the quality of research published in journals is a challenging task. In this paper, we analyze the relationships between the impact factor, h-index, and g-index of a journal. To keep our analysis simple and easy to understand, we consider a generalized version of the impact factor where there is no time window. In the absence of the time window, the impact factor converges to the number of citations received per paper. This is not only justified for the impact factor, it also simplifies the analysis of the h-index and g-index as well because addition of a time window in the form of years complicates the computation of indices too. We derive the expressions for the relationships among impact factor, h index, and g-index and validate them using a given set of publication-citation data.

Generalized input estimation for maneuvering target tracking (기동 표적 추적을 위한 일반화된 입력 추정 기법)

  • 황익호;이장규;박용환
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.45 no.1
    • /
    • pp.139-145
    • /
    • 1996
  • The input estimation method estimates maneuvering input acceleration in order to track a maneuvering target. In this paper, the optimal input estimator is derived by choosing the MAP hypothesis among maneuvering input transition hypotheses under the assumption that a maneuvering input acceleration is a semi-Markov process. The optimal input estimation method cannot be realized because the optimal filter should consider every maneuver onset time hypothesis from filter starting time to current time which increase rapidly. Hence the suboptimal filter using a sliding window is proposed. Since the proposed method can consider all hypotheses of input transitions inside the window, it is general enough to include Bogler's input estimation method. Simulation results show, however, that we can obtain a good performance even when the filter considering just one input transition in the window is used. (author). 9 refs., 3 figs., 1 tab.

  • PDF

Economic Evaluation of Domestic Window Type Photoelectrochemical Hydrogen Production Utilizing Solar Cells (태양전지를 이용한 국내 Window Type 광전기화학 수소생산의 경제성 평가)

  • Gim, Bong-Jin;Kim, Jong-Wook
    • Journal of Hydrogen and New Energy
    • /
    • v.21 no.6
    • /
    • pp.595-603
    • /
    • 2010
  • This paper deals with an economic evaluation of domestic window type photoelectrochemical hydrogen production utilizing solar cells. We make some sensitivity analysis of hydrogen production prices by changing the values of input factors such as the initial capital cost, the solar to hydrogen conversion efficiency, and the system duration time. The hydrogen production price of the window type photoelectrochemical system was estimated as 1,168,972 won/$kgH_2$. It is expected that hydrogen production cost can be reduced to 47,601 won/$kgH_2$ if the solar to hydrogen conversion efficiency is increased to 14%, the system duration time is increased to 20,000 hours, and the initial capital cost is decreased to 25% of the current level. We also evaluate the hydrogen production cost of the water electrolysis using the electricity produced by solar cells. The corresponding hydrogen production cost was estimated as 37,838 won/$kgH_2$. The photoelectrochemical hydrogen production is evaluated as uneconomical at this time, and we need to enhance the solar to hydrogen conversion efficiency and the system duration time as well as to reduce prices of the system facilities.

Efficient Stream Sequence Matching Algorithms for Handheld Devices over Time-Series Stream Data (시계열 스트림 데이터 상에서 핸드헬드 디바이스를 위한 효율적인 스트림 시퀀스 매칭 알고리즘)

  • Moon Yang-Sae;Loh Woong-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.736-744
    • /
    • 2006
  • For the handhold devices, minimizing repetitive CPU operations such as multiplications is a major factor for their performances. In this paper, we propose efficient algorithms for finding similar sequences from streaming time-series data such as stock prices, network traffic data, and sensor network data. First, we formally define the problem of similar subsequence matching from streaming time-series data, which is called the stream sequence matching in this paper. Second, based on the window construction mechanism adopted by the previous subsequence matching algorithms, we present an efficient window-based approach that minimizes CPU operations required for stream sequence matching. Third, we propose a notion of window MBR and present two stream sequence matching algorithms based on the notion. Fourth, we formally prove correctness of the proposed algorithms. Finally, through a series of analyses and experiments, we show that our algorithms significantly outperform the naive algorithm. We believe that our window-based algorithms are excellent choices for embedded stream sequence matching in handhold devices.

Comparison of Insect Diversity in Relation to the Sampling Method, Time And Window (채집 방법과 시기 및 빈도에 따른 곤충의 다양성 비교)

  • Park, Geun-Ho;Cho, Soo-Won
    • Korean journal of applied entomology
    • /
    • v.46 no.3
    • /
    • pp.375-383
    • /
    • 2007
  • To find out the affection of the sampling techniques to the result of a faunistic study, we surveyed the insect fauna of the Chungbuk National University (four different sites) for a year, from spring to fall. For each site, four different collecting methods: light trap, net sweeping, pitfall trap, and window trap, were applied and the collecting was done every other week for a total of 16 times. A total of 14 orders and 672 species were collected. 501 species were collected by the light trap, which covers about 75% of the total number of species, turn out to be the most effective, while other methods could only cover 18% or less. On average, only about 30% of the species collected at a given time of collecting were re-collected at the next collecting, which means about 70% of the species collected from the first collecting remains not collected in the next collecting if you collect insects every other week. The result suggests that, in addition to applying diverse collecting methods, frequent sampling, or narrow sample window, is another very important factor for a good representation of species diversity in an insect faunistic study.

A Experimental Study on Window Glass Breakage in Compartment Fires (구획 화재시 창유리 파괴 현상에 관한 실험적 연구)

  • 이수경;김종훈;최종운;이정훈
    • Fire Science and Engineering
    • /
    • v.12 no.3
    • /
    • pp.21-30
    • /
    • 1998
  • This is a study on the relation of window glass breaking time, shape, and vent condition in a compartment fire through the experiment. We recognize the phenomenon that window glass breakage in a compartment fire be arose from the thermal stresses due to the temperature temperature difference was 233.4$^{\circ}C$ for test 1-3, 138$^{\circ}C$ for text 2-1, 83.6$^{\circ}C$ for test 2-2. The interior test 2-2, 400.9$^{\circ}C$ for test 2-3. so if the flame didn't reach at the surface of window glass, the breakage of glass occure at 40$0^{\circ}C$~50$0^{\circ}C$. when the fire size reached to 1541.14kW, the window might be broken by thermal stress. But window glass was not collapsed.

  • PDF