• Title/Summary/Keyword: Single allocation

Search Result 297, Processing Time 0.028 seconds

How to design in situ studies: an evaluation of experimental protocols

  • Sung, Young-Hye;Kim, Hae-Young;Son, Ho-Hyun;Chang, Juhea
    • Restorative Dentistry and Endodontics
    • /
    • v.39 no.3
    • /
    • pp.164-171
    • /
    • 2014
  • Objectives: Designing in situ models for caries research is a demanding procedure, as both clinical and laboratory parameters need to be incorporated in a single study. This study aimed to construct an informative guideline for planning in situ models relevant to preexisting caries studies. Materials and Methods: An electronic literature search of the PubMed database was performed. A total 191 of full articles written in English were included and data were extracted from materials and methods. Multiple variables were analyzed in relation to the publication types, participant characteristics, specimen and appliance factors, and other conditions. Frequencies and percentages were displayed to summarize the data and the Pearson's chi-square test was used to assess a statistical significance (p < 0.05). Results: There were many parameters commonly included in the majority of in situ models such as inclusion criteria, sample sizes, sample allocation methods, tooth types, intraoral appliance types, sterilization methods, study periods, outcome measures, experimental interventions, etc. Interrelationships existed between the main research topics and some parameters (outcome measures and sample allocation methods) among the evaluated articles. Conclusions: It will be possible to establish standardized in situ protocols according to the research topics. Furthermore, data collaboration from comparable studies would be enhanced by homogeneous study designs.

Railway Timetable Considering Optimal Path Finding Method in Rail Network (Focused on Revenue Allocation) (열차스케줄을 고려한 도시철도 이용객의 통행행태 추정 (수입금 정산사례를 중심으로))

  • Lee, Chang-Hun;Shin, Seong-Il;Kim, Si-Gon
    • Journal of the Korean Society for Railway
    • /
    • v.18 no.2
    • /
    • pp.149-156
    • /
    • 2015
  • It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

Optimization of Multiple Tower Cranes and Material Stockyards Layout (다중 양중장비와 자재 야적 위치의 최적 결정을 위한 모델 개발)

  • Kim, Kyong-Ju;Kim, Kyoung-Min;Lee, Sang-Kyu
    • Korean Journal of Construction Engineering and Management
    • /
    • v.10 no.6
    • /
    • pp.127-134
    • /
    • 2009
  • This study aims to provide an optimal model for the layout of multiple tower cranes and material stockyards which have multiple candidate positions. In a high-rise building construction, the positional allocation of tower cranes and material stockyard has an effect on the travel time of material hauling. In addition, in case of using multiple tower cranes, specific location of a tower crane allocated to each material determines the efficiency of the works. Current optimal model limited to the optimization of position of single tower crane and material stockyards. This study suggests optimal model both for the positions of multiple tower cranes and material stockyards. Layout of multiple tower cranes requires additional allocation of each crane to each material hauling and control on the minimum distance between tower cranes. This optimization model utilizes genetic algorithm to deal with complex interaction on the candidate positions of multiple tower cranes, material stockyards, and types of materials. In order to identify its utility, case study was performed.

Performance Evaluation of PEP Based on Cross-Layer in Satellite Communication System (위성 통신에서 Cross-layer 기반 PEP 성능 평가)

  • Kim, Jong-Mu;Nathnael, Gebregziabher W.;Lee, Kyu-Hyan;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.58-65
    • /
    • 2016
  • Satellite communication is a wide area network (WAN) which provides communication service worldwide. However, the performance of TCP can be seriously degraded in the satellite networks due to limited bandwidth, long round-trip time (RTT) and high bit error rate (BER) over satellite links. In order to improve the performance of TCP, this paper proposes cross-layer Performance Enhancing Proxy (PEP) in digital video broadcasting-return channel via satellite (DVB-RCS) networks. The proposed protocol sets TCP Congestion Window (CWND) size by using satellite resource allocation information exchanged between TCP and the link-layer. we implement PEP testbed based on Linux to evaluate the performance of the proposed protocol. The simulation results show that the proposed protocol performs better than standard TCP both in single and multiple sessions in variant BER, because the proposed protocol sets TCP CWND size by using satellite resource allocation.

Efficient Radio Resource Allocation for Cognitive Radio Based Multi-hop Systems (다중 홉 무선 인지 시스템에서 효과적인 무선 자원 할당)

  • Shin, Jung-Chae;Min, Seung-Hwa;Cho, Ho-Shin;Jang, Youn-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5A
    • /
    • pp.325-338
    • /
    • 2012
  • In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

A Study on Traffic Analysis and Hierarchical Program Allocation for Distributed VOD Systems (분산 VOD 시스템의 트래픽 분석과 계층적 프로그램 저장에 관한 연구)

  • Lee, Tae-Hoon;Kim, Yong-Deak
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2080-2091
    • /
    • 1997
  • It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in the emerging broadband integrated services digital networks. A centralized VOD system, all programs are stored in a single VOD server which is linked to each user via exchanges, is applicable when a small number of users enjoys the VOD service. However, in case of large service penetration, it is very important to solve the problems of bandwidth and load concentrating in the central video server(CVS) and program transmission network. In this paper, the architecture of the video distribution service network is studied, then a traffic characteristics and models for VOD system are established, and proposed program allocation method to video servers. For this purpose, we present an analysis of program storage amount in each LVS(Local Video Server), transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVS, vision probability, etc. A method for finding out storage capacity in LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

  • PDF

Stochastic Optimization Method Using Gradient Based on Control Variates (통제변수 기반 Gradient를 이용한 확률적 최적화 기법)

  • Kwon, Chi-Myung;Kim, Seong-Yeon
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.2
    • /
    • pp.49-55
    • /
    • 2009
  • In this paper, we investigate an optimal allocation of constant service resources in stochastic system to optimize the expected performance of interest. For this purpose, we use the control variates to estimate the gradients of expected performance with respect to given resource parameters, and apply these estimated gradients in stochastic optimization algorithm to find the optimal allocation of resources. The proposed gradient estimation method is advantageous in that it uses simulation results of a single design point without increasing the number of design points in simulation experiments and does not need to describe the logical relationship among realized performance of interest and perturbations in input parameters. We consider the applications of this research to various models and extension of input parameter space as the future research.

Study on a Demand Volume Estimation Method using Population Weighted Centroids in Facility Location Problems (시설물 입지에 있어 인구 중심점 개념을 이용한 수요 규모 추정 방법 연구)

  • Joo, Sung-A;Kim, Young-Hoon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.10 no.2
    • /
    • pp.11-22
    • /
    • 2007
  • This paper is to discuss analytical techniques to estimate demand sizes and volumes that determine optimal locations for multiple facilities for a given services. While demand size estimation is a core part of location modeling to enhance solution quality and practical applicability, the estimation method has been used in limited and restrict parts such as a single population centroid in a given larger census boundary area or small theoretical application experiments(e.s. census track and enumeration district). Therefore, this paper strives to develop an analytical estimation method of demand size that converts area based demand data to point based population weighted centroids. This method is free to spatial boundary units and more robust to estimate accurate demand volumes regardless of geographic boundaries. To improve the estimation accuracy, this paper uses house weighted value to the population centroid calculation process. Then the population weighted centroids are converted to individual demand points on a grid formated surface area. In turn, the population weighted centroids, demand points and network distance measures are operated into location-allocation models to examine their roles to enhance solution quality and applicability of GIS location models. Finally, this paper demonstrates the robustness of the weighted estimation method with the application of location-allocation models.

  • PDF

A Study on Centralization of the Korean Film Market : Focusing on the Supply and Consumption of the Top 100 Movies (한국 영화시장의 집중화 현상에 대한 논의 : 흥행영화의 공급과 소비를 중심으로)

  • Park, Seung-Hyun;Lee, Pu-Reum
    • Journal of Korea Entertainment Industry Association
    • /
    • v.14 no.6
    • /
    • pp.109-124
    • /
    • 2020
  • This study examines the concentration in terms of supply and consumption in the Korean movie market, focusing on screen size, nationality, and the box office. For analysis, it selects the top 100 movies in the box office each year for 15 years from 2005 to 2019. According to the result, the number of screens increased steadily every year, and the screen concentration became very high. For the top 100 movies, it increased from 12% to 30% of the total screen. It became higher in the case of the top 10 movies. As the number of screens increased, multiplex assigned more screens to one movie. Multiplex's screen allocation continued to increase, with one movie taking up more 60% of the total screen. This became more serious after 2011 and 2012. Market share of the top 100 movies accounted for about 95% of the total box office performance, even though the number of released movies is about 3,000. Whether multiplex preferred Hollywood movies or not, its screen assignment was found to favor Hollywood movies over Korean ones. In the case of film nationality, both Korean and Hollywood movies accounted for 90.7%. Two countries had a market share of 96.6%. There was no single side except Korea and the United States in the top 10. The increase in the number of screens deepened the concentration in screen allocation. The concentration in the screen allocation led to the concentration of consumption. The Korean film market is the case where the increase of movie screens did not create a diversity of supply and consumption. It also did not affect the diversity of film nationality. This research reveals that supplied concentration and consumed concentration are positively correlated, and that the former is a little lower than the latter.

Co-Writing Multiple Files Based on Directory Locality for High Performance of Small File Writes (디렉토리 지역성을 활용한 작은 파일들의 모아 쓰기 기법)

  • Lee, Kyung-Jae;Ahn, Woo-Hyun;Oh, Jae-Won
    • The KIPS Transactions:PartA
    • /
    • v.15A no.5
    • /
    • pp.275-286
    • /
    • 2008
  • Fast File System(FFS) utilizes large disk bandwidth to improve the write performance of large files. One way to improve the performance is to write multiple blocks of a large file at a single disk I/O through the disk bandwidth. However, rather than disk bandwidth, the performance of small file writes is limited by disk access times significantly impacted by disk movements such as disk seek and rotation because FFS writes each of small files at a single disk write. We propose CW-FFS (Co-Writing Fast File System) to improve the write performance of small files by minimizing the disk movements that are needed to write small files to disks. Its key technique called co-writing scheme is to dynamically collect multiple small files named by a given directory and then write them at a single disk I/O to contiguous disk locations. Co-writing several small files at a single disk I/O reduces multiple disk movements that are needed for small file writes to one single disk movement, thus increasing the overall write performance of write-intensive applications. Furthermore, a file allocation scheme is introduced to prevent co-writing scheme from having a negative impact on disk spatial locality of small files named by a given directory. The measurement of our technique implemented in the OpenBSD 4.0 shows that CW-FFS increases the performance of small file writes over FFS in the range from 5 to 35% in the Postmark benchmark.