• Industry Promotion Research
• /
• v.9 no.2
• /
• pp.45-58
• /
• 2024

This study modelled the social network structure characteristics between Innopolis Start-ups located in Daejeon and Innopolis Start-ups' customers scattered across the country as a tendency of regional clustering among homogeneous technologies, and the observed values were included within the 95% confidence interval of the ERGM(Exponential Random Graph Model) analysis model. If both the research institute and the customer company are located in Yuseong-gu, Daejeon, the probability of being connected is about 13 times higher than if they are located in other administrative districts, and there is a strong tendency of connection between firms with the same technology with a negative value of assortment and homogeneity (0.1904), especially among the six technology sectors, with a P value of 0.035. There was a negative value (-0.0035) among firms not located in Yuseong-gu, with less clustering tendency. This confirms that Yuseong-gu, Daejeon, where the Daedeok Innopolis is located, is forming the centre of an innovation cluster.

• The Korean Journal of Ecology
• /
• v.13 no.2
• /
• pp.83-92
• /
• 1990

Two-dimensional analysis provides a comprehensive description of the structure, scales of pattern and directional components in a spatial data set. In spectral analysisi, four functions are illustrated,; the autocorrelation, the periodogram, the R-spectrum and the $\theta$ -spectrum. The R-spectrum and $\theta$ -spectrum function respectively summarize the periodogram in term of scale of pattern and directional components. Sampling is measured in the Naejang National Park area where the Daphniphyllum trees grow. 320 contiguous (15$\times$15)m plots are located along the transect and density of all trees over DBH 3 cm recorded respectively. 12 species of vascular plant are recorded in this survey area. The trend surface of density of all plant are estimated using polynomial regression and are exhibited in 3-dimensional graph and density contour map. Transformation to the corresponding polar spectrum from the periodogram emphasized the directional components and the scales to pattern. R-spectrum corresponding to the scale of pattern of periodogram showed a large peak 15.47 in the interval 9$\theta$-spectrum corresponding to directional components have two peaks 8.28 and 11.05 in the interval $35^{\circ}\theta <45^{\circ}and 125^{\circ}\theta< <135^{\circ}, respectively. Programs to compute all the analyses described in this study was obtained from Dr. Ranshow and was translated to BASIC by the author.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.139-147
• /
• 2017

Most of the information prevailing in the Internet space consists of textual information. So one of the main topics regarding the huge document analyses that are required in the "big data" era is the development of an automated understanding system for textual data; accordingly, the automation of the keyword extraction for text summarization and abstraction is a typical research problem. But the simple listing of a few keywords is insufficient to reveal the complex semantic structures of the general texts. In this paper, a text-visualization method that constructs a graph by computing the related degrees from the selected keywords of the target text is developed; therefore, two construction models that provide the edge relation are proposed for the computing of the relation degree among keywords, as follows: influence-interval model and word- distance model. The finally visualized graph from the keyword-derived edge relation is more flexible and useful for the display of the meaning structure of the target text; furthermore, this abstract graph enables a fast and easy understanding of the target text. The authors' experiment showed that the proposed abstract-graph model is superior to the keyword list for the attainment of a semantic and comparitive understanding of text.

• The Journal of Information Systems
• /
• v.9 no.1
• /
• pp.27-44
• /
• 2000

The structure of neural networks is represented by a weighted directed graph with nodes representing units and links representing connections. Each link is assigned a numerical value representing the weight of the connection. In learning process, the values of weights are adjusted by errors. Following experiment results, the interval of adjusting weights, that is, epoch size influenced neural networks＇ performance. As epoch size is larger than a certain size, neural networks＇performance decreased drastically. And the number of hidden layer＇s node also influenced neural networks＇performance. The networks＇performance decreased as hidden layers have more nodes and then increased at some number of hidden layer＇s node. So, in implementing of neural networks the epoch size and the number of hidden layer＇s node should be decided by systematic methods, not empirical or heuristic methods.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.03a
• /
• pp.305-313
• /
• 2010

HDPE smooth and textured GMs were cut into dumbbell shape and notched where depth of the notch produced a ligament thickness of 90% to 10% of the nominal thickness of the specimen at 10% interval. Yield stress and elongation were measured of those samples and plotted on Graph. Yield stress and elongation at yield point decreases gradually as the notch depth is increased. Both installations damaged and notched GMs were used to understand stress crack behavior. Intact sample were notched in such a manner that the depth of notch produced a ligament thickness of 80% of the nominal thickness of the specimen. Installation damaged samples were not notched. Stress Crack Resistance behavior was observed using NCTL Test at $50{\pm}1^{\circ}C$ at different yield stresses immerging with pH 4 and pH 12 buffer solutions. Significant difference was observed in both cases.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.4
• /
• pp.84-89
• /
• 1984

In the design of digital system, designers use multi-layer LSI to connect all signal sets between circuit modules. This paper suggests how to minimize upper street congestions and lower congestions in the single-row routing, a routing method of multi-layer LSI. This paper suggests the heuristic algorithm which minimize upper street congestions and lower street congestions by suggesting interval graph and relational operator and finding out of the order of signal sets The algorithm was implemented on a VAX-11/780 computer and illustrated by means of examples.

• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.219-232
• /
• 1998

A lot of difficulties exist in analyzing the structure of a system owing to the complex and organic relations in the systems we face in reality. Focuses have been put on the research of optimal solution in a defined structure, however, on the assumption that the structure of the system has been already defined. With the grasping of the structure as the most prior condition, ISM(Interpretive Structural Modeling) and FSM(Fuzzy Structural Modeling) are suggested as solutions in this paper. ISM uses the systematic application of some elementary notions of graph theory and boolean algebra, FSM uses Fuzzy conception for representing relationship between elements. In FSM, the entries in the relation matrix are taken to value on the interval [0,1] by virtue of a fuzzy binary relation. Numeric examples are used as the actual application as follows.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.888-897
• /
• 2015

Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near-optimal schedule, a maximum-weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1632-1634
• /
• 2010

고성능 재구성형 어레이 아키텍처는 애플리케이션에 내재된 병렬성을 충분히 활용하도록 풍부한 하드웨어 리소스로 구성되어 있다. 이러한 하드웨어 리소스는 소프트웨어 파이프라이닝 기반 코드할당 기법을 통하여 사용된다. 이러한 코드할당 기법은 기존의 소프트웨어 파이프라이닝 기법에 FPGA 에서의 라우팅 & 위치선정기법이 연결된 형식으로 구성된다. 이러한 기존의 연구들은 데이터 흐름 (data flow)을 단순한 형태로 가정하여 개발되었다. 따라서 루프 코드 펼침 (loop unrolling)에 따라서 발생되는 데이터 복사에 의한 흐름 (copy flow)은 코드 매핑할 때 고려하지 않기 때문에 소프트웨어 파이프라이닝 적용시 네트웍 리소스의 중복사용으로 인한 데이터 충돌문제(data congestion)로 Minimum Initiation Interval (MII)증가에 따르는 성능 저하가 발생할 수 있다. 본 연구에서는 다양한 데이터 복사 흐름까지 고려하도록 데이터 의존도 그래프 (Data Dependence Graph, DDG)를 확장하여 스케쥴링 단계에서 데이터 충돌 지연에 의한 MII 증가를 방지하여 최적의 시스템 성능을 얻도록 코드 할당 기법을 개발하였다.