• Journal of the Korean Data and Information Science Society
• /
• 제17권3호
• /
• pp.889-904
• /
• 2006

Our purpose is to ascertain, if possible, whether atomic bomb survivors with cataracts and epilation were more radiosensitive than those survivors with cataracts but without epilation. A major ophthalmologic survey was conducted in Hiroshima and Nagasaki in 1963-64. At that time, 2125 individuals were examined. Among these individuals, estimated eye organ doses, based on the DS86 dosimetry system, and information on the occurrence of epilation within the first 60 days following the bombings are available on 1742. In the analysis of these data we have assumed that each individual represents a sample of one from a binomial distribution, and that the occurrence of cataracts and epilation are independent biological phenomena. We got following results. The threshold for cataract induction and its 95% confidence limits have been estimated from data on the occurrence of cataract and epilation. Among the 1742 study subjects, 40 had both cataracts and severe epilation. The estimated threshold based on these cases is 0.98 sievert(Sv), with 95% lower and upper confidence bounds of 0.72, and 1.32 Sv, respectively, and is highly statistically significant. Among the 27 cases of cataracts where severe epilation was not reported, the estimated threshold is 1.74 Sv with 95% lower and upper confidence bounds of 1.21 Sv, and "not estimable". The difference between these two estimates is not statistically significant although the effect of dose is highly significant in both instances. The potential importance of biases in the DS86 dose estimates is discussed. The difference between the threshold estimated from cataract cases with epilation and that from cases without epilation is not statistically significant at the 5% or 10% level, and thus affords no support for the notion of increased radiosensitivity.

• 사물인터넷융복합논문지
• /
• 제6권3호
• /
• pp.1-6
• /
• 2020

본 논문은 평균 객체 전송 지연 시간에 대한 기존의 모델들을 하나의 프레임워크로 통합하고 실제 계산 경험을 통해 결과를 분석하는 것을 목표로 한다. 해석적 객체 전송 지연 시간 모델은 다중 패킷 손실과 작은 혼잡제어 윈도우로 인해 빠른 재전송이 불가능한 멀티홉 무선 네트워크를 위시한 사물 인터넷(IoT) 환경을 가정한다. 이 모델은 또한 초기 혼잡 윈도우 크기와 하나의 혼잡 윈도우에서의 다중 패킷 손실을 고려한다. 성능평가에 의하면, 전송 객체 크기와 패킷 손실률이 작은 경우 평균 객체 전송 지연의 하한값과 상한값은 거의 동일하다. 그러나 패킷 손실률이 커지면 초기 혼잡 윈도우의 크기와 왕복 시간이 평균 객체 전송 지연의 상·하한값에 영향을 미치는 것으로 나타났다.

• 경영과학
• /
• 제19권1호
• /
• pp.55-66
• /
• 2002

Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

• 대한수학회지
• /
• 제47권6호
• /
• pp.1147-1165
• /
• 2010

In this paper we compare a torsion free sheaf F on $P^N$ and the free vector bundle $\oplus^n_{i=1}O_{P^N}(b_i)$ having same rank and splitting type. We show that the first one has always "less" global sections, while it has a higher second Chern class. In both cases bounds for the difference are found in terms of the maximal free subsheaves of F. As a consequence we obtain a direct, easy and more general proof of the "Horrocks' splitting criterion", also holding for torsion free sheaves, and lower bounds for the Chern classes $c_i$(F(t)) of twists of F, only depending on some numerical invariants of F. Especially, we prove for rank n torsion free sheaves on $P^N$, whose splitting type has no gap (i.e., $b_i{\geq}b_{i+1}{\geq}b_i-1$ 1 for every i = 1,$\ldots$,n-1), the following formula for the discriminant: $$\Delta(F):=2_{nc_2}-(n-1)c^2_1\geq-\frac{1}{12}n^2(n^2-1)$$. Finally in the case of rank n reflexive sheaves we obtain polynomial upper bounds for the absolute value of the higher Chern classes $c_3$(F(t)),$\ldots$,$c_n$(F(t)) for the dimension of the cohomology modules $H^iF(t)$ and for the Castelnuovo-Mumford regularity of F; these polynomial bounds only depend only on $c_1(F)$, $c_2(F)$, the splitting type of F and t.

• Industrial Engineering and Management Systems
• /
• 제4권2호
• /
• pp.165-175
• /
• 2005

Two extreme and one mixed procedures for designing a noise hazard prevention program are discussed in this paper. The two extreme design procedures (engineering-based and HPD-based) yield upper and lower bounds of the total noise control cost, respectively; while the mixed design procedure provides an optimal noise hazard prevention program within a given total budget. The upper bound of the workforce size for job rotation is approximated using a heuristic procedure. Six optimization models are developed and utilized by the mixed procedure to eliminate or reduce excessive noise levels (or noise exposures) in an industrial workplace. The mixed procedure also follows the OSHA’s hierarchy of noise control. A numerical example is given to demonstrate the application of the proposed design procedures.

• Management Science and Financial Engineering
• /
• 제17권2호
• /
• pp.1-21
• /
• 2011

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

• Structural Engineering and Mechanics
• /
• 제45권4호
• /
• pp.439-454
• /
• 2013

Hollow cylindrical tubes with a prismatic sandwich lining designed to replace the solid cross-sections are studied in this paper. The sections are divided by a number of revolving periodic unit cells and three topologies of unit cells (Square, Triangle and Kagome) are proposed. Some types of multiple-topology designed materials are also studied. The feasibility and accuracy of a homogenization method for obtaining the equivalent parameters are investigated. As the curved elements of a unit cell are represented by straight elements in the method and the ratios of the lengths of the curved elements to the lengths of the straight elements vary with the changing number of unit cells, some errors may be introduced. The frequencies of the first five modes and responses of the complete and equivalent models under an internal static pressure and an internal step pressure are compared for investigating the scope of applications of the method. The lower bounds and upper bounds of the number of Square, Triangular and Kagome cells in the sections are obtained. It is shown that treating the multiple-topology designed materials as a separate-layer structure is more accurate than treating the structure as a whole.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1654-1675
• /
• 2014

In practical wireless systems, the erroneous channel state information (CSI) sometimes deteriorates the performance drastically. This paper focuses on robust design of coordinated set planning of coordinated multi-point (CoMP) transmission, with respect to the feedback delay and link error. The non-ideal channel models involving various uncertainty conditions are given. After defining a penalty factor, the robust net ergodic capacity optimization problem is derived, whose variables to be optimized are the number of coordinated base stations (BSs) and the divided area's radius. By the maximum minimum criterion, upper and lower bounds of the robust capacity are investigated. A practical scheme is proposed to determine the optimal number of cooperative BSs. The simulation results indicate that the robust design based on maxmin principle is better than other precoding schemes. The gap between two bounds gets smaller as transmission power increases. Besides, as the large scale fading is higher or the channel is less reliable, the number of the cooperated BSs shall be greater.

• 한국통신학회논문지
• /
• 제17권6호
• /
• pp.595-603
• /
• 1992

통신망의 신뢰도 계정을 하는데 있어서 대형망에서는 소자(component)들의 증가로 인한 계산상 어려움과 복잡성 때문에 NP,hard 문제가 발생한다. 이러한 문제점을 해결하기 위하여 본 논문에서는 통신망의 시점(source node)과 종점 (terminal node)간에 상한고 하한 근사 신뢰도를 구하는 알고리즘을 제시하였다. 계정 절차는 우선, 최소 경로 집합(minimal pathset)과 최소 컷셋(minimal cutest)을 구한다. 그 다음, 소자의 수가 동일한 사상(pathset, cutest)끼리 분리한 후 공통변수(common variable)를 추출한 부분함수를 구하여 근사 신뢰도를 계정하였다. 또한 본 논문에서 제시한 알고리즘의 성능을 평가하기 위하여 Esary-Proschan, Shogan과 Gopal의 대칭망 알고리즘고 비교 하였다.

• 대한산업공학회지
• /
• 제30권2호
• /
• pp.93-106
• /
• 2004

This paper studied a maximal covering location problem with cost restrictions, to maximize level of service within predetermined cost. It is assumed that all demand have to be met. If the demand node is located within a given range, then its demand is assumed to be covered, but if it is not, then its demand is assumed to be uncovered. An uncovered demand is received a service but at an unsatisfactory level. The objective function is to maximize the sum of covered demand, Two heuristics based on the Lagrangean relaxation of allocation and decoupling are presented and tested. Upper bounds are found through a subgradient optimization and lower bounds are by a cutting algorithm suggested in this paper. The cutting algorithm enables the Lagrangean relaxation to be proceeded continually by allowing infeasible solution temporarily when the feasible solution is not easy to find through iterations. The performances are evaluated through computational experiments. It is shown that both heuristics are able to find the optimal solution in a relatively short computational time for the most instances, and that decoupling relaxation outperformed allocation relaxation.