• Title/Summary/Keyword: Data Partitioning

Search Result 389, Processing Time 0.03 seconds

An Energy-Efficient Clustering Using Division of Cluster in Wireless Sensor Network (무선 센서 네트워크에서 클러스터의 분할을 이용한 에너지 효율적 클러스터링)

  • Kim, Jong-Ki;Kim, Yoeng-Won
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.43-50
    • /
    • 2008
  • Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

  • PDF

Dynamic Block Reassignment for Load Balancing of Block Centric Graph Processing Systems (블록 중심 그래프 처리 시스템의 부하 분산을 위한 동적 블록 재배치 기법)

  • Kim, Yewon;Bae, Minho;Oh, Sangyoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.5
    • /
    • pp.177-188
    • /
    • 2018
  • The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

Changes and Improvements of the Standardized Eddy Covariance Data Processing in KoFlux (표준화된 KoFlux 에디 공분산 자료 처리 방법의 변화와 개선)

  • Kang, Minseok;Kim, Joon;Lee, Seung-Hoon;Kim, Jongho;Chun, Jung-Hwa;Cho, Sungsik
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.20 no.1
    • /
    • pp.5-17
    • /
    • 2018
  • The standardized eddy covariance flux data processing in KoFlux has been updated, and its database has been amended accordingly. KoFlux data users have not been informed properly regarding these changes and the likely impacts on their analyses. In this paper, we have documented how the current structure of data processing in KoFlux has been established through the changes and improvements to ensure transparency, reliability and usability of the KoFlux database. Due to increasing diversity and complexity of flux site instrumentation and organization, we have re-implemented the previously ignored or simplified procedures in data processing (e.g., frequency response correction, stationarity test), and added new methods for $CH_4$ flux gap-filling and $CO_2$ flux correction and partitioning. To evaluate the effects of the changes, we processed the data measured at a flat and homogeneous paddy field (i.e., HPK) and a deciduous forest in complex and heterogeneous topography (i.e., GDK), and quantified the differences. Based on the results from our overall assessment, it is confirmed that (1) the frequency response correction (HPK: 11~18% of biases for annually integrated values, GDK: 6~10%) and the stationarity test (HPK: 4~19% of biases for annually integrated values, GDK: 9~23%) are important for quality control and (2) the minimization of the missing data and the choice of the appropriate driver (rather than the choice of the gap-filling method) are important to reduce the uncertainty in gap-filled fluxes. These results suggest the future directions for the data processing technology development to ensure the continuity of the long-term KoFlux database.

Antioxidative Activities and Components of Gardenia jasminoides (치자의 항산화 활성 및 활성성분의 분리)

  • Yang, Hye-Jung;Park, Mi-Jung;Lee, Heum-Sook
    • Korean Journal of Food Science and Technology
    • /
    • v.43 no.1
    • /
    • pp.51-57
    • /
    • 2011
  • From the total methanolic extract of Gardenia jasminoides (Rubiaceae), various antioxidative characteristics were identified in terms of nitrite scavenging ability, 2,2'-azino-bis (3-ethylbenzthiazoline-6-sulphonic acid) (ABTS) radical cation inhibition, superoxide dismutase (SOD)-like activity, and elongation effect of lipid peroxidation using Rancimat. After successive partitioning with n-hexane, chloroform, n-butanol, and water, potent nitrite scavenging abilities were shown in the n-butanol fraction and water fraction, and $IC_{50}$ values were 183 ppm and 194 ppm, respectively. As for ABTS radical cation inhibition, the chloroform fraction was most potent and its $IC_{50}$ was 159 ppm. SOD-like activity was slightly low in all of the fractions. The elongation effect of lipid peroxidation also increased dose-dependently and the antioxidative index (AI) of the total methanolic extract was 2.93 in 1000 ppm, which was more effective than 1.66 of butylated hydroxy anisol in the same concentration. The compounds I and II were isolated through silica gel column chromatography of the active fractions, and identified as geniposide and crocin, respectively, by $^1H-NMR$ spectral data. The $IC_{50}$ values for the nitrite scavenging abilities of geniposide and crocin were 940 ppm and 77 ppm, respectively. In ABTS radical cation inhibition, the $IC_{50}$ values of geniposide and crocin were 684 ppm and 549 ppm, respectively. And the $EC_{50}$ value for SOD-like activity of crocin was 259 ppm, which was much smaller than 453 ppm by the positive control, chlorogenic acid. The $EC_{50}$ value of geniposide could not be identified.

Relative importance of climatic and habitat factors on plant richness along elevation gradients on the Mt. Baekhwa, South Korea (백화산 고도별 식물 종풍부도에 대한 기후 및 서식지 인자의 상대적 중요성)

  • Lee, Chang-Bae;Chun, Jung-Hwa
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.20 no.3
    • /
    • pp.233-242
    • /
    • 2018
  • This study explored the richness patterns of vascular plant species and evaluated the effects of the climatic and habitat variables on the observed patterns along elevational gradients on the Mt. Baekhwa, South Korea. Plant data were recorded from 70 plots and a total of 187 plant species with 78 woody and 109 herbaceous species were recorded along two study transects, the Banyasa and Bohyunsa transects, on the Mt. Baekhwa. A total of 154 plant species with 66 woody and 88 herbaceous species and 131 plant species with 58 woody and 73 herbaceous species were recorded along the Banyasa and Bohyunsa transects, respectively. We used simple ordinary least squares regression model, multi-model inference and variation partitioning to analyze the relative contribution of climatic and habitat variables on the elevational richness patterns. Species richness pattern for vascular plants along the Banyasa transect monotonically decreased with elevation, whereas plant species richness showed reversed hump-shaped pattern along the Bohyunsa transect. Although the elevational patterns of species richness for vascular plants were different between the both transects, habitat variables are more important predictors than climatic variables for the elevational patterns of plant species richness along our study transects on the Mt. Baekhwa. These results indicate that elevational diversity patterns of vascular plants may be different even between nearby elevational transects in a mountain ecosystem but the diversity patterns may be controlled by same drivers.

Efficient Policy for ECC Parity Storing of NAND Flash Memory (낸드플래시 메모리의 효율적인 ECC 패리티 저장 방법)

  • Kim, Seokman;Oh, Minseok;Cho, Kyoungrok
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.10
    • /
    • pp.477-482
    • /
    • 2016
  • This paper presents a new method of parity storing for ECC(error correcting code) in SSD (solid-state drive) and suitable structure of the controller. In general usage of NAND flash memory, we partition a page into data and spare area. ECC parity is stored in the spare area. The method has overhead on area and timing due to access of the page memory discontinuously. This paper proposes a new parity policy storing method that reduces overhead and R(read)/W(write) timing by using whole page area continuously without partitioning. We analyzed overhead and R/W timing. As a result, the proposed parity storing has 13.6% less read access time than the conventional parity policy with 16KB page size. For 4GB video file transfer, it has about a minute less than the conventional parity policy. It will enhance the system performance because the read operation is key function in SSD.

Analysis method of patent document to Forecast Patent Registration (특허 등록 예측을 위한 특허 문서 분석 방법)

  • Koo, Jung-Min;Park, Sang-Sung;Shin, Young-Geun;Jung, Won-Kyo;Jang, Dong-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.4
    • /
    • pp.1458-1467
    • /
    • 2010
  • Recently, imitation and infringement rights of an intellectual property are being recognized as impediments to nation's industrial growth. To prevent the huge loss which comes from theses impediments, many researchers are studying protection and efficient management of an intellectual property in various ways. Especially, the prediction of patent registration is very important part to protect and assert intellectual property rights. In this study, we propose the patent document analysis method by using text mining to predict whether the patent is registered or rejected. In the first instance, the proposed method builds the database by using the word frequencies of the rejected patent documents. And comparing the builded database with another patent documents draws the similarity value between each patent document and the database. In this study, we used k-means which is partitioning clustering algorithm to select criteria value of patent rejection. In result, we found conclusion that some patent which similar to rejected patent have strong possibility of rejection. We used U.S.A patent documents about bluetooth technology, solar battery technology and display technology for experiment data.

A Non-Shared Metadata Management Scheme for Large Distributed File Systems (대용량 분산파일시스템을 위한 비공유 메타데이타 관리 기법)

  • Yun, Jong-Byeon;Park, Yang-Bun;Lee, Seok-Jae;Jang, Su-Min;Yoo, Jae-Soo;Kim, Hong-Yeon;Kim, Young-Kyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.4
    • /
    • pp.259-273
    • /
    • 2009
  • Most of large-scale distributed file systems decouple a metadata operation from read and write operations for a file. In the distributed file systems, a certain server named a metadata server (MDS) maintains metadata information in file system such as access information for a file, the position of a file in the repository, the namespace of the file system, and so on. But, the existing systems used restrictive metadata management schemes, because most of the distributed file systems designed to focus on the distributed management and the input/output performance of data rather than the metadata. Therefore, in the existing systems, the metadata throughput and expandability of the metadata server are limited. In this paper, we propose a new non-shared metadata management scheme in order to provide the high metadata throughput and scalability for a cluster of MDSs. First, we derive a dictionary partitioning scheme as a new metadata distribution technique. Then, we present a load balancing technique based on the distribution technique. It is shown through various experiments that our scheme outperforms existing metadata management schemes in terms of scalability and load balancing.

Rational budgeting approach as a nutrient management tool for mixed crop-swine farms in Korea

  • Reza, Arif;Shim, Soomin;Kim, Seungsoo;Ahn, Sungil;Won, Seunggun;Ra, Changsix
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.33 no.9
    • /
    • pp.1520-1532
    • /
    • 2020
  • Objective: Due to rapid economic return, mixed crop-swine farming systems in Korea have become more intensive. Intensive farming practices often cause nutrient surpluses and lead to environmental pollution. Nutrient budgets can be used to evaluate the environmental impact and as a regulatory policy instrument for nutrient management. This study was conducted to select a nutrient budgeting approach applicable to the mixed crop-swine farms in Korea and suggest an effective manure treatment method to reduce on-farm nutrient production. Methods: In this study, we compared current and ideal gross nutrient balance (GNB) approaches of Organisation for Economic Co-operation and Development and soil system budget (SSB) approach with reference to on-farm manure treatment processes. Data obtained from farm census and published literature were used to develop the farm nutrient budgets. Results: The average nitrogen (N) and phosphorus (P) surpluses were approximately 11 times and over 7 times respectively higher in the GNB approaches than the SSB. After solid-liquid separation of manure, during liquid composting a change in aeration method from intermittent to continuous reduced the N and P loading about 50% and 47%, respectively. Although changing in solid composting method from turning only to turning+aeration improved the N removal efficiency by 30.5%, not much improvement in P removal efficiency was observed. Conclusion: Although the GNB approaches depict the impact of nutrients produced in the mixed crop-swine farms on the overall agricultural environment, the SSB approach shows the partitioning among different nutrient loss pathways and storage of nutrients within the soil system; thus, can help design sustainable nutrient management plans for the mixed cropswine farms. The study also suggests that continuous aeration for liquid composting and turning+aeration for solid composting can reduce nutrient loading to the soil.

Service Identification of Component-Based System for Service-Oriented Architecture (서비스 지향 아키텍처를 위한 컴포넌트기반 시스템의 서비스 식별)

  • Lee, Hyeon-Joo;Choi, Byoung-Ju;Lee, Jung-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.2
    • /
    • pp.70-80
    • /
    • 2008
  • Today, businesses have to respond with flexibility and speed to ever-changing customer demand and market opportunities. Service-oriented architecture (SOA) is the best methodology for minimizing the complexity and the cost of enterprise-level infrastructure and for maximizing the productivity and the flexibility of an enterprise. Most of the enterprise-level SOA delivery strategies deal with the top-down approach, which organization has to define the business processes, to model business services, and to find the required services or to develop new services. However, a lot of peoples want to maximally reuse legacy component-based systems as well as to deliver SOA into their organizations. In this paper, we propose a bottom-up approach for identifying business services with proper granularity. It can improve the reusability and maintenance of services by considering not data I/O of components of legacy applications but GUI event patterns. Our proposed method is applied to MIS with 129 GUIs and 13 components. As a result, the valiance of the coupling value of components is increased five times and three business services are distinctly exposed. It also provides a 49% improvement in reducing the relationship problems between services over a service identification method using only partitioning information of components.