• Title/Summary/Keyword: I-graph

Search Result 326, Processing Time 0.029 seconds

Thermal Load Simulation Analysis on Model Building Estimating Optimum Heat Source Capacity (최적 열원용량 산정을 위한 모델건물 공조부하 시뮬레이션 분석)

  • Park, Jong-Il;Kim, Se-Hwan;Lee, Sung
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.19 no.6
    • /
    • pp.427-433
    • /
    • 2007
  • Generally, H.V.A.C load capacity in early planning phase can presume with maximum thermal load. Basic data can prove by air conditioning equipment system data analysis at existing building. There are poor and not reliable alternative presentation. In this paper, measured data after use H.V.A.C load calculation K-load program reply choosing standard building and variables simulation. And I founded peak load correlation graph and mode for several kinds of variable and contents of size. I wish that equipment designer is beaconed to produce optimum capacity at building as quantitative through this result.

Analysis of MICC, ELA TFT performance transition according to substrate temperature and gate bias stress time variation (온도 변화 및 Gate bias stress time에 따른 MICC, ELA TFT성능 변화 비교 분석)

  • Yi, Seung-Ho;Lee, Won-Baek;Yi, Jun-Sin
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2010.06a
    • /
    • pp.368-368
    • /
    • 2010
  • Using TFTs crystallized by MICC and ELA, electron mobility and threshold voltage were measured according to various substrate temperature from $-40^{\circ}C$ to $100^{\circ}C$. Basic curve, $V_G-I_D$, is also measured under various stress time from 1s to 10000s. Consequently, due to the passivation effect and number of grains, mobility of MICC is varied in the range of -8% ~ 7.6%, while that of ELA is varied from -11.04% ~ 13.25%. Also, since $V_G-I_D$ curve is dominantly affected by grain size, active layer interface, the graph remained steady under the various gate bias stress time from 1s to 10000s. This proves the point that MICC can be alternative technic to ELA.

  • PDF

DIGITAL COVERING THEORY AND ITS APPLICATIONS

  • Kim, In-Soo;Han, Sang-Eon
    • Honam Mathematical Journal
    • /
    • v.30 no.4
    • /
    • pp.589-602
    • /
    • 2008
  • As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

A folding algorithm for design of high density PLA's (고밀도 PLA 설계를 위한 겹침 알고리즘)

  • Sun, S.K.;Kim, Y.H.;Hong, I.S.;Jung, J.M.;Lee, J.M.;Lim, I.C.
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.595-598
    • /
    • 1988
  • In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

  • PDF

Measurement of Visibility about Image (영상에 대한 이미지 선명도 측정)

  • Yu, Ji-Chul;Kim, Yung-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.327-331
    • /
    • 2005
  • In this paper, Another way to measure the visibility of image is presented, and this way is different with existing way which is measured by filtering such as High pass, Low pass. Dynamic range, Gray level and Condition Curve Graph is used among much information of histogram, and the output is limited by log scale. As a result, I can confirm that the output is reasonable. With this output, I present that the possibility of another way to measure the visibility of image is existing.

  • PDF

[r, s, t; f]-COLORING OF GRAPHS

  • Yu, Yong;Liu, Guizhen
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.1
    • /
    • pp.105-115
    • /
    • 2011
  • Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

Highly Accelerated SSFP Imaging with Controlled Aliasing in Parallel Imaging and integrated-SSFP (CAIPI-iSSFP)

  • Martin, Thomas;Wang, Yi;Rashid, Shams;Shao, Xingfeng;Moeller, Steen;Hu, Peng;Sung, Kyunghyun;Wang, Danny JJ
    • Investigative Magnetic Resonance Imaging
    • /
    • v.21 no.4
    • /
    • pp.210-222
    • /
    • 2017
  • Purpose: To develop a novel combination of controlled aliasing in parallel imaging results in higher acceleration (CAIPIRINHA) with integrated SSFP (CAIPI-iSSFP) for accelerated SSFP imaging without banding artifacts at 3T. Materials and Methods: CAIPI-iSSFP was developed by adding a dephasing gradient to the balanced SSFP (bSSFP) pulse sequence with a gradient area that results in $2{\pi}$ dephasing across a single pixel. Extended phase graph (EPG) simulations were performed to show the signal behaviors of iSSFP, bSSFP, and RF-spoiled gradient echo (SPGR) sequences. In vivo experiments were performed for brain and abdominal imaging at 3T with simultaneous multi-slice (SMS) acceleration factors of 2, 3 and 4 with CAIPI-iSSFP and CAIPI-bSSFP. The image quality was evaluated by measuring the relative contrast-to-noise ratio (CNR) and by qualitatively assessing banding artifact removal in the brain. Results: Banding artifacts were removed using CAIPI-iSSFP compared to CAIPI-bSSFP up to an SMS factor of 4 and 3 on brain and liver imaging, respectively. The relative CNRs between gray and white matter were on average 18% lower in CAIPI-iSSFP compared to that of CAIPI-bSSFP. Conclusion: This study demonstrated that CAIPI-iSSFP provides up to a factor of four acceleration, while minimizing the banding artifacts with up to a 20% decrease in the relative CNR.

Switching Element-Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks (Part II):Scheduling Lengths and Nonblocking Property (광 베니언-유형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제2부):스케줄링 길이 및 넌블럭킹 특성)

  • Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.657-664
    • /
    • 2001
  • In our predecessor paper(Part I)[13], we introduced a graph that represents the crosstalk relationship among multicast connections in the photonic Banyan-type switching network, and found the upper bound on the degree of it. In this paper(Part II), we consider the number of routing rounds(i.e., scheduling length) required for SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks. Unfortunately, the problem to find an optimal scheduling length is NP-complete thus, we propose an approximation algorithm that gives its scheduling length is always within double of the upper bound on the optimal length. We also study the scheduling length on the Iink-disjoint(i.e., nonblocking) multicasting. Various nonblocking Banyan-type multicasting networks are found under the scheduling lengths.

  • PDF

Implementation of Feedback Controller on the Servo System (교류서보계의 궤환제어 구현)

  • Chun, Sam-Suk;Park, Chan-Won
    • Proceedings of the KIEE Conference
    • /
    • 2006.07b
    • /
    • pp.719-720
    • /
    • 2006
  • In the mechanical system, optimization of motion control is very essential in the aspect of automation technique progress. In the servo system, the function of controller is very important but most of the controllers have played only the role of pulse generator because the controller with main function is very expensive. In this thesis, the system was composed of PC, commonly used driver AC servo motor and a produced control board. The PC transmit a gain, a locus data to a driver and controller. At the same time, it converts imformation from the controller and convert them into data and offer an output with graph. The role of a controller is to trasmit a locus data to a driver and counting the pulse on the phase of an encoder to the PC. We have performed the experiment in order to confirm with variable PID parameter capable of the optimization of gain tuning with the counting of feedback control sensor signal with regard to the external interface into the system, such as torque. Based on the experiment result, we have confirmed as follows: First, it was confirmed that we could easily input control factors P.I Gain, constant $K_P,\;K_I$ into PC. Second, not only pulse generator function was possible, but with this pulse it was also possible to count using software with PIC chip. And third, using the multi-purpose PIC micro chip, simple operation and the formation of small size AC Servo Controller was possible.

  • PDF

Application of Organized Media for Rapid Spectrofluorimetric Determination of Trace Amounts of Cr(VI) in the Presence of Cr(III)

  • Madrakian, Tayyebeh;Afkhami, Abbas;Mohammadnejad, Masoumeh
    • Bulletin of the Korean Chemical Society
    • /
    • v.30 no.6
    • /
    • pp.1252-1256
    • /
    • 2009
  • A simple, selective and sensitive fluorescence quenching method was developed to the determination Cr(VI). The method is based on the oxidation of $I^-\;to\;{{I_3}^-}$ by Cr(VI) in sulfuric acid solution followed by immediate formation of ion association compound between I3 − and rhodamine 6G in Tween-80 micellar media at room temperature. The influence of several surfactants on rhodamine 6G fluorescence signal was studied; particular attention was paid in the aggregation behavior of rhodamine 6G–Tween-80 system. The experimental parameters (e.g., type of surfactant, reagent concentration) were studied and the optimal conditions were established. The linear calibration graph was obtained in the range 2.0 - 100.0 ng m$L^{-1}$ Cr(VI). The detection limit of the method was 0.37 ng m$L^{-1}$. The relative standard deviation (R.S.D.) is less than 5% (n = 5). The efficiency of the method for the determination of Cr(VI) in the presence of Cr(III) in the sample was investigated. The method was applied successfully to the determination of Cr(VI) and total Cr in water, and liver tissue samples.