• 경영과학
• /
• 제26권3호
• /
• pp.1-9
• /
• 2009

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

• 대한수학회지
• /
• 제36권1호
• /
• pp.139-157
• /
• 1999

Consider a supercritical Bellman-Harris process evolving from one particle. We superimpose on this process the additional structure of movement. A particle whose parent was at x at its time of birth moves until it dies according to a given Markov process X starting at x. The motions of different particles are assumed independent. In this paper we show that when the movement process X is standard Brownian the proportion of particles with position $\leq${{{{ SQRT { t} }}}} b and age$\leq$a tends with probability 1 to A(a)$\Phi$(b) where A(.) and $\Phi$(.) are the stable age distribution and standard normal distribution, respectively. We also extend this result to the case when the movement process is a Levy process.

• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.51-54
• /
• 2005

This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2005년도 추계학술대회논문집
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• Bulletin of the Korean Chemical Society
• /
• 제13권2호
• /
• pp.162-165
• /
• 1992

The fine structure branching ratio and Doppler profiles of photofragment Cl ($^{2}P_{j}$) atoms from photodissociation of CINO around 236 nm in the A band have been measured by the two photon resonance enhanced multiphoton ionization technique. The measured branching ratio, $Cl^{\ast} (^{2}P_{1/2})/Cl (^{2}P_{3/2})$ is $0.18{\pm}0.02$. The Doppler profile of Cl is well reproduced assuming that one of the two components in the photofragment translational spectra reported by Haas, Felder, and Huber [Chem. Phys. Lett., 180, 293 (1990)] should correspond to Cl and that an anisotropy parameter $\beta$ for the angular distribution is 0.45. The results suggest that CINO dissociation in the A band should consist of at least two non-crossing electronic states which correlate to the formation of $Cl^* and Cl, respectively.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

• Korean Journal of Radiology
• /
• 제1권2호
• /
• pp.79-83
• /
• 2000

Objective: To describe the thin-section CT findings of arc-welders' pneumoconiosis. Materials and Methods: Eighty-five arc-welders with a three to 30 (mean, 15)-year history of exposure underwent thin-section CT scanning. The extent of abnormalities detected was correlated with the severity of dyspnea and pulmonary function tests. For comparison, images of 43 smoking males (mean 25 pack-year) who underwent thin-section CT for other reasons (smokers' group) were also analyzed. Results: Fifty-four welders (63.5%) and six smokers (14.0%) showed positive findings. Predominant thin-section CT findings were poorly-defined centrilobular micronodules (30/54, 55.6%), branching linear structure (18/54, 33.3%), and ground-glass attenuation (6/54, 11.1%). In the smokers' group, poorly-defined micronodules were found in four patients, branching linear structures in one, and ground-glass attenuation in one. In welders, the extent of abnormalities seen on thin-section CT showed no significant correlation with the severity of dyspnea or the results of pulmonary funotion test. Conclusion: Poorly-defined centrilobular micronodules and branching linear structures were the thin-section CT findings most frequently seen in patients with arc-welders' pneumoconiosis. Less commonly, extensive ground-glass attenuation was also seen.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.123-128
• /
• 2004

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.

• 한국농림기상학회지
• /
• 제26권1호
• /
• pp.31-52
• /
• 2024

나무의 가지 구조와 생리학 사이의 중요한 관계를 고려할 때 가지 구조를 이해하는 것은 수종의 분류나 3D 나무 모델링과 같은 분야에 중요하다. 지상형 라이다는 나무의 구조를 자세히 포착하고 정량적 구조 모델은 지상형 라이다로부터 얻어진 포인트 클라우드에서 가지의 반경과 길이의 계산을 가능하게 한다. 선행 연구에서는 반경 비율이나 길이 비율 등 가지의 구조를 나타내는 인자의 대푯값으로 평균 또는 중앙값에 의존하거나 줄기와 1분기 가지의 관계만을 다루었다. 본 연구는 가시칠엽수, 은행나무, 왕벚나무에서 부모와 자식 가지 사이의 반경 비율, 길이 비율 및 분지각 세 가지 인자에 대해 3분기 가지까지 인자들의 추정 분포를 살펴보고 추정 분포들을 분기별, 종별로 비교하는 것을 목표로 한다. 인자들에 적합한 분포를 알아보기 위해 인자들을 여러 확률 분포로 추정해 보았고, 평균 Kolmogorov-Smirnov 통계량에 의거해 각각 그 수치가 반경의 경우 0.048, 길이의 경우 0.061, 각도의 경우 0.050으로 감마 분포가 최적의 분포로 선택되었다. 추정된 분포 내에서 최빈값과 평균값, 최빈값과 중앙값 사이의 차이를 정규화 한 평균은 반경에 경우 11.2% 및 7.5%, 길이에 경우 17.0% 및 11.5%, 분지각의 경우 8.2% 및 5.5%로 상당한 차이를 보였다. 추정된 분포 사이에서 분기별, 종별 비교 분석을 수행했으며, 그 결과 인자들로부터 추정된 분포는 분기와 종에 따라 다양한 분포 양상을 보였다. 본 연구는 이러한 인자들의 확률 분포를 조사하는 것이 가지 구조에 대해 더 상세한 묘사를 제공할 수 있음 시사한다. 또한 가지 구조의 포괄적인 이해를 위해 더 높은 분기의 가지를 조사하는 것의 중요성을 강조한다.