• Title/Summary/Keyword: variable delay

Search Result 459, Processing Time 0.03 seconds

Modeling of CO2 Emission from Soil in Greenhouse

  • Lee, Dong-Hoon;Lee, Kyou-Seung;Choi, Chang-Hyun;Cho, Yong-Jin;Choi, Jong-Myoung;Chung, Sun-Ok
    • Horticultural Science & Technology
    • /
    • v.30 no.3
    • /
    • pp.270-277
    • /
    • 2012
  • Greenhouse industry has been growing in many countries due to both the advantage of stable year-round crop production and increased demand for fresh vegetables. In greenhouse cultivation, $CO_2$ concentration plays an essential role in the photosynthesis process of crops. Continuous and accurate monitoring of $CO_2$ level in the greenhouse would improve profitability and reduce environmental impact, through optimum control of greenhouse $CO_2$ enrichment and efficient crop production, as compared with the conventional management practices without monitoring and control of $CO_2$ level. In this study, a mathematical model was developed to estimate the $CO_2$ emission from soil as affected by environmental factors in greenhouses. Among various model types evaluated, a linear regression model provided the best coefficient of determination. Selected predictor variables were solar radiation and relative humidity and exponential transformation of both. As a response variable in the model, the difference between $CO_2$ concentrations at the soil surface and 5-cm depth showed are latively strong relationship with the predictor variables. Segmented regression analysis showed that better models were obtained when the entire daily dataset was divided into segments of shorter time ranges, and best models were obtained for segmented data where more variability in solar radiation and humidity were present (i.e., after sun-rise, before sun-set) than other segments. To consider time delay in the response of $CO_2$ concentration, concept of time lag was implemented in the regression analysis. As a result, there was an improvement in the performance of the models as the coefficients of determination were 0.93 and 0.87 with segmented time frames for sun-rise and sun-set periods, respectively. Validation tests of the models to predict $CO_2$ emission from soil showed that the developed empirical model would be applicable to real-time monitoring and diagnosis of significant factors for $CO_2$ enrichment in a soil-based greenhouse.

Development of CPLD Technology Mapping Algorithm for Sequential Circuit Improved Run-Time Under Time Constraint (시간제약 조건하에서 순차 회로를 위한 수행시간을 개선한 CPLD 기술 매핑 알고리즘 개발)

  • Yun, Chung-Mo;Kim, Hui-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.4
    • /
    • pp.80-89
    • /
    • 2000
  • In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the$^1$costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that it fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs by 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

  • PDF

Design of a Low Power Reconfigurable DSP with Fine-Grained Clock Gating (정교한 클럭 게이팅을 이용한 저전력 재구성 가능한 DSP 설계)

  • Jung, Chan-Min;Lee, Young-Geun;Chung, Ki-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.2
    • /
    • pp.82-92
    • /
    • 2008
  • Recently, many digital signal processing(DSP) applications such as H.264, CDMA and MP3 are predominant tasks for modern high-performance portable devices. These applications are generally computation-intensive, and therefore, require quite complicated accelerator units to improve performance. Designing such specialized, yet fixed DSP accelerators takes lots of effort. Therefore, DSPs with multiple accelerators often have a very poor time-to-market and an unacceptable area overhead. To avoid such long time-to-market and high-area overhead, dynamically reconfigurable DSP architectures have attracted a lot of attention lately. Dynamically reconfigurable DSPs typically employ a multi-functional DSP accelerator which executes similar, yet different multiple kinds of computations for DSP applications. With this type of dynamically reconfigurable DSP accelerators, the time to market reduces significantly. However, integrating multiple functionalities into a single IP often results in excessive control and area overhead. Therefore, delay and power consumption often turn out to be quite excessive. In this thesis, to reduce power consumption of dynamically reconfigurable IPs, we propose a novel fine-grained clock gating scheme, and to reduce size of dynamically reconfigurable IPs, we propose a compact multiplier-less multiplication unit where shifters and adders carry out constant multiplications.

Dynamic traffic assignment based on arrival time-based OD flows (도착시간 기준 기종점표를 이용한 동적통행배정)

  • Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.143-155
    • /
    • 2009
  • A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

Treatment of Pseudoarthrosis due to Nonunion of the Acromial Fracture with LCP - Case Report - (견봉 골절의 불유합으로 기인한 가관절증의 잠김 금속판을 이용한 치료 - 증례보고 -)

  • Kim, Yong-Min;Park, Kyoung-Jin;Kim, Dong-Soo;Choi, Eui-Sung;Shon, Hyun-Chul;Cho, Byung-Ki;Park, Ji-Kang;Keum, Sang-Wook;Jeong, Ho-Seung
    • Clinics in Shoulder and Elbow
    • /
    • v.16 no.2
    • /
    • pp.130-134
    • /
    • 2013
  • A painful pseudoarthrosis will develop due to a delay in diagnosis and treatment, and surgical care is required. Treatment of pseudoarthrosis is really difficult because the acromion is a thin flat bone that is difficult to be fixed firmly. A 52-year-old woman with multiple trauma had an acromial fracture that was not detected until it had caused pain after ambulation. Open reduction and internal fixation with a variable angle locking compression plate for distal radius and autogenous iliac bone graft were performed. At nine months after the operation, there was partial tear in the supraspinatus tendon, and arthroscopic repair of the supraspinatus tendon was performed. At nine months after the operation, radiographs showed a complete union. At three months after tendon repair, the patient had excellent function of the shoulder. We have reported a case of a successful treatment of nonunion and pseudoarthrosis of acromial fracture that is difficult to be fixed.

Polyphenol Content and Yield Variation of Red-colored Cultivars Depends on Transplanting Date in Southern Plain Region of Korea (남부평야지에서 적미 품종의 이앙시기에 따른 폴리페놀 함량 및 수량변이)

  • Bae, Hyun Kyung;Oh, Seong Hwan;Hwang, Jung Dong;Seo, Jong Ho;Kim, Sang Yeol;Oh, Myung Kyu
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.62 no.3
    • /
    • pp.166-171
    • /
    • 2017
  • For high-quality colored rice production, the cultivation environment is a critical factor. The major environmental factor is temperature, which includes the accumulated and average temperature during vegetative and reproductive stages. Generally, during the cultivation period, the temperature can be controlled by shifting the transplanting date. This study was carried out to determine the optimum transplanting date for high-quality red-colored rice production. Four red-colored rice varieties (Jeokjinju, Jeokjinjuchal, Hongjinju, and Gunganghongmi) were used as test materials. The transplanting dates were May 20 and June 5, 20, and 30 in 2015~2016. The most variable factor controlled by the transplanting date was the grain filling rate. The varieties transplanted on June 30 showed low yields owing to the decrease in the grain filling rate. In contrast, the polyphenol content increased with increasing delay in the transplanting date. Collectively, these two results indicate that the optimum transplanting date was June 20. The average temperature for 30 days after the heading date (30DAH) highly affected the polyphenol content. A lower temperature during the 30DAH induced higher polyphenol contents but also caused low yield. The optimum 30DAH temperature for obtaining a higher yield and polyphenol content was $22{\sim}23^{\circ}C$. Using the average 30DAH and accumulated temperatures, the optimum transplanting date was calculated as June 18 to 24 in Miryang region. The optimum transplanting date of Kyeungsangnamdo region was approximately mid-June to early July, and that of Kyeungsangbukdo region was approximately early to mid-June.

Monitoring-based Coordination of Network-adaptive FEC for Wireless Multi-hop Video Streaming (무선 멀티 홉 비디오 스트리밍을 위한 모니터링 기반의 네트워크 적응적 FEC 코디네이션)

  • Choi, Koh;Yoo, Jae-Yong;Kim, Jong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.114-126
    • /
    • 2011
  • Video streaming over wireless multi-hop networks(WMNs) contains the following challenges from channel fading and variable bandwidth of wireless channel, and it cause degradation of video streaming performance. To overcome the challenges, currently, WMNs can use Forward Error Correction (FEC) mechanism. In WMNs, traditional FEC schemes, E2E-FEC and HbH-FEC, for video streaming are applied, but it has long transmission delay, high computational complexity and inefficient usage of resource. Also, to distinguish network status in streaming path, it has limitation. In this paper, we propose monitoring-based coordination of network-adaptive hop-to-end(H2E) FEC scheme. To enable proposed scheme, we apply a centralized coordinator. The coordinator has observing overall monitoring information and coordinating H2E-FEC mechanism. Main points of H2E-FEC is distinguishing operation range as well as selecting FEC starting node and redundancy from monitored results in coordination. To verify the proposed scheme, we perform extensive experiment over the OMF(Orbit Measurement Framework) and IEEE 802.1la-based multi-hop WMN testbed, and we carry out performance improvement, 17%, from performance comparison by existing FEC scheme.

Convergence Speed Improvement in MMA Algorithm by Serial Connection of Two Stage Adaptive Equalizer (2단 적응 등화기의 직렬 연결에 의한 MMA 알고리즘의 수렴 속도 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.99-105
    • /
    • 2015
  • This paper deals with the mMMA (modified MMA) which possible to improving the convergence speed that employing the serial connecting form of two stage digital filter instead of signal filter of MMA adaptive equalizer without applying the variable step size for compensates the intersymbol interference by channel distortion in the nonconstant modulus signal. The adaptive equalizer can be implemented by signal digital filter using the finite order tap delay line. In this paper, the equalizer is implemented by the two stage serial form and the filter coefficient are updated by the error signal using the same algorithm of MMA in each stage. The fast convergence speed is determined in the first stage, and the residual isi left at the output of first stage output is minimized in the second stage filter. The same digital filter length was considered in single stage and two stage system and the performance of these systems were compared. The performance index includes the output signal constellation, the residual isi and maximum distortion, MSE that is measure of the convergence characteristics, the SER. As a result of computer simulation, mMMA that has a FIR structure of two stage, has more good performance in every performance index except the constellation diagram due to equalization noise and improves the convergence speed about 1.5~1.8 time than the present MMA that has a FIR structure of single stage.

Development of CPLD technology mapping algorithm for Sequential Circuit under Time Constraint (시간제약 조건하에서 순차 회로를 위한 CPLD 기술 매핑 알고리즘 개발)

  • Youn, Chung-Mo;Kim, Hi-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.224-234
    • /
    • 2000
  • In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

  • PDF

Performance Improvement of an Energy Efficient Cluster Management Based on Autonomous Learning (자율학습기반의 에너지 효율적인 클러스터 관리에서의 성능 개선)

  • Cho, Sungchul;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.11
    • /
    • pp.369-382
    • /
    • 2015
  • Energy aware server clusters aim to reduce power consumption at maximum while keeping QoS(quality of service) compared to energy non-aware server clusters. They adjust the power mode of each server in a fixed or variable time interval to activate only the minimum number of servers needed to handle current user requests. Previous studies on energy aware server cluster put efforts to reduce power consumption or heat dissipation, but they do not consider energy efficiency well. In this paper, we propose an energy efficient cluster management method to improve not only performance per watt but also QoS of the existing server power mode control method based on autonomous learning. Our proposed method is to adjust server power mode based on a hybrid approach of autonomous learning method with multi level thresholds and power consumption prediction method. Autonomous learning method with multi level thresholds is applied under normal load situation whereas power consumption prediction method is applied under abnormal load situation. The decision on whether current load is normal or abnormal depends on the ratio of the number of current user requests over the average number of user requests during recent past few minutes. Also, a dynamic shutdown method is additionally applied to shorten the time delay to make servers off. We performed experiments with a cluster of 16 servers using three different kinds of load patterns. The multi-threshold based learning method with prediction and dynamic shutdown shows the best result in terms of normalized QoS and performance per watt (valid responses). For banking load pattern, real load pattern, and virtual load pattern, the numbers of good response per watt in the proposed method increase by 1.66%, 2.9% and 3.84%, respectively, whereas QoS in the proposed method increase by 0.45%, 1.33% and 8.82%, respectively, compared to those in the existing autonomous learning method with single level threshold.