• Title/Summary/Keyword: A 스타

Search Result 1,546, Processing Time 0.026 seconds

Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n) (하이퍼스타 연결망 HS(2n,n)의 에지 중복 없는 최적 스패닝 트리)

  • Kim, Jong-Seok;Kim, Sung-Won;Lee, Hyeong-Ok
    • The KIPS Transactions:PartA
    • /
    • v.15A no.6
    • /
    • pp.345-350
    • /
    • 2008
  • Recently, a HyperStar network HS(2n,n) has been introduced as a new interconnection network of new topology for parallel processing. HyperStar network has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show a construction algorithm of edge-disjoint spanning trees in HyperStar network HS(2n,n). Also, we prove that edge-disjoint spanning tree by the algorithm is optimal.

Impact of a length of drama broadcasting on celebrity casting (드라마의 방영기간이 스타배우 기용에 미치는 영향)

  • Gong, YuTong;Shin, Hyung-Deok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.6
    • /
    • pp.302-308
    • /
    • 2020
  • This study investigated when TV drama producers choose famous actor/actress based on 288 TV dramas aired in Korea from January 2014 to December 2017. We considered the length of drama, measured by the number of episodes, as a major determinant for choosing famous actor/actress, as well as the existence of originals, use of independent producing agents, and producers' fame as interacting factors between length of drama and choosing famous actor/actress. We detected that drama length had a significant effect while original dramas had an interacting effect. We interpret this result as the effect of mismanagement of drama producing. While a famous actor/actress has the potential to provide economic gains to drama producers, drama producers should be careful in choosing him/her since his/her drama guarantee should be high. This is why producers should choose a famous actor/actress when the length of the drama is short and should prefer an original drama.

Induction of Oocyte Ovulation and Prostaglandin Synthesis by Gonadotropin and Phorbol Ester in vitro in Amphibian (Rana n igromacu la ta) Ovarian Follicles (뇌하수체 호르몬과 포르볼에스터에 의한 참개구리 난자의 배란과 프로스타글라딘 합성유도)

  • 장경자;나철호;소재목;이원교;권혁방
    • The Korean Journal of Zoology
    • /
    • v.39 no.3
    • /
    • pp.266-272
    • /
    • 1996
  • Experiments were carried out to ascertain whether gonadotropin or a phorbol ester (12-O-tetradecanoyl phorbol-13-acetate, TPA) induces oocyte ovulation and stimulates prostaglandin synthesis by Rana ovarian follicles in vitro. Rana nigromaculata collected from underground in spring were utilized for the present experiment. Treatment of frog pituitary homogenate (FPH) or TPA to ovarian fragments in culture induced oocyte ovulation in a dose dependent manner and stimulated prostaglandin F2a (PGF$_2$$\alpha$ synthesis. Both treatruents were more effective in inducing the ovulation and PGF$_2$$\alpha$ secretion by the follicles obtained in May than those in April. A Protein kinase C inactivator, 1-(5-isoquinolinyl-sulfonyl)-2-methyl-piperazine (H-7), or cyclooxygenase inhibitor, indomethacin (IM) suppressed the FPH- or TPA-induced PGF$_2$$\alpha$ production, but IM failed to suppress the FPH- or TPA-induced ovulation. Time course of oocyte ovulation and PGF$_2$$\alpha$ secretion by FPH and TPA treatments were very similar to each other. FPH stimulated progesterone secretion by the follicle but TPA failed to do so. Taken together, the data presented here suggest that protein kinase C (PKC) in follicle play a role in the ovulation process of Rana nigromaculata, probably via prostaglandin synthesis.

  • PDF

Optimization of attention map based model for improving the usability of style transfer techniques

  • Junghye Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.8
    • /
    • pp.31-38
    • /
    • 2023
  • Style transfer is one of deep learning-based image processing techniques that has been actively researched recently. These research efforts have led to significant improvements in the quality of result images. Style transfer is a technology that takes a content image and a style image as inputs and generates a transformed result image by applying the characteristics of the style image to the content image. It is becoming increasingly important in exploiting the diversity of digital content. To improve the usability of style transfer technology, ensuring stable performance is crucial. Recently, in the field of natural language processing, the concept of Transformers has been actively utilized. Attention maps, which forms the basis of Transformers, is also being actively applied and researched in the development of style transfer techniques. In this paper, we analyze the representative techniques SANet and AdaAttN and propose a novel attention map-based structure which can generate improved style transfer results. The results demonstrate that the proposed technique effectively preserves the structure of the content image while applying the characteristics of the style image.

Genetic Algorithm Using-Floating Point Representation for Steiner Tree (스타이너 트리를 구하기 위한 부동소수점 표현을 이용한 유전자 알고리즘)

  • 김채주;성길영;우종호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1089-1095
    • /
    • 2004
  • The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.

A Processor Allocation Strategy for Star Graph Multiprocessor Systems (스타그래프 다중처리시스템을 위한 프로세서 할당방법)

  • 이원주;권소라;전창호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.334-336
    • /
    • 2002
  • 본 논문에서는 스타그래프 다중처리시스템을 위한 새로운 프로세서 할당방범을 제안한다. 기존의 할당방법은 프로세서 단편화로 인해 작업을 처리할 서브스타를 형성하지 못하면 프로세서 할당이 지연되는 문제점이 있었다. 이러한 할당 지연은 작업의 대기시간을 증가시키고 시스템의 성능 향상을 제한한다. 본 논문에서 제안하는 할당방법은 프로세서 할당 지연이 발생하면 동적할당테이블을 사용하여 단편화된 프로세서의 주소론 재생성한다. 새로운 주소의 프로세서들로 가용 서브스타를 형성하여 할당함으로써 작업의 대기시간을 줄이고 프로세서 단편화를 최소화한다.

  • PDF

Status of unmanned vehicle communication technology (국방 무인이동체 통신 기술 현황)

  • Jinyoung Jang;Byounggi Kim;Jongsoo Lee;Wonyoung Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.1179-1180
    • /
    • 2023
  • 국방 분야의 데이터링크 기술은 다양한 군사 응용 분야에서 무인 항공기 및 다른 무인시스템과의 효율적인 통신을 위한 것으로 국내 국방 공용 데이터링크 기술 내용 및 대형/소형 무인이동체 장비 형상을 확인하였다. 소형 무인이동체 데이터링크를 지원하기 위하여 사용되는 기술 현황을 확인하고 문제점을 식별하였다. 마지막으로 향후 군 요구 사항을 충족하기 필요성 및 관련 세부 기술 개발 내용을 제시하였다.

Efficient Construction of Large Scale Steiner Tree using Polynomial-Time Approximation Scheme (PTAS를 이용한 대형 스타이너 트리의 효과적인 구성)

  • Kim, In-Bum
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.5
    • /
    • pp.25-34
    • /
    • 2010
  • By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.

Space Image and Preference of Stylish Hotel -Focusing on Verbal Image and Color Image of 'Stylish'- (스타일리시 호텔의 공간이미지와 선호도 -스타일리시의 언어이미지와 색채이미지를 중심으로-)

  • Jang, Mi-Jeong;Jang, Young-Soon;Rhie, Jin-Min
    • Science of Emotion and Sensibility
    • /
    • v.14 no.1
    • /
    • pp.49-58
    • /
    • 2011
  • This study is the one on space image and preference of stylish hotels. And in addition to them, it is the one to verify the minimal style arrangement in the survey results about verbal image and color image of stylish according to gender and age which are the precedent studies. The research result has found that there was no any meaningful difference in gender and age. And the result which extracted the representative languages to investigate correlationship between space image and verbal image of stylish has done that you feel that space image is stylish recognizing individual, sensuous, simple and urban characteristics. Also, space image and preference has done that there are B Hotel of Robby space, C Hotel of food and drink space and A Hotel of room space and color image and preference has done that there are respectively high brightness and low chroma, high brightness and low chroma and low brightness and low chroma. They are the same result with the minimal style arrangement which was recognized as the most stylish things in the precedent studies. It has found that the respondents recognize space image of Stylish hotels as refined, sensuous and individual one linguistically and space of high brightness and low chroma, low brightness and low chroma and low brightness and low chroma as the stylish things. The purpose of the study is to suggest the new design directions for stylish space display and design marketing.

  • PDF

Hyper-Star Graphs: A New Interconnection Network for Multicomputer (하이퍼-스타 그래프 : 다중 컴퓨터를 위한 새로운 상호 연결망)

  • Lee, Hyeong-Ok;Kim, Byeong-Cheol;Im, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.12
    • /
    • pp.3099-3108
    • /
    • 1998
  • 본 논문에서는 새로운 다중 컴퓨터의 위상으로 하이퍼-스타 그래프를 제안하고, 하이퍼-스타 그래프에 대하여 주요 망 척도인 분지수, 연결도, 확장성, 라우팅, 지름, 임베딩 등의 특징을 분석한다. 하이퍼-스타 그래프 HS(2n,n)에 에지를 한 개 추가한 folded 하이퍼-스타 그래프 FHS(2n,n)은 2nCn개의 노드를 갖고 널리 알려진 상호 연결망인 하이퍼큐브에 비해 상대적으로 분지수와 지름이 작은 값을 갖는 연결망이다. Folded 하이퍼-스타 그래프 FHS(2n,n)가 하이퍼큐브 Qn이 같은 노드 수를 가질 때 분지수$\times$지름에 대한 척도에 있어서 은 n2/2보다 작고, 하이퍼큐브 Qn와 그의 변형들보다 연결망의 망 비용에 있어서 우수함을 의미한다. 또한 하이퍼큐브 Qn과 n$\times$n 토러스를 하이퍼-스타 그래프 HS(2n,n)에 연장비율 2에 임베딩하는 방법을 보인다.

  • PDF