본고는 중국의 정책·공약 표제에서 자주 활용되는 ‘수+个+X’ 형식의 내부 구성을 분석하고, ‘수+个+X’의 활용이 가져오는 효과에 대해 살펴보았다. ‘수+个+X’는 전형 적인 수량사 조합을 탈피한 형식으로 ‘수’는 정책·공약 세부내용에 나열된 항목의 총 개수를 나타내며, ‘X’는 (동사, 부사, 수사)조합, 형용사, 대명사, 접속사, 기타(사자성 어, 기호 등)의 형식으로 정책 항목에서 반복적으로 출현하거나 핵심 되는 단어이다. 그러나 개중에는 전혀 내용을 추측할 수 없는 단어나 기호도 출현하는데 이러한 모 순적인 구성이 오히려 더 많은 궁금증과 호기심을 유발하는 효과를 가진다.

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer’ arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers’ waiting cost in the system and the server’s removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

Using the known result of the expected busy period for the triadic Med (N, T, D) operating policies applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual values. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) or Max (N, T), Max (N, D) and Max (T, D) with the simple N, T and D operating policies without using any other types of triadic operating policies such as Min (N, T, D) and Max (N, T, D) policies. All three input variables N, T and D are equally contributed to construct such bounds for estimation of the expected busy period.

Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented

Us ing the known result of the expected bllsy period for the triadic Min (N, T, 0) operating po licy applied to a controllable M/GI1 queueing model, its upper and lower bounds are derived to approximate its corresponding ac tual value. 80th bounds are rep

The expected busy period for the controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy is derived by using a new concept so called “the pseudo probability density function.” In order to justify the proposed approaches for the