• Title/Summary/Keyword: b-extensions

Search Result 85, Processing Time 0.023 seconds

Efficiency Analysis of Public Service Organizations Using Stochastic Frontier Analysis (확률변경분석을 이용한 공공서비스 조직의 효율성 분석)

  • Shin, Jong Seop;Kim, Hyun Jung
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.40 no.1
    • /
    • pp.117-128
    • /
    • 2015
  • An organization must restructure itself once it makes outsourcing decisions. Outsourcing is a strategy that a company adopts to direct internal efforts into strengthening its core business processes while contracting other companies for strategically less critical tasks thereby improving organizational production efficiency, and the strategy inevitably involves organizational restructuring. While public service organizations have increasingly embraced outsourcing as well, only a handful of studies analyze the change in efficiency from organizational restructuring. Therefore, this study uses Stochastic Frontier Analysis (SFA) to test whether efficiency improved in Korea Expressway Corporation's restructured branch offices. Korea Expressway Corporation evaluated and grouped its branches based on road extensions management, traffic volume, the number of snow days, road deterioration, and the number of junctions to differentially allocate its personnel and budget. The extent of efficiency improvement in each group was compared, and results show that inefficiency did not exist in any of the groups. The efficiency index among the three group categories was similar across the board; 9 offices in the A-group with its expanded personnel and budget had an efficiency index of 0.954, 12 offices in the B-group with unchanged personnel and budget conditions had an index of 0.950, and 12 offices in the C-group with reduced personnel and budget had an index of 0.937. SFA facilitates efficiency analyses because it does not require pre-restructuring data. This study is easy to apply in practice and empirically tests efficiency improvement in organizational restructuring based on data collected from all the branch offices in Korea Expressway Corporation.

IFP RINGS AND NEAR-IFP RINGS

  • Ham, Kyung-Yuen;Jeon, Young-Cheol;Kang, Jin-Woo;Kim, Nam-Kyun;Lee, Won-Jae;Lee, Yang;Ryu, Sung-Ju;Yang, Hae-Hun
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.727-740
    • /
    • 2008
  • A ring R is called IFP, due to Bell, if ab=0 implies aRb=0 for $a,b{\in}R$. Huh et al. showed that the IFP condition need not be preserved by polynomial ring extensions. But it is shown that ${\sum}^n_{i=0}$ $E_{ai}E$ is a nonzero nilpotent ideal of E whenever R is an IFP ring and $0{\neq}f{\in}F$ is nilpotent, where E is a polynomial ring over R, F is a polynomial ring over E, and $a_i^{'s}$ are the coefficients of f. we shall use the term near IFP to denote such a ring as having place near at the IFPness. In the present note the structures of IFP rings and near-IFP rings are observed, extending the classes of them. IFP rings are NI (i.e., nilpotent elements form an ideal). It is shown that the near-IFPness and the NIness are distinct each other, and the relations among them and related conditions are examined.

ON THE SUFFICIENT CONDITION FOR THE LINEARIZED APPROXIMATION OF THE B$\"{E}$NARD CONVECTION PROBLEM

  • Song, Jong-Chul;Jeon, Chang-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.125-135
    • /
    • 1992
  • In various viscus flow problems it has been the custom to replace the convective derivative by the ordinary partial derivative in problems for which the data are small. In this paper we consider the Benard Convection problem with small data and compare the solution of this problem (assumed to exist) with that of the linearized system resulting from dropping the nonlinear terms in the expression for the convective derivative. The objective of the present work is to derive an estimate for the error introduced in neglecting the convective inertia terms. In fact, we derive an explicit bound for the L$_{2}$ error. Indeed, if the initial data are O(.epsilon.) where .epsilon. << 1, and the Rayleigh number is sufficiently small, we show that this error is bounded by the product of a term of O(.epsilon.$^{2}$) times a decaying exponential in time. The results of the present paper then give a justification for linearizing the Benard Convection problem. We remark that although our results are derived for classical solutions, extensions to appropriately defined weak solutions are obvious. Throughout this paper we will make use of a comma to denote partial differentiation and adopt the summation convention of summing over repeated indices (in a term of an expression) from one to three. As reference to work of continuous dependence on modelling and initial data, we mention the papers of Payne and Sather [8], Ames [2] Adelson [1], Bennett [3], Payne et al. [9], and Song [11,12,13,14]. Also, a similar analysis of a micropolar fluid problem backward in time (an ill-posed problem) was given by Payne and Straughan [10] and Payne [7].

  • PDF

Secure Routing with Time-Space Cryptography for Mobile Ad-Hoc Networks (이동 애드혹 망을 위한 시공간 방식의 보안 라우팅 프로토콜)

  • Joe, In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.11-16
    • /
    • 2007
  • This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

Repeated Loading Test of Shear-Critical Reinforced Concrete Beams with Headed Shear Reinforcement (헤디드 바를 전단철근으로 사용한 철근콘크리트 보의 전단거동에 관한 반복하중 실험)

  • Kim, Young-Hoon;Lee, Joo-Ha;Yoon, Young-Soo
    • Journal of the Korea Concrete Institute
    • /
    • v.18 no.1 s.91
    • /
    • pp.47-56
    • /
    • 2006
  • The repeated loading responses of four shear-critical reinforced concrete beams with two different shear span-to-depth ratios, were studied. One series of beams was reinforced using pairs of bundled stirrups with $90^{\circ}$ standard hooks, haying free end extensions of $6d_b$. The companion beams contained shear reinforcement made with larger diameter headed bars anchored with 50mm diameter circular heads. A single headed bar had the same area as a pair of bundled stirrups and hence the two series were comparable. The test results indicate that beams containing headed bar stirrups have a superior performance to companion beams containing bundled standard stirrups with improved ductility, larger energy absorption and enhanced post-peak load carrying capability. Due to splitting of the concrete cover and local crushing, the hooks of the standard stirrups opened resulting in loss of anchorage. In contrast, the headed bar stirrups did not lose their anchorage and hence were able to develop strain hardening and also served to delay buckling of the flexural compression steel. Excellent load-deflection predictions were obtained by reducing the tension stiffening to account for repeated load effects.