• ETRI Journal
• /
• v.14 no.1
• /
• pp.118-125
• /
• 1992

다중 컴퓨터 연결망의 성능은 그 위상에 따라 크게 좌우되는데 현재까지 연구된 많은 연결망중에서 특히 하이퍼큐브 연결망은 노드수에 비해 비교적 적은 차수와 지름을 갖고 symmetric 하며 순환적 구성 (recursive decomposition structure) 특성을 갖고 있어 여러가지 알고리즘의 사상이 용이하여 많이 사용되고 있다. 여기서는 $Akers^2$ 등에 의해 제안되어 스타 그래프 (star graph) 에 대해 성능분석을 하였다. 분석 척도로는 노드간 평균거리를 사용하였으며 메시지 분포는 $Reed^(1)$가 사용한 분포를 사용하였다. 분석결과 스타 그래프 연결망은 하이퍼큐브와 비슷한 성능을 보였으며 노드 수가 많아질수록 더 나은 성능을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.334-336
• /
• 2002

본 논문에서는 스타그래프 다중처리시스템을 위한 새로운 프로세서 할당방범을 제안한다. 기존의 할당방법은 프로세서 단편화로 인해 작업을 처리할 서브스타를 형성하지 못하면 프로세서 할당이 지연되는 문제점이 있었다. 이러한 할당 지연은 작업의 대기시간을 증가시키고 시스템의 성능 향상을 제한한다. 본 논문에서 제안하는 할당방법은 프로세서 할당 지연이 발생하면 동적할당테이블을 사용하여 단편화된 프로세서의 주소론 재생성한다. 새로운 주소의 프로세서들로 가용 서브스타를 형성하여 할당함으로써 작업의 대기시간을 줄이고 프로세서 단편화를 최소화한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.357-358
• /
• 2008

폴디드 하이퍼스타 FHS(2n,n)은 하이퍼큐브와 그의 변형된 그래프보다 망 비용이 개선된 상호연결망이다. 본 논문에서는 폴디드 하이퍼스타 FHS(n-1,k-1)와 FHS(n-1,k) 그래프를 연결하여 폴디드 하이퍼스타 FHS(n,k)를 생성하는 방법을 제시하였다(단, n=2k). 또한, 정규 연결망 형태인 폴디드 하이퍼스타 FHS(2n,n)의 노드연결도는 n+1이고, 최대고장허용도를 가짐을 보인다.

• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.123-132
• /
• 2017

The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• Nuclear Engineering and Technology
• /
• v.51 no.3
• /
• pp.825-836
• /
• 2019

One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

• Journal of the Korean earth science society
• /
• v.40 no.5
• /
• pp.538-547
• /
• 2019

This study analyzes the conceptual understanding of in-service and pre-service earth science teachers about the H-R diagrams and evolution of stars using conceptual status analysis categories. The results show that (a) many teachers use unscientific language in the Intelligibility range, (b) teachers are categorized in Low scientific inquiry ability related to graph creation and unscientific analogy for scientific concept which is hightly corelated to the possibility of misunderstanding in the teaching process, and (c) pre-service teachers lack the understanding of the secondary science curriculum. It is necessary to develop pre-service curriculum that can be applied to the school site. In the category of Plausibility range, (d) both groups understood the cosmological meaning of stellar evolution. However, pre-service teachers do not specifically explain the mechanism of a star. In the category of Fruitfulness range, in-service teachers come up with educational problems reflecting the academic characteristics of earth science and apply their knowledge to actual problem solving. On the other hand, pre-service teachers show high nonresponse ratio, they do not see the H-R diagram and the evolution of stars as a practical concept. In the analysis process, both groups are found to have many unscientific conceptions about the H-R diagram and evolution of stars. Therefore, it is suggested that caution be used in developing a professional development program of earth science teachers.

• Journal of Intelligence and Information Systems
• /
• v.28 no.1
• /
• pp.107-129
• /
• 2022

It is important to preempt new technology because the technology competition is getting much tougher. Stakeholders conduct exploration activities continuously for new technology preoccupancy at the right time. Gartner's Hype Cycle has significant implications for stakeholders. The Hype Cycle is a expectation graph for new technologies which is combining the technology life cycle (S-curve) with the Hype Level. Stakeholders such as R&D investor, CTO(Chef of Technology Officer) and technical personnel are very interested in Gartner's Hype Cycle for new technologies. Because high expectation for new technologies can bring opportunities to maintain investment by securing the legitimacy of R&D investment. However, contrary to the high interest of the industry, the preceding researches faced with limitations aspect of empirical method and source data(news, academic papers, search traffic, patent etc.). In this study, we focused on two research questions. The first research question was 'Is there a difference in the characteristics of the network structure at each stage of the hype cycle?'. To confirm the first research question, the structural characteristics of each stage were confirmed through the component cohesion size. The second research question is 'Is there a pattern of diffusion at each stage of the hype cycle?'. This research question was to be solved through centralization index and network density. The centralization index is a concept of variance, and a higher centralization index means that a small number of nodes are centered in the network. Concentration of a small number of nodes means a star network structure. In the network structure, the star network structure is a centralized structure and shows better diffusion performance than a decentralized network (circle structure). Because the nodes which are the center of information transfer can judge useful information and deliver it to other nodes the fastest. So we confirmed the out-degree centralization index and in-degree centralization index for each stage. For this purpose, we confirmed the structural features of the community and the expectation diffusion patterns using Social Network Serice(SNS) data in 'Gartner Hype Cycle for Artificial Intelligence, 2021'. Twitter data for 30 technologies (excluding four technologies) listed in 'Gartner Hype Cycle for Artificial Intelligence, 2021' were analyzed. Analysis was performed using R program (4.1.1 ver) and Cyram Netminer. From October 31, 2021 to November 9, 2021, 6,766 tweets were searched through the Twitter API, and converting the relationship user's tweet(Source) and user's retweets (Target). As a result, 4,124 edgelists were analyzed. As a reult of the study, we confirmed the structural features and diffusion patterns through analyze the component cohesion size and degree centralization and density. Through this study, we confirmed that the groups of each stage increased number of components as time passed and the density decreased. Also 'Innovation Trigger' which is a group interested in new technologies as a early adopter in the innovation diffusion theory had high out-degree centralization index and the others had higher in-degree centralization index than out-degree. It can be inferred that 'Innovation Trigger' group has the biggest influence, and the diffusion will gradually slow down from the subsequent groups. In this study, network analysis was conducted using social network service data unlike methods of the precedent researches. This is significant in that it provided an idea to expand the method of analysis when analyzing Gartner's hype cycle in the future. In addition, the fact that the innovation diffusion theory was applied to the Gartner's hype cycle's stage in artificial intelligence can be evaluated positively because the Gartner hype cycle has been repeatedly discussed as a theoretical weakness. Also it is expected that this study will provide a new perspective on decision-making on technology investment to stakeholdes.

• Journal of The Korean Astronomical Society
• /
• v.29 no.spc1
• /
• pp.63-64
• /
• 1996

The nature of distant faint blue field galaxies remains a mystery, despite the fact that much attention has been devoted to this subject in the last decade. Galaxy counts, particularly those in the optical and near ultraviolet bandpasses, have been demonstrated to be well in excess of those expected in the 'no-evolution' scenario. This has usually been taken to imply that galaxies were brighter in the past, presumably due to a higher rate of star formation. More recently, redshift surveys of galaxies as faint as B$\~$24 have shown that the mean redshift of faint blue galaxies is lower than that predicted by standard evolutionary models (de-signed to fit the galaxy counts). The galaxy number count data and redshift data suggest that evolutionary effects are most prominent at the faint end of the galaxy luminosity function. While these data constrain the form of evolution of the overall luminosity function, they do not constrain evolution in individual galaxies. We are carrying out a series of observations as part of a long-term program aimed at a better understanding of the nature and amount of luminosity evolution in individual galaxies. Our study uses the luminosity-linewidth relation (Tully-Fisher relation) for disk galaxies as a tool to study luminosity evolution. Several studies of a related nature are being carried out by other groups. A specific experiment to test a 'no-evolution' hypothesis is presented here. We have used the AUTOFIB multifibre spectro-graph on the 4-metre Anglo-Australian Telescope (AAT) and the Rutgers Fabry-Perot imager on the Cerro Tolalo lnteramerican Observatory (CTIO) 4-metre tele-scope to measure the internal kinematics of a representative sample of faint blue field galaxies in the red-shift range z = 0.15-0.4. The emission line profiles of [OII] and [OIII] in a typical sample galaxy are significantly broader than the instrumental resolution (100-120 km $s^{-l}$), and it is possible to make a reliable de-termination of the linewidth. Detailed and realistic simulations based on the properties of nearby, low-luminosity spirals are used to convert the measured linewidth into an estimate of the characteristic rotation speed, making statistical corrections for the effects of inclination, non-uniform distribution of ionized gas, rotation curve shape, finite fibre aperture, etc.. The (corrected) mean characteristic rotation speed for our distant galaxy sample is compared to the mean rotation speed of local galaxies of comparable blue luminosity and colour. The typical galaxy in our distant sample has a B-band luminosity of about 0.25 L$\ast$ and a colour that corresponds to the Sb-Sd/Im range of Hub-ble types. Details of the AUTOFIB fibre spectroscopic study are described by Rix et al. (1996). Follow-up deep near infrared imaging with the 10-metre Keck tele-scope+ NIRC combination and high angular resolution imaging with the Hubble Space Telescope's WFPC2 are being used to determine the structural and orientation parameters of galaxies on an individual basis. This information is being combined with the spatially resolved CTIO Fabry-Perot data to study the internal kinematics of distant galaxies (Ing et al. 1996). The two main questions addressed by these (preliminary studies) are: 1. Do galaxies of a given luminosity and colour have the same characteristic rotation speed in the distant and local Universe? The distant galaxies in our AUTOFIB sample have a mean characteristic rotation speed of $\~$70 km $s^{-l}$ after correction for measurement bias (Fig. 1); this is inconsistent with the characteristic rotation speed of local galaxies of comparable photometric proper-ties (105 km $s^{-l}$) at the > $99\%$ significance level (Fig. 2). A straightforward explanation for this discrepancy is that faint blue galaxies were about 1-1.5 mag brighter (in the B band) at z $\~$ 0.25 than their present-day counterparts. 2. What is the nature of the internal kinematics of faint field galaxies? The linewidths of these faint galaxies appear to be dominated by the global disk rotation. The larger galaxies in our sample are about 2"-.5" in diameter so one can get direct insight into the nature of their internal velocity field from the $\~$ I" seeing CTIO Fabry-Perot data. A montage of Fabry-Perot data is shown in Fig. 3. The linewidths are too large (by. $5\sigma$) to be caused by turbulence in giant HII regions.