• Title/Summary/Keyword: Minimum Quality

Search Result 1,477, Processing Time 0.033 seconds

Indoor air quality evaluation in intercity buses in real time traffic

  • Kazim O. Demirarslan;Serden, Basak
    • Advances in environmental research
    • /
    • v.11 no.1
    • /
    • pp.17-30
    • /
    • 2022
  • Road transport allows all forms of land conditions to be met at less cost. Because of this function, despite numerous disadvantages, it becomes the most frequently used method of transport, especially in underdeveloped or developing countries. One of the most significant factors used in evaluating the atmosphere's air quality is the amount of CO2, increasing people's density in indoor spaces. The amount of CO2 indoors is, therefore, vital to determine. In this study, CO2 and temperature measurements made on nine different bus journey was made in Turkey. The minimum and maximum values were recorded as 555 ppm and 3000 ppm CO2, respectively, in the measurements. On all journeys, the average concentration is 1088.72 ppm. The minimum and maximum values were measured as 17.4℃ and 32.7℃ in the temperature measurements, and the average of all trips was calculated to be 25.76℃. In this study conducted before the Covid-19 pandemic, it was determined that the amount of CO2 increased with the density and insufficient ventilation in the buses. The risk of infection increases in places with high human density and low clean air. For situations such as pandemics, CO2 measurement is a rapid indicator of determining human density.

A Preliminary Study of Licensing Facilitation Standards for Improvements in Quality for Childcare Centers (보육시설의 질적 향상을 위한 설치기준에 관한 기초연구)

  • Kim, Youug-Aee;Choi, Mock-Wha;Park, Juug-A
    • Korean Journal of Human Ecology
    • /
    • v.20 no.3
    • /
    • pp.691-711
    • /
    • 2011
  • This study examines the preliminary license and approval facilitation standards for improvements in quality for childcare centers focusing on the number of children, building space standards, facilities and equipment, and childcare program. Data from 48 caese was collected from childcare centers nationwide in Korea through a questionnaire and building plan. The first step for starting care licensing is to work out the ages and numbers of children within four or five age ranges. The second step is to work out the number of children as small, medium, or large considering staff to child ratios and building size. The Nnext step is to make a choice about childcare service quality classification as minimum, fair, or good, considering space requirements per child for the building, the classroom and the outdoor playground. The next step is to make a choice of space organization relating to service programs, considering the sleeping and eating area, indoor play area, toilet & washing facilities, classroom layouts such as cluster type, double zone type, single zone type, and others. Also, each room and entrance, office, kitchen, storage, laundry, teacher's area, and chilldren's area, need to be checked for space requirements and performances. The last step is to arrange the childcare program with the building and site plan. In conclusion childcare service quality will get better by upgrading of license regulation especially in minimum space requirements per child, corresponding with an increase in GNP and housing area per person. This is needed for childcare licensing in order to determine the quality level of childcare service.

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks (다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘)

  • 이대붕;송황준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.697-710
    • /
    • 2004
  • Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

창원지역 지하수 수질과 DRASTIC에 의한 지하수 오염취약성 평가

  • 김무진;함세영;정재열;장성;차용훈
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2004.04a
    • /
    • pp.459-462
    • /
    • 2004
  • This study assesses groundwater vulnerability to contaminants in 12 administrative districts of the city of Changwon, using DRASTIC technique. DRASTIC was originally applied to situations in which the contamination sources are at the ground surface, and the contaminants flow into the groundwater with infiltration of rainfall. However, groundwater contamination in urban areas can also be related to excessive pumping resulting in a lowering of the water level. The correlation coefficient between minimum DRASTIC indices and the degree of poor water quality for 10 districts is low as 0.40. The correlation coefficients between minimum DRASTIC indices and the groundwater discharge rate, and between minimum DRASTIC indices and well density per unit area are 0.70 and 0.87, respectively. Thus, to evaluate the potential of groundwater contamination in urban areas, it is necessary to consider other factors such as groundwater withdrawal rate and well density per unit area with ratings and weights as well as the existing six DRASTIC factors.

  • PDF

An Approximate Minimum Deficiency Ordering using Cliques (클릭을 이용한 근사최소 부족수 순서화)

  • Do Seungyong;Park Chan-Kyoo;Lee Sangwook;Park Soondal
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.386-393
    • /
    • 2003
  • For fast Cholesky factorization, it is most important to reduce the number of non-zero elements by ordering methods. Minimum deficiency ordering produces less non-zero elements. However, since it is very slow. the minimum degree algorithm is widely used. To improve the computation time, Rothberg's AMF uses an approximate deficiency instead of computing the deficiency. In this paper we present simple efficient methods to obtain a good approximate deficiency using information related to cliques. Experimental results show that our proposed method produces better ordering quality than that of AMF.

  • PDF

Developent of Scanning and Registration Methods Using Tooling Balls (툴링볼을 이용한 측정 및 레지스트레이션 방법 개발)

  • 김용환;윤정호;이관행
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.1
    • /
    • pp.60-68
    • /
    • 1999
  • In reverse engineering (RE) sustems, the quality of the data aquisition process is crucial to the accuracy of the reverse engineered three dimensional computer-aided design (CAD) model. However, these tasks are predominantly done manually, and little work has been done to improve the efficiency of scanning by determining the minimum number of scans and the optimal scanning directions. In this paper, new scanning and registration methods using tooling balls are developed to assist in determining the optimal parameter for these processes. When the object to scanned has no concavity, attaching path of the object and its bounding rectangle are used for optimal scanning and registration. Then minimum number of tooling balls and their positions are calculated automatically. In the case of concave parts, the scanning plan should include a complete scan of the concave area. With the surface normal vector and the scanning direction, the minimum degree of rotating the part can be calculated. But the maximum rotation should be restricted in order to prevent occlusion of the part. Finally tow sample part ar scanned based on the proposed methods and the results are discussed.

  • PDF

Energy Efficient IDS Node Distribution Algorithm using Minimum Spanning Tree in MANETs

  • Ha, Sung Chul;Kim, Hyun Woo
    • Smart Media Journal
    • /
    • v.5 no.4
    • /
    • pp.41-48
    • /
    • 2016
  • In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

High-Performance Reversible Data Hiding with Overflow/Underflow Avoidance

  • Yang, Ching-Yu;Hu, Wu-Chih
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.580-588
    • /
    • 2011
  • This paper proposes reversible data hiding using minimum/maximum preserved overflow/underflow avoidance (MMPOUA). The proposed MMPOUA algorithm consists of three main steps. These steps include the minimum (or maximum) pixel fixing, pixel squeezing, and pixel isolation. The aims of pixel fixing are to keep the minimum (or maximum) pixel of a host block unchanged and prevent the occurrence of overflow/underflow. Both the pixel squeezing and pixel isolation supply hiding storage while keeping the amount of distortion low. The proposed method can avoid (or significantly reduce) the overhead bits used to overcome overflow/underflow issues. At an embedding rate of 0.15 bpp, the proposed algorithm can achieve a PSNR value of 48.52 dB, which outperforms several existing reversible data hiding schemes. Furthermore, the algorithm performed well in a variety of images, including those in which other algorithms had difficulty obtaining good hiding storage with high perceived quality.

An Empirical Study of Qualities of Association Rules from a Statistical View Point

  • Dorn, Maryann;Hou, Wen-Chi;Che, Dunren;Jiang, Zhewei
    • Journal of Information Processing Systems
    • /
    • v.4 no.1
    • /
    • pp.27-32
    • /
    • 2008
  • Minimum support and confidence have been used as criteria for generating association rules in all association rule mining algorithms. These criteria have their natural appeals, such as simplicity; few researchers have suspected the quality of generated rules. In this paper, we examine the rules from a more rigorous point of view by conducting statistical tests. Specifically, we use contingency tables and chi-square test to analyze the data. Experimental results show that one third of the association rules derived based on the support and confidence criteria are not significant, that is, the antecedent and consequent of the rules are not correlated. It indicates that minimum support and minimum confidence do not provide adequate discovery of meaningful associations. The chi-square test can be considered as an enhancement or an alternative solution.

Power Quality Optimal Control of Railway Static Power Conditioners Based on Electric Railway Power Supply Systems

  • Jiang, Youhua;Wang, Wenji;Jiang, Xiangwei;Zhao, Le;Cao, Yilong
    • Journal of Power Electronics
    • /
    • v.19 no.5
    • /
    • pp.1315-1325
    • /
    • 2019
  • Aiming at the negative sequence and harmonic problems in the operation of railway static power conditioners, an optimization compensation strategy for negative sequence and harmonics is studied in this paper. First, the hybrid RPC topology and compensation principle are analyzed to obtain different compensation zone states and current capacities. Second, in order to optimize the RPC capacity configuration, the minimum RPC compensation capacity is calculated according to constraint conditions, and the optimal compensation coefficient and compensation angle are obtained. In addition, the voltage unbalance ${\varepsilon}_U$ and power factor requirements are satisfied. A PSO (Particle Swarm Optimization) algorithm is used to calculate the three indexes for minimum compensating energy. The proposed method can precisely calculate the optimal compensation capacity in real time. Finally, MATLAB simulations and an experimental platform verify the effectiveness and economics of the proposed algorithm.