• 제목/요약/키워드: Data placement

검색결과 611건 처리시간 0.079초

인공어초의 최적 배치모델 구축에 관한 연구 (A study on the optimal placement model building of artificial reef)

  • 손병규;정성재
    • 수산해양기술연구
    • /
    • 제53권2호
    • /
    • pp.160-168
    • /
    • 2017
  • In this study, we propose a method of optimal placement technique of artificial reef considering characteristics of sea areas and provide basic data for efficient budget execution. In addition, we will contribute to increasing the economic efficiency by improving the fisheries productivity by suggesting the scientific basis for the policy data and the increase of the catch through the resource creation based on the ecological information about the biology. Especially, in order to establish the effective disposition (optimum separation distance) of artificial reef considering characteristics of biological and engineering factors, it is necessary to review the artificial reef installation management regulations and investigate the biological effects of artificial reef facilities, is needed. Through this, it is expected that the ground data of the direction of the policy promotion will be derived by suggesting the placement condition of the artificial reef complex which can maximize the resource composition effect according to the target fish species.

Adaptive and optimized agent placement scheme for parallel agent-based simulation

  • Jin, Ki-Sung;Lee, Sang-Min;Kim, Young-Chul
    • ETRI Journal
    • /
    • 제44권2호
    • /
    • pp.313-326
    • /
    • 2022
  • This study presents a noble scheme for distributed and parallel simulations with optimized agent placement for simulation instances. The traditional parallel simulation has some limitations in that it does not provide sufficient performance even though using multiple resources. The main reason for this discrepancy is that supporting parallelism inevitably requires additional costs in addition to the base simulation cost. We present a comprehensive study of parallel simulation architectures, execution flows, and characteristics. Then, we identify critical challenges for optimizing large simulations for parallel instances. Based on our cost-benefit analysis, we propose a novel approach to overcome the performance constraints of agent-based parallel simulations. We also propose a solution for eliminating the synchronizing cost among local instances. Our method ensures balanced performance through optimal deployment of agents to local instances and an adaptive agent placement scheme according to the simulation load. Additionally, our empirical evaluation reveals that the proposed model achieves better performance than conventional methods under several conditions.

대규모 VOD서버에서의 DISK I/O SUB SYSTEM의 구현 (Implementation of Disk I/O Sub System in Large Scale Video On Demand Sewer)

  • 선창우;최경희;정기현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.1053-1056
    • /
    • 1999
  • Video On Demand servers generally require massive disk storages for storing many video data. Many researches have been done on the topics of efficient allocation of movies in disks. This paper, We describe efficient disk placement techniques and implement storage system with SCSI and PCI Bus interface for efficient data handling. This paper also proposes a logical zone reconstruction method for the SCAN data placement technique. The proposed method reconstructs physical zones into logical zones by split and merge operations.

  • PDF

Study of Data Placement Schemes for SNS Services in Cloud Environment

  • Chen, Yen-Wen;Lin, Meng-Hsien;Wu, Min-Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.3203-3215
    • /
    • 2015
  • Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

Optimal sensor placement for structural health monitoring based on deep reinforcement learning

  • Xianghao Meng;Haoyu Zhang;Kailiang Jia;Hui Li;Yong Huang
    • Smart Structures and Systems
    • /
    • 제31권3호
    • /
    • pp.247-257
    • /
    • 2023
  • In structural health monitoring of large-scale structures, optimal sensor placement plays an important role because of the high cost of sensors and their supporting instruments, as well as the burden of data transmission and storage. In this study, a vibration sensor placement algorithm based on deep reinforcement learning (DRL) is proposed, which can effectively solve non-convex, high-dimensional, and discrete combinatorial sensor placement optimization problems. An objective function is constructed to estimate the quality of a specific vibration sensor placement scheme according to the modal assurance criterion (MAC). Using this objective function, a DRL-based algorithm is presented to determine the optimal vibration sensor placement scheme. Subsequently, we transform the sensor optimal placement process into a Markov decision process and employ a DRL-based optimization algorithm to maximize the objective function for optimal sensor placement. To illustrate the applicability of the proposed method, two examples are presented: a 10-story braced frame and a sea-crossing bridge model. A comparison study is also performed with a genetic algorithm and particle swarm algorithm. The proposed DRL-based algorithm can effectively solve the discrete combinatorial optimization problem for vibration sensor placements and can produce superior performance compared with the other two existing methods.

에너지 절약을 위한 서버 데이터 배치 기법 (Server Data Placement for Energy Saving)

  • 이경진;김은삼
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2017년도 제55차 동계학술대회논문집 25권1호
    • /
    • pp.195-196
    • /
    • 2017
  • 본 논문에서는 멀티미디어 서버에서 특정 서버를 즉시 종료함으로써 에너지를 절약하는 기법을 제안한다. 본 논문에서 제안하는 서버 데이터 배치 기법은 현재 시스템의 부하를 파악하여 부하가 줄어들게 되어 특정 서버를 종료하여도 요청 부하를 충분히 서비스 가능할 경우 서버를 종료한다. 반대로 부하가 증가하게 되어 추가의 서버 사용이 필요하게 되면 서버의 전원을 켬으로써 서비스가 가능하도록 한다. 따라서 멀티미디어 서버의 성능을 최대한 유지하면서 에너지 소비를 크게 절약할 수 있다.

  • PDF

랜덤화 블록 계획법에서 위치를 이용한 비모수 검정법 (Nonparametric method using placement in a randomized complete block design)

  • 심수진;김동재
    • Journal of the Korean Data and Information Science Society
    • /
    • 제24권6호
    • /
    • pp.1401-1408
    • /
    • 2013
  • 반복이 있는 랜덤화 블록 계획법에서 우산형 대립가설을 검정하기 위한 비모수 방법에는 Kim과 Kim (1992)이 제안한 방법이 있다. 본 논문에서는 Orban과 Wolfe (1982)가 제안한 위치와 Kim (1999)이 제안한 대조군과 처리군의 방법을 확장하여 랜덤화 블록 계획법에서 우산형 대립가설에서의 검정법을 제안하였다. 또한 여러 분포에 대한 모의실험 통하여 기존의 방법과의 검정력을 비교하였다.

Sensor placement strategy for high quality sensing in machine health monitoring

  • Gao, Robert X.;Wang, Changting;Sheng, Shuangwen
    • Smart Structures and Systems
    • /
    • 제1권2호
    • /
    • pp.121-140
    • /
    • 2005
  • This paper presents a systematic investigation of the effect of sensor location on the data quality and subsequently, on the effectiveness of machine health monitoring. Based on an analysis of the signal propagation process from the defect location to the sensor, numerical simulations using finite element modeling were conducted on a bearing test bed to determine the signal strength at several representative sensor locations. The results showed that placing sensors closely to the machine component being monitored is critical to achieving high signal-to-noise ratio, thus improving the data quality. Using millimeter-sized piezoceramic plates, the obtained results were evaluated experimentally. A comparison with a set of commercial vibration sensors verified the developed structural dynamics-based sensor placement strategy. It further demonstrated that the proposed shock wave-based sensing technique provided an effective alternative to vibration measurement, while requiring less space for sensor installation.

에너지 균형비와 중계노드 위치를 함께 고려한 센서 네트워크의 에너지 소비 최소화 (Minimizing Energy Consumption of Sensor Networks with Energy Balance Ratio and Relay Node Placement)

  • 손석원;한광록
    • 한국산학기술학회논문지
    • /
    • 제10권7호
    • /
    • pp.1549-1555
    • /
    • 2009
  • 무선센서 네트워크에서 노드들의 데이터를 수집하고 기지국에 전달하는 중계노드의 위치(Relay Node Placement)를 구하는 문제는 전체 네트워크의 생존시간에 관련되어 있기 때문에 매우 중요하다. 중계노드 위치문제는 전체 네트워크의 센서노드에서 소비되는 에너지를 최소화시키는데 그 초점이 맞추어져 있다. 그러나 중계노드 위치와 센서노드와의 거리가 모두 다르므로 센서노드에서 소비되는 에너지의 불균형이 초래된다. 본 논문에서는 클러스터링 모델에서 에너지 균형비(Energy Balance Ratio)라는 개념을 제안하고 이 에너지 균형비를 최대화시키는 목적함수를 사용하여 중계노드의 위치를 구한다. 에너지 균형비를 최대화시키는 것은 클러스터에 할당된 센서노드들의 에너지 소비를 클러스터 간에 균형 잡히게 한다. 이것은 궁극적으로 대규모 센서 네트워크의 에너지 소비를 최소화시켜서 네트워크 생존기간을 최대화시키는 효과가 있다. 그러나 이 문제의 해를 구하는 것은 NP-hard 문제이므로 완전해(Exact Solution) 를 구하는 것은 현실적으로 힘들다. 따라서 제약프로그래밍 방법을 사용하여 에너지 균형비와 중계노드 위치를 함께 고려하는 EBR-RNP 문제로 모델링하여 근사해를 구한다.

Effectiveness and Complication Rate of Percutaneous Endoscopic Gastrostomy Placement in Pediatric Oncology Patients

  • Kidder, Molly;Phen, Claudia;Brown, Jerry;Kimsey, Kathryn;Oshrine, Benjamin;Ghazarian, Sharon;Mateus, Jazmine;Amankwah, Ernest;Wilsey, Michael
    • Pediatric Gastroenterology, Hepatology & Nutrition
    • /
    • 제24권6호
    • /
    • pp.546-554
    • /
    • 2021
  • Purpose: Malnutrition is a significant issue for pediatric patients with cancer. We sought to evaluate the effectiveness and complication rate of percutaneous endoscopic gastrostomy (PEG) placement in pediatric oncology patients. Methods: A retrospective chart review was performed on 49 pediatric oncology patients undergoing PEG placement at Johns Hopkins All Children's Hospital between 2000 and 2016. Demographic and clinical characteristics, complications, absolute neutrophil count at time of PEG placement and at time of complications, length of stay, and mortality were identified. Weight-for-age Z-scores were evaluated at time of- and six months post-PEG placement. Results: The overall mean weight-for-age Z-score improved by 0.73 (p<0.0001) from pre- (-1.11) to post- (-0.38) PEG placement. Improvement in Z-score was seen in patients who were malnourished at time of PEG placement (1.14, p<0.0001), but not in those who were not malnourished (0.32, p=0.197). Site infections were seen in 12 (24%), buried bumper syndrome in five (10%), and tube dislodgement in one (2%) patient. One patient (2%) with fever was treated for possible peritonitis. There were no cases of other major complications, including gastric perforation, gastrocolic fistula, clinically significant bleeding, or PEG-related death documented. Conclusion: Consistent with previous studies, our data suggests a relationship between site complications (superficial wound infection, buried bumper syndrome) and neutropenia. Additionally, PEG placement appears to be an effective modality for improving nutritional status in malnourished pediatric oncology patients. However, larger prospective studies with appropriate controls and adjustment for potential confounders are warranted to confirm these findings.