• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of the Korean Chemical Society
• /
• v.9 no.3
• /
• pp.134-141
• /
• 1965

Crystals of nicotine dihydroiodide, are orthorhombic with space group $p2_12_12_1$.The unit cell of dimensions a=7.61, b=11.01, e=17.27${\AA}$, contains four formula units. The structure has been determined by X-ray diffraction method and has been refined to give the R-index, ${\sum}{\mid}{\mid}F_{\circ}{\mid}-{\mid}F_c{\mid}{\mid}{\div}{\sum}{\mid}F_{\circ}{\mid}$, of 0.16 and 0.14 for $F_{okl}\;and\;F_{hol}$ respectively.The mean lengths of C-C and C-N bonds in pyridine ring are 1.40 and $1.35{\AA}$ and those in pyrolidine ring 1.56 and $1.48{\AA}$ respectively, though accurate measurement of bond length has not been attempted. The six atoms in the pyridine ring are coplanar and on the other hand $C_6,\;C_7,\;C_8$ and $N_2$ atoms in pyrrolidine ring form a plane within accuracy of the analysis, and $C_9$ atom is distant $0.22{\AA}$ out of the plane consist of $C_6,\;C_7,\;C_8$ and $N_2$ aoms. The normals to the two planes form an angle of $94^{\circ}$ with each other. Iodine atom is distant $3.55{\AA}$ from nitrogen atom in pyridine ring and the other iodine atom $3.58{\AA}$ from nitrogen atom in pyrrolidine ring, so that the nitrogen and iodine atoms are firmly linked.It seems that the only forces binding nicotine dihydroiodide molecules together in the crystal are Van der Waals forces.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.383-388
• /
• 2007

A (g, f)-factor F of a graph G is Called a Hamiltonian (g, f)-factor if F contains a Hamiltonian cycle. The binding number of G is defined by $bind(G)\;=\;{min}\;\{\;{\frac{{\mid}N_GX{\mid}}{{\mid}X{\mid}}}\;{\mid}\;{\emptyset}\;{\neq}\;X\;{\subset}\;V(G)},\;{N_G(X)\;{\neq}\;V(G)}\;\}$. Let G be a connected graph, and let a and b be integers such that $4\;{\leq}\;a\;<\;b$. Let g, f be positive integer-valued functions defined on V(G) such that $a\;{\leq}\;g(x)\;<\;f(x)\;{\leq}\;b$ for every $x\;{\in}\;V(G)$. In this paper, it is proved that if $bind(G)\;{\geq}\;{\frac{(a+b-5)(n-1)}{(a-2)n-3(a+b-5)},}\;{\nu}(G)\;{\geq}\;{\frac{(a+b-5)^2}{a-2}}$ and for any nonempty independent subset X of V(G), ${\mid}\;N_{G}(X)\;{\mid}\;{\geq}\;{\frac{(b-3)n+(2a+2b-9){\mid}X{\mid}}{a+b-5}}$, then G has a Hamiltonian (g, f)-factor.

• Journal of the Ergonomics Society of Korea
• /
• v.29 no.3
• /
• pp.375-382
• /
• 2010

The purpose of this study was to analyze the risk factors of the musculoskeletal workload of mid-old-age food preparation workers by identifying the differences in the complaints of subjective symptoms between mid-old-age housewives and mid-old-age food preparation workers. This study was carried out on a total of 83 subjects from April 2009 through July 2009: 43 food preparation workers at the catering department of general hospital A, with a high rate of mid-old-age food preparation staff, and 40 full-time housewives (40~59 years old). The analysis of the relationship between the rates of the subjective symptoms of the two groups showed that the mid-old-age food preparation workers had a 7.8-fold higher risk of developing musculoskeletal diseases than the full-time housewives. The musculoskeletal workload of the mid-old-age food preparation workers included repetitive motions, uncomfortable postures, and heavy lifting. It is hoped that this study will help provide mid-old-age people with opportunities for appropriate economic activity and labor and will help improve their work postures and methods as well as their environmental-risk factors.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.117-126
• /
• 2003

Let {$X_{nk}$\mid$1\;{\leq}\;k\;{\leq}\;n,\;n\;{\geq}\;1$} be an array of row negatively associated (NA) random variables which satisfy $P($\mid$X_{nk}$\mid$\;>\;x)\;{\leq}\;P($\mid$X$\mid$\;>\;x)$. For weighed sums ${{\Sigma}_{k=1}}^{Tn}\;a_kX_{nk}$ indexed by random variables {$T_n$\mid$n\;{\geq}$1$}, we establish a general weak law of large numbers (WLLN) of the form $({{\Sigma}_{k=1}}^{Tn}\;a_kX_{nk}\;-\;v_{[nk]})\;/b_{[an]}$ under some suitable conditions, where $\{a_n$\mid$n\;\geq\;1\},\; \{b_n$\mid$n\;\geq\;1\}$ are sequences of constants with $a_n\;>\;0,\;0\;<\;b_n\;\rightarrow \;\infty,\;n\;{\geq}\;1$, and {$v_{an}$\mid$n\;{\geq}\;1$} is an array of random variables, and the symbol [x] denotes the greatest integer in x.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.5
• /
• pp.297-305
• /
• 2009

Automatic generation of the mid-surfaces of a CAD model is becoming a useful function in that it can help increase the efficiency of engineering analysis as far as it does not affect the result seriously. Several methods had been proposed previously to automatically generate the mid-surfaces, but they often failed to generate the mid-surfaces of complex CAD models. Due to the inherent difficulty of this mid-surface generation problem, it may not be possible to come up with a complete and general method to solve this problem. Since a method that can handle a specific case may not work for different cases, it seems that developing case-specific methods ends up with solving only a fraction of the problem. In this paper, therefore, we propose a method to generate mid-surfaces based on a divide-and-conquer paradigm. This method first decomposes a complex CAD model into simple volumes. The mid-surfaces of the simple volumes are automatically generated by the existing methods, and then they are converted into the mid-surfaces of the original CAD model.

• Journal of Korean Association for Spatial Structures
• /
• v.21 no.4
• /
• pp.73-80
• /
• 2021

A mid-story isolation system was proposed for seismic response reduction of high-rise buildings and presented good control performance. Control performance of a mid-story isolation system was enhanced by introducing semi-active control devices into isolation systems. Seismic response reduction capacity of a semi-active mid-story isolation system mainly depends on effect of control algorithm. AI(Artificial Intelligence)-based control algorithm was developed for control of a semi-active mid-story isolation system in this study. For this research, an practical structure of Shiodome Sumitomo building in Japan which has a mid-story isolation system was used as an example structure. An MR (magnetorheological) damper was used to make a semi-active mid-story isolation system in example model. In numerical simulation, seismic response prediction model was generated by one of supervised learning model, i.e. an RNN (Recurrent Neural Network). Deep Q-network (DQN) out of reinforcement learning algorithms was employed to develop control algorithm The numerical simulation results presented that the DQN algorithm can effectively control a semi-active mid-story isolation system resulting in successful reduction of seismic responses.

• Honam Mathematical Journal
• /
• v.30 no.1
• /
• pp.9-20
• /
• 2008

Let ${X_i{\mid}i{\geq}1}$ be a strictly stationary sequence of associated random variables with mean zero and let ${\sigma}^2=EX_1^2+2\sum\limits_{j=2}^\infty{EX_1}{X_j}$ with 0 < ${\sigma}^2$ < ${\infty}$. Set $S_n={\sum\limits^n_{i=1}^\{X_i}$, the precise asymptotics for ${\varepsilon}^{{\frac{2(r-p)}{2-p}}-1}\sum\limits_{n{\geq}1}n^{{\frac{r}{p}}-{\frac{1}{p}}+{\frac{1}{2}}}P({\mid}S_n{\mid}{\geq}{\varepsilon}n^{{\frac{1}{p}}})$,${\varepsilon}^2\sum\limits_{n{\geq}3}{\frac{1}{nlogn}}p({\mid}Sn{\mid}{\geq}{\varepsilon\sqrt{nloglogn}})$ and ${\varepsilon}^{2{\delta}+2}\sum\limits_{n{\geq}1}{\frac{(loglogn)^{\delta}}{nlogn}}p({\mid}S_n{\mid}{\geq}{\varepsilon\sqrt{nloglogn}})$ as ${\varepsilon}{\searrow}0$ are established under the suitable conditions.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.457-466
• /
• 2004

Let{$X_{ni}$\mid$\;1\;{\leq}\;i\;{\leq}\;k_n,\;n\;{\geq}\;1$} be an array of rowwise negatively associated random variables such that $P$\mid$X_{ni}$\mid$\;>\;x)\;=\;O(1)P($\mid$X$\mid$\;>\;x)$ for all $x\;{\geq}\;0,\;and\; \{k_n\}\;and\;\{r_n\}$ be two sequences such that $r_n\;{\geq}\;b_1n^r,\;k_n\;{\leq}\;b_2n^k$ for some $b_1,\;b_2,\;r,\;k\;>\;0$. Then it is shown that $\frac{1}{r_n}\;max_1$\mid${\Sigma_{i=1}}^j\;X_{ni}$\mid$\;{\rightarrow}\;0$ completely convergence and the strong convergence for weighted sums of N A arrays is also considered.

• International Journal of High-Rise Buildings
• /
• v.7 no.3
• /
• pp.233-242
• /
• 2018

Since the response reduction effect on over 200-meter-tall resulting from the seismic isolation system is smaller in general than low-rise and mid-rise buildings, mid-story isolated buildings are considered to reduce the response in the upper part above the isolation story, however, in many cases, the acceleration response just below the isolation story is likely to be the largest. This paper presents the structural design schemes, the design of the main structural frames, and the constructions of a 230-meter-tall super high-rise building with mid-story isolation mechanism integrated in Roppongi, Tokyo. Moreover, this paper shows how the architectural and structural design for integrating a mid-story isolation system in a super high-rise building has been conducted and what solutions have been derived in this project. The realization of this building indicates new possibilities for mid-story isolation design for super high-rise buildings.