• Title/Summary/Keyword: File length

Search Result 146, Processing Time 0.023 seconds

An Automated Code Generation for Both Improving Performance and Detecting Error in Self-Adaptive Modules (자가 적응 모듈의 성능 개선과 오류 탐지를 위한 코드 자동 생성 기법)

  • Lee, Joon-Hoon;Park, Jeong-Min;Lee, Eun-Seok
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.9
    • /
    • pp.538-546
    • /
    • 2008
  • It has limits that system administrator deals with many problems occurred in systems because computing environments are increasingly complex. It is issued that systems have an ability to recognize system's situations and adapt them by itself in order to resolve these limits. But it requires much experiences and knowledge to build the Self-Adaptive System. The difficulty that builds the Self-Adaptive System has been problems. This paper proposes a technique that generates automatically the codes of the Self-Adaptive System in order to make the system to be built more easily. This Self-Adaptive System resolves partially the problems about ineffectiveness of the exceeded usage of the system resource that was previous research's problem and incorrect operation that is occurred by external factors such as virus. In this paper, we applied the proposed approach to the file transfer module that is in the video conferencing system in order to evaluate it. We compared the length of the codes, the number of Classes that are created by the developers, and development time. We have confirmed this approach to have the effectiveness.

Data Analysis for Structural Design of Pleurotus Eryngii Cultivation Facilities (큰느타리버섯 재배사의 구조설계용 자료 분석)

  • Suh, Won-Myung;Yoon, Yong-Cheol
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.47 no.3
    • /
    • pp.29-37
    • /
    • 2005
  • This study was carried out to file up structural design data for optimizing Pleurotus eryngii growing houses. Design data are including current farm status of Pleurotus eryngii growing houses in the aspect of structural configuration as well as environmental conditions to be controlled and maintained inside. A structural analysis was performed for the on-farm structures as well as some structures modified and suggested through field survey and analysis. The results are summarized as follows. According to the results of status analysis, Pleurotus eryngii growing houses were categorized as arch-roofed simple type and sandwich panel type. Though the size of Pleurotus eryngii cultivation facilities were considerably diverse, the basic dimensions of Pleurotus eryngii cultivation facilities showed relatively similar pattern: more or less of 20m of length, $6.6\~7.0m$ of width, $4.6\~5.0m$ of peak height, $1.2\~1.6m$ of bed width, and 4 layers of bed. In the aspect of spatial use of cultivation facilities, suggested models were shown to be mostly reasonable in the aspect of heating and cooling, micro-meteorological stability, land use efficiency per unit floor area, etc.. Especially, the standard models suggested so far were thought to be not efficient in its surface area and spatial volume per unit floor area as well as its uneffective structural design in the area around ceiling. In the results of structural analysis for the models suggested through this study by using those section frames to be found on farms, the panel type structures of both single span and double span were estimated to be over designed, whereas arch-roofed pipe houses were mostly found to be under-designed.

A Bitmap Index for Chunk-Based MOLAP Cubes (청크 기반 MOLAP 큐브를 위한 비트맵 인덱스)

  • Lim, Yoon-Sun;Kim, Myung
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.225-236
    • /
    • 2003
  • MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

A Study on the Robust Content-Based Musical Genre Classification System Using Multi-Feature Clustering (Multi-Feature Clustering을 이용한 강인한 내용 기반 음악 장르 분류 시스템에 관한 연구)

  • Yoon Won-Jung;Lee Kang-Kyu;Park Kyu-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.115-120
    • /
    • 2005
  • In this paper, we propose a new robust content-based musical genre classification algorithm using multi-feature clustering(MFC) method. In contrast to previous works, this paper focuses on two practical issues of the system dependency problem on different input query patterns(or portions) and input query lengths which causes serious uncertainty of the system performance. In order to solve these problems, a new approach called multi-feature clustering(MFC) based on k-means clustering is proposed. To verify the performance of the proposed method, several excerpts with variable duration were extracted from every other position in a queried music file. Effectiveness of the system with MFC and without MFC is compared in terms of the classification accuracy. It is demonstrated that the use of MFC significantly improves the system stability of musical genre classification performance with higher accuracy rate.

History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows (다수의 병렬 TCP Flow를 가진 스테이션에 의한 대역폭 독점을 감소시키는 History-Aware RED)

  • Jun, Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1254-1260
    • /
    • 2009
  • This paper proposes history-aware random early detection (HRED), a modified version of RED, to lessen bandwidth monopoly by a few of stations employing multiple parallel TCP flows. Stations running peer-to-peer file sharing applications such as BitTorrent use multiple TCP flows. If those stations share a link with other stations with only a small number of TCP flows, the stations occupy most of link bandwidth leading to undesirable bandwidth monopoly. HRED like RED determines whether to drop incoming packets according to probability which changes based on queue length. However it adjusts the drop probability based on bandwidth occupying ratio of stations, thus able to impose harder drop penalty on monopoly stations. The results of simulations assuming various scenarios show that HRED is at least 60% more effective than RED in supporting the bandwidth fairness among stations and at least 4% in utilization.

Design of a high-performance floating-point unit adopting a new divide/square root implementation (새로운 제산/제곱근기를 내장한 고성능 부동 소수점 유닛의 설계)

  • Lee, Tae-Young;Lee, Sung-Youn;Hong, In-Pyo;Lee, Yong-Surk
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.12
    • /
    • pp.79-90
    • /
    • 2000
  • In this paper, a high-performance floating point unit, which is suitable for high-performance superscalar microprocessors and supports IEEE 754 standard, is designed. Floating-point arithmetic unit (AU) supports all denormalized number processing through hardware, while eliminating the additional delay time due to the denormalized number processing by proposing the proposed gradual underflow prediction (GUP) scheme. Contrary to the existing fixed-radix implementations, floating-point divide/square root unit adopts a new architecture which determines variable length quotient bits per cycle. The new architecture is superior to the SRT implementations in terms of performance and design complexity. Moreover, sophisticated exception prediction scheme enables precise exception to be implemented with ease on various superscalar microprocessors, and removes the stall cycles in division. Designed floating-point AU and divide/square root unit are integrated with and instruction decoder, register file, memory model and multiplier to form a floating-point unit, and its function and performance is verified.

  • PDF

Three Dimension Car Body Measuring System Using Industrial Robots (산업용 로봇을 이용한 3차원 차체측정 시스템)

  • Kim, Mun-Sang;Cho, Kyung-Rae;Park, Kang;Shin, Hyun-Oh
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.8
    • /
    • pp.2555-2560
    • /
    • 1996
  • Inspecting the dimensional accuracy of a car-body in assembly line is a very important process to assure high productivity. Now there exist two common inspecting methods in practice. One is to measure a sampled car-body with three dimensional measuring machine, and the other is to measure car-body with three dimensional measuring machine, and the other is to measure car-body in assembly line using many sensors fixed to a large jig frame. The formal method takes too long to inspect a sampled car-body of a same sort, and cannot therefore give an useful error trend for the whole production. On the other hand, the latter lacks flexibility and is very cost-intensive. By using industrial robots and sensors, an in-line Car-Body Measuring(CBM) system which ensured high flexiblity and sufficient accuracy was developed. This CBM cell operates in real production line and measures the check points by the non-contact type using camera and laser displacement sensor(LDS). This system can handle about 15 Measuring points within a cycle time of 40 seconds. A process computer controls whole process such as data acquisition file handling and data analysis. Robot arms changes in length due to ambient temperature fluctuation affecting the measuring accuracy. To compensate this error, a robot arm calibration process was developed.

Development of Image Guided 3D Localization Program for Stereotactic Brain Biopsy (뇌 정위 생검술을 위한 영상지원 3차원 국재 프로그램 개발)

  • Lee Do Heui;Lee Dong Joon
    • Progress in Medical Physics
    • /
    • v.15 no.4
    • /
    • pp.197-201
    • /
    • 2004
  • Stereotactic brain biopsy using stereotactic head frame such as CRW (Radionics, USA) has demonstrated a precise lesion localizing accuracy. In this study, we developed the target point calculation program for brain lesion biopsy using CRW stereotactic head frame and designed a phantom for verify the new developed program. The phantom was designed to have capability to simulate clinical stereotactic brain biopsy. The phantom has 10 vertical rods whose diameters are 6mm and tip of each rods are 2mm. Each rod has different length, 150 mm x 4 ea, 130 mm x 4 ea, 110 mm x 2 ea. CT images were acquired with Simens CT scanner as continuous transverse slice, 1 mm thickness in a 25 cm field of view and stored in a dicom file as a 256 x 256 matrix. As a result, the developed new target localization program will be useful for planning and training in complicated 3 dimensional stereotactic brain biopsy.

  • PDF

Evaluating Village-based Resources for Conserving Nakdong-Jeongmaek (낙동정맥 보전을 위한 마을기반 자원평가)

  • Kim, Tae-Su;Hwang, Shin-Hee;Cho, Ki Hwan;Kim, Su-Jin;Jang, Gab-Sue
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.23 no.4
    • /
    • pp.47-58
    • /
    • 2020
  • This study was done to evaluate resources distributed around the Nakdong-Jeongmaek which is the eastern ridge line of the Nakdong-river basin with 437km in length. Here we found and/or searched for thousands of resources within each of 210 villages around the ridge, which were divided into six categories including landscape, natural park, protected area, history, tourism and biodiversity. An inventory was also created using an attribute table in a shape file for identifying the spatial location and property for every resource existing in each village. Each of fields for six-typed resources has 210 records representing each village and resources within it. If a resource exists in a village, '1' is assigned for its existence in its corresponding record. Otherwise, '0' is assigned for its non-existence in the record. The number of '1' on six records for a village is meaning the number of resources contained within a village, which can be a barometer to decide the properties of each village. In this study, we found five core villages containing all kind of resources in it, while 52 villages were found having only a single type of resources within it. The other villages were known to have multiple resources like having two or more ones.

Development of Estimation Method for Degree of Congestion on Expressway Using VMS Information (고속도로 VMS 정보를 활용한 지정체도 산출방안 개발)

  • Lee, Seung-Jun;Park, Jae-Beom;Kim, Soo-Hee;Bok, Ki-Chan
    • International Journal of Highway Engineering
    • /
    • v.11 no.1
    • /
    • pp.25-36
    • /
    • 2009
  • Everyday congestion length (distance) and duration (time) data are collected and recorded in Expressway Traffic Information Center. These records are based on the information that the operators watch CCTV and decide traffic condition in order to present information about congestion on VMS. Using VMS message has some merits like that it doesn't need a great lot of cost to construct hardware such like FTMS because operators can check traffic condition by watching CCTV only. Of cause in the aspect of accuracy, using VMS message has the limitation that it is based on subject decision compared with FTMS. However, it can be said that the value of using VMS message is very large. The object of this study is to use the VMS information record (log file) usefully to provide information of traffic condition on expressway for users (drivers) without keeping the VMS information record in dead storage. To do so, in this research, congestion calculation method able to understand traffic congestion condition on expressway was developed.

  • PDF