• Management Science and Financial Engineering
• /
• 제16권1호
• /
• pp.59-79
• /
• 2010

This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

• 가족자원경영과 정책
• /
• 제20권3호
• /
• pp.25-43
• /
• 2016

This study focused on the time use of a dual-earner working group with preschool children on working and nonworking days using 2014 time-use survey data provided by Statistics Korea(KOSTAT). We collected the time-use data recorded in a 2,158 time diary. We divided the time use into 4 parts ; paid work, household labor work (including caring work), leisure and living essentials. For the statistical analysis, we used SPSS 18.0 packages, i.e., descriptive statistics, T-test, Anova with Duncan test and regression for the impact off the independent factors. The results verified gender differences in time use and recognized the usefulness of the time-allocation analysis for the diagnosis of Work and Life Balance(WLB). In the conclusion, we suggest increasing men's time allocation for household labor as a crucial solution to the WLB of dual-earner working groups. And the follow-up study should include the various factors that affect the time allocation of dual-earner groups, such as type of labor and job and children's ages.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 추계학술대회
• /
• pp.114-116
• /
• 2018

본 논문에서는 빔-호핑 위성 전송 시스템을 위한 카운터를 기반의 연속적인 beam allocation time schedule (BATS) 변경 기법을 제안한다. 제안하는 기법은 BATS 를 처음 변경할 때, 카운터를 기반으로 gateway (GW)와 space craft (SC) 양단에서 BATS 변경 시점을 동기화 시킨다. 이 후, BATS를 계속 변경하더라도 전송 데이터 손실 없이 BATS 를 변경할 수 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• 한국사회복지학
• /
• 제64권2호
• /
• pp.31-54
• /
• 2012

본 연구는 생활시간조사자료를 활용하여 가구 내에서 배분되는 일-가족시간에 대한 실증분석을 수행하였다. 부부의 유급노동시간과 가족시간에서 차지하는 남성의 비중을 근거로 일-가족 시간 배분을 4개의 모형(전통적 남성생계부양, 이중노동부담, 협조적 적응, 가족친화적 남성생계부양)으로 유형화하였으며, 퍼지셋이상형분석을 통해 각 유형에 소속되어 있는 정도를 점수화한 후, 각 모형의 소속점수에 대한 중다회귀분석을 수행하였다. 연구결과, 지난 10년간 이중노동부담의 비중이 감소하고 협조적 적응 유형이 증가한 것으로 나타나고 있으나, 여전히 전체적인 모형별 분포를 보면 전통적인 성분업에 고착된 구조를 보여주고 있었다. 4개의 시간배분 모형에 대한 회귀분석 결과 역시 각 모형별 분석의 유용성을 보여주었으며, 무엇보다 성분업 의식의 역할은 제한적인 것으로 나타났다. 이를 바탕으로 향후 가족정책의 논의에 있어 가구내의 미시적 성분업 구조와 일-가족시간의 배분과 관련된 역동성을 좀 더 면밀히 파악할 필요가 있다는 점과, 방법론적 함의로 미시자료를 이용한 양적연구에서도 퍼지셋 활용이 방법론적 다양성을 제공해 줄 수 있다는 점을 논의하였다.

• 대한전자공학회논문지
• /
• 제27권2호
• /
• pp.118-125
• /
• 1990

분산 컴퓨터 시스템에서 정보 화일을 효율적으로 관리, 운용하기 위한 화일 할당 문제의 최적해를 구하는 화일 할당 알고리듬을 제안한다. 컴퓨터 노드(site)가 많은 경우 화일 할당에 많은 시간이 소요되므로 선 할당(preassignment)을 수행하여 문제의 규모를 축소하고 계산시간을 개선한다. 할당이 진행중인 상태의 표시치(representative value)를 정확하게 나타내기 위해 기대값을 이용한 평가치 계산기법을 제안하고 빠른 시간에 최적 할당이 이루어지도록 후보 노드(candidate node)에 대한 선택기준(selection criteria)을 설정한다. 선택기준에 의해 각 노드의 화일 할당 여부를 결정하고 최종 평가치가 할당 상태의 전체 비용을 나타낸다. 제안한 알고리듬은 다항식 시간(polynomial time)알고리듬이며 여러 예제에 실현한 결과 할당 소요시간이 개선되고 기존의 할당 알고리듬과 비교하여 최적해를 구하는데 있어 우수함을 나타냈다.

• 한국항만학회지
• /
• 제1권1호
• /
• pp.21-47
• /
• 1987

Nowaday all the countries of the world have studied the various problems caused in operating their own ports efficiently. Ship delay in the port is attributal to the inefficient operation in the navigation aids, the cargo handling, the storage and transfer facilities, and to the inefficient allocation of gangs or to a bad service for ships. Among these elements the allocation of gangs is the predominating factor in minimizing ship's turn round time. At present, in the case of Pusan Port. the labour union and stevedoring companies allocate gangs in every hatches of ships by a rule of thumb, just placing emphasis on minimizing ship's turn round time, without applying the principle of allocation during the cargo handling. Owing to this the efficiency of the cargo handling could not be expected to be maximized and this unsystematic operation result in supplying human resources of much unnecessary surplus gangs. Therefore in this paper the optimal size and allocation of gangs for minimizing the ship's turn round time is studied and formularized. For the determination of the priority for allocation the evaluation function, namely $F=PHi^{n}{\times}(W+H)$, can be obtained; where, PHI : Principal Hatch Index W : Total Cargo Weight represented in Gang-Shifts H : Total Number of Ship's hatches and also for the optimal size of gangs the average number of gang allocated per shift (Ng), namely Ng=W/PHI, is used. The proposed algorithm is applied to Pusan Port and its validity is verified.

• 한국항해학회지
• /
• 제5권1호
• /
• pp.1-23
• /
• 1981

As far as transportation problems are concerned, the minimization of transportation cost is the most prevailing object. But in some cases, the cargo delivery time is the utter problem rather than the cost. For instance, we may imagine the case that the delivery of the construction materials is delayed behind the schedule and this makes the construction cost increased because of idle time of other materials and man power, in addition to the indemnity. Therefore the allocation of ships, in marine transportation which is now the main route of overseas trade, to the needed area on the required time is to be appropriately performed. However, there are several restrictions for cargo delivery to meet the demand, such as ship's size, number to be employed and cargo handling capacity of the ports, etc. And there are some other factors to be considered, that is, the degree of necessities of commodities, on their kinds, amount, and the time of arrival, etc. This paper deals with the problem of optimum allocation of ships emphasizing the cargo delivery time adopting Linear Programming technique with those cargo delivery restrictions and factors transformed by introducing the multi-speed conception, the conversion of multi-commodity to a single commodity, allowable delivery time, weight penalty number and nominating priority. This paper presents a case of optimum allocation of ships in the light of cargo delivery time for a construction company which has two different construction places and analyzes the result. This study will give a planner a good tool for optimum planning of maring transportation and be used for decision of schemes.

• 인터넷정보학회논문지
• /
• 제8권4호
• /
• pp.41-49
• /
• 2007

EPON(Ethernet Passive Optical Network)는 적은 비용으로 고품질 서비스를 제공하기 위한 차세대 기술로써, EPON을 구성하는 모든 ONU(Optical Network Unit)들은 한정된 업링크 채널을 나누어 사용한다. 대용량 LAN에 사용자들의 대역폭 요구를 충족시키기 위해서, OLT(Optical Line Terminal)는 효과적인 방법으로 업링크 채널의 시간슬롯을 각 ONU에게 분할 할당한다. 본 논문에서는 효율적인 업링크 채널의 시간슬롯 분배(대역폭 할당)를 위해 기존 연구 IPACT(Interleaved Polling with Adaptive Cycle Time)와 SLICT(Sliding Cycle Time)방식에 대해 살펴보고, 새로운 대역폭 할당 방식인 DRSM(Dynamic Right Sizing of Maximum-windows)을 제안한다. 이 방식은 과거 모든 ONU에게 할당된 대역폭 정보를 기반으로 다음 구간에서 ONU에 할당 가능한 최대 대역폭을 계산하고, 계산된 최대 전송 가능 대역폭과 ONU의 대역폭 요구량으로 각 ONU의 전송 윈도우의 크기를 결정한다. 제안한 방식은 모든 ONU의 대역폭 요구를 허용 범위 내에서 최대한 충족시키고, ONU들간 균등한 대역폭 할당을 추구한다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제15권1호
• /
• pp.79-84
• /
• 2023

Due to the rapid performance improvement of smartphones, multitasking on mobile platforms has become an essential feature. Unlike traditional desktop or server environments, mobile applications are mostly interactive jobs where response time is important, and some applications are classified as real-time jobs with deadlines. When interactive and real-time jobs run concurrently, memory allocation between multitasking applications is a challenging issue as they have different time requirements. In this paper, we study how to allocate memory space when real-time and interactive jobs are simultaneously executed in a smartphone to meet the multitasking requirements between heterogeneous jobs. Specifically, we analyze the memory size required to satisfy the constraints of real-time jobs and present a new model for allocating memory space between heterogeneous multitasking jobs. Trace-driven simulations show that the proposed model provides reasonable performance for interactive jobs while guaranteeing the requirement of real-time jobs.