• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.103-111
• /
• 2014

This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Reproductive and Developmental Biology
• /
• v.28 no.1
• /
• pp.45-52
• /
• 2004

To search a new porcine pheromonal odorants, this research for biostimulation and role of pheromone was augmented by means of "control system technologies" to offer a potentially useful and practical way to improve reproductive efficiency in livestock species. Therefore the 13 physicochemical parameters such as similarity indice (S), hydrophobicity (logP) and van der Waals molecule volume (MV) etc. of 54 steroid analogues, which are analogous of substrate molecules, 5$\alpha$-androst-16-en-3-one (P1) and 5$\alpha$-androst-16-en-3-ol (P2) of lipocalin as receptor of pig pheromones were calculated and discussed. The physicochemical properties of these steroid analogues were mainly followed by steric dissimilar of A and D ring in steroid nucleus. And we found that from correlation with S values and MV constants of molecules, the more MV constants are small, the more S values tend to approach 1. Based on this results, the S-values of 4-androsten-3,17-dione (P1-1) and 5 $\alpha$ -androstan-3-one (P2-1) were 1.0, respectively. The two compounds of them were chosen because they showed the same value each other at a side of hydrophobicity, molar refractivity and molecular volume. It is expected that the new two compounds will be able to substitute for P1 and P2, porcine pheromonal odorants.

• Journal of Information Science Theory and Practice
• /
• v.8 no.1
• /
• pp.6-19
• /
• 2020

When information professionals deal with other disciplines in the course of digital humanities projects, they often assume that they are dealing with 'needful users' who have an 'information gap' to fill. This paper argues that the traditional view that information/knowledge is transferred from an information specialist donor to a domain specialist receiver is no longer appropriate in the digital humanities context, where the gap-and-search (or gap-and-filler) approach to information has given way to more direct, explorative engagement with information. The paper asks whether information science and the practising profession are ready for this paradigm shift and examines information science conservatism in two common collaboration scenarios, library support and digital development. It is shown that information science theory still assumes a traditional donor role in both scenarios. How information scientists deal with conservatism in practice is discussed in the example of the Prior project, in which the information science team exerted an ambiguous, hybrid approach with both conservative and non-conservative elements. Finally, two rather hypothetical answers are offered to the question of how information professionals should approach scholarly collaboration in the digital humanities context, where users have ceased to be supplicants. From a purely pragmatic perspective, information scientists need to shift their focus from information needs to research practices and the implications of these practices for digital information systems. More fundamentally, the emergence of digital humanities challenges information professionals to transform information systems designed for searching into digital objects that can be explored more freely by the digital humanities community.

• Reproductive and Developmental Biology
• /
• v.31 no.1
• /
• pp.15-20
• /
• 2007

To search of a new porcine pheromonal odorant for biostimulation control system technologies to offer a potentially useful and practical way to improve reproductive efficiency in livestock species, the two dimensional quantitative structure-activity relationship (QSAR) models between physicochemical parameters as descriptors of 2-cyclohexyloxytetrahydrofurane (A), 2-phenoxytetrahydrofurane (B) analogues and binding affinity constant ($p[Od.]_{50}$) for porcine odorant-binding protein (pOBP) as receptor of pig pheromones were derived and disscused. The statistical quality of the optimized 2D-QSAR model is good ($r^{2}=0.964$) and accounts for 96.4% of the variance in the binding affinity constants. It was found that the binding affinity constants were dependent upon the optimal value, $(SL)_{opt.}=1.418$ of substituent lipole (SL) in molecules. Therefore, the SL constant was very important factor for binding affinity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1164-1174
• /
• 2007

Antenna selection based MIMO schedulers are proposed to achieve the optimal performance with low complexity in uplink multiuser MIMO/FDD system. In this paper, three heuristic schedulers are proposed to approach the optimal performance which is achieved by the optimal Brute-Force Scheduler. Two search methods called sub-set and full-set way are also discussed to set up the antenna channels to be the candidates of the scheduler. Simulation results show that the sum rate and BER performance of the proposed CSS and SOAS schemes are about the same to that of the brute-force scheduler with affordable complexity, while RC-SOAS with further reduced complexity achieves almost the optimal performance in the case of small number of antennas. Moreover, the complexity can be additionally reduced by the sub-set search method when the number of transmit and receive antennas are 2 respectively, which is applicable in the realistic systems.

• Journal of Platform Technology
• /
• v.8 no.4
• /
• pp.38-46
• /
• 2020

This study describes how to build a security control system using an open source big data solution so that private companies can build an overall security control infrastructure. In particular, the infrastructure was built using the Elastic Stack, one of the free open source big data analysis solutions, as a way to shorten the cost and development time when building a security control system. A comparative experiment was conducted. In addition, as a result of comparing and analyzing the functions, convenience, service and technical support of the two solution, it was found that the Elastic Stack has advantages in the security control of Big Data in terms of community and open solution. Using the Elastic Stack, security logs were collected, analyzed, and visualized step by step to create a dashboard, input large logs, and measure the search speed. Through this, we discovered the possibility of the Elastic Stack as a big data analysis solution that could replace Splunk.

• Journal of Korean Library and Information Science Society
• /
• v.12
• /
• pp.61-96
• /
• 1985

The human subject analysis of a document has some critical problems. The method results in the inconsistency in analysis process and the contradiction of two objects of the subject analysis (one is the identification of the content for the retrieval of specific items and the other is to identify the content for the grouping of related materials). Since the subject analysis by mechanized has been recognized to be the possible way to aggregate the problems of manual analysis, various a n.0, pproaches of automatic indexing have been studied and experimented. This study is to examine the automatic indexing as one of the promising subject analysis techniques by statistical, syntactical and semantic a n.0, pproaches. In conclusion, the reasonable a n.0, pplication time of the automatic indexing should be made a decision based on the through investigation on the cost verse effectiveness, and automatic indexing system should be developed in the close relationship with the on-line search which is a good retrieval system for information explosion society. From now on, since the machine-readable document-text will be envisaged to be more and more available due to the rapid development of computer technology, the more substantial research on the automatic indexing will be also possible, which can bring about the increasing of practical automatic indexing systems.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Journal of Korean Library and Information Science Society
• /
• v.9
• /
• pp.179-211
• /
• 1982

Many problems which today's research libraries are confronted with should be taken the measures to find some solutions in any ways. The purpose of this study is to identify the main stream of chaining of research libraries as an existing collector and distributor of scholarly information into a communication system adopting the concept of resource sharing and on-line bibliographic search as some possible ways for solutions. The conclusions of this study can be summarized as follows: 1) The research libraries will be imposed on more and more responsibilities to be a reservoir of the intellectual heritage of an individual, a nation and mankind. 2) The research libraries in the near future will have to develop their collections in the new environment of austerity with the limited budget. 3) It is more desirable for the future research libraries to have the attitude that they are in the business of information and communication rather than being an entity as "a library". 4) The resource sharing developed to solve the severe problems confrontal by research libraries will improve the organizational and technical mechanism for the access to the scholarly information. 5) The research libraries will produce more and more bibliographic database to expand the library materials which can be available and shared. 6) Though on-line search service will be sure to provide a considerable profit to the scholarly information users, it will take a long time for this service to be popularize because of the high ratio of service fee. 7) Two problems should be solved for the efficient service by on-line search. One is the continuous, updating training for the professional librarians. The other is that the common efforts for the quality control and standardization of data base by the data base producers should be made. 8) Taking all the items of the conclusions derived from the study of research libraries mainly in the United States into a consideration, the followings should be paid an attention. - The status-quo of the research libraries in Korea should be analyzed in very detailed and accurate way. - The problems of research libraries in Korea as the major scholarly communication system should be clarified based on the analysis. - The measures for the problems should be taken in the light of the unique characteristics of korean environment. - For the developing the most efficient measures, the formal organize action to lead and govern the long-aimed study on the problems of research libraries should be established and the government-level su n.0, pport for the legislation and finance should be provided for the realization of the result of the study.