• International Journal of Knowledge Content Development & Technology
• /
• v.2 no.1
• /
• pp.51-65
• /
• 2012

While science and technology information service portals and heterogeneous databases produced in Korea and other countries are integrated, methods of connecting the unique classification systems applied to each database have been studied. Results of technologists' research, such as, journal articles, patent specifications, and research reports, are organically related to each other. In this case, if the most basic and meaningful classification systems are not connected, it is difficult to achieve interoperability of the information and thus not easy to implement meaningful science technology information services through information convergence. This study aims to address the aforementioned issue by analyzing mapping systems between classification systems in order to design a structure to connect a variety of classification systems used in the academic information database of the Korea Institute of Science and Technology Information, which provides science and technology information portal service. This study also aims to design a mapping system for the classification systems to be applied to actual science and technology information services and information management systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.775-783
• /
• 1990

In this paper we implemented the fast thinning unit by modifying the pipeline architecture which was proposed by Stanley R. Sternberg. The unit is useful in preprocessing such as image representation and pattern recognition etc. This unit is composed of interface part, local memory part, address generation part, thinning processing part and control part. In thinning processing part, we shortened the thinning part which performed by means of look up table using window mapping table. Thus we improved the weakness of SAP, in which the number of delay pipeline and window pipeline are equal to image column size. Two independent memorys using tri-state buffer enable the two direction flow of address generated by address generation part. This unit avoids the complexity of architecture and has flexibility of image size by means of simple modification of logic bits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.207-223
• /
• 2019

Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.3
• /
• pp.99-106
• /
• 2019

Technology that cannot be excluded from 4th industry is self-driving sector. The self-driving sector can be seen as a key set of technologies in the fourth industry, especially in the DB sector is getting more and more popular as a business. The DB, which was previously produced and managed in two dimensions, is now evolving into three dimensions. Among the data obtained by Mobile Mapping System () to produce the HD MAP necessary for self-driving, Point Cloud, which is LiDAR data, is used as a DB because it contains accurate location information. However, at present, it is not widely used as a base data for 3D modeling in addition to HD MAP production. In this study, MMS Point Cloud was used to extract facilities around the road and to overlay the location to expand the usability of Point Cloud. Building utility poles and communication poles DB from Point Cloud and comparing road name address base and location, it is believed that the accuracy of the location of the facility DB extracted from Point Cloud is also higher than the basic road name address of the road, It is necessary to study the expansion of the facility field sufficiently.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.154-160
• /
• 2014

The address resolution protocol (ARP) provides dynamic mapping between two different forms of addresses: the 32-bit Internet protocol (IP) address of the network layer and the 48-bit medium access control (MAC) address of the data link layer. A host computer finds the MAC address of the default gateway or the other hosts on the same subnet by using ARP and can then send IP packets. However, ARP can be used for network attacks, which are one of the most prevalent types of network attacks today. In this study, a new ARP algorithm that can prevent IP spoofing attacks is proposed. The proposed ARP algorithm is a broadcast ARP reply and an ARP notification. The broadcast ARP reply was used for checking whether the ARP information was forged. The broadcast ARP notification was used for preventing a normal host's ARP table from being poisoned. The proposed algorithm is backward compatible with the current ARP protocol and dynamically prevents any ARP spoofing attacks. In this study, the proposed ARP algorithm was implemented on the Linux operating system; here, we present the test results with respect to the prevention of ARP spoofing attacks.

• Journal of the Korea Society for Simulation
• /
• v.27 no.4
• /
• pp.27-45
• /
• 2018

The terrestrial communication network and the underwater acoustic communication network have very different communication characteristics each other in operational environments, communication media, propagation delay, frequency bandwidth, transmission speed, bit error rate, and so on. These different characteristics cause some different address schemes and different maximum transmission units and, as a result, these differences must form certainly obstacles to the intercommunication between a terrestrial communication network and an underwater acoustic communication network. In this paper, we presents a method to use the virtual addresses to resolve the interconnection problem caused by different address schemes between a terrestrial communication network and an underwater acoustic communication network, and, through a mathematical modeling, we analyze the performance on the message transceiving delay time in the underwater environment.

• Journal of Korea Spatial Information System Society
• /
• v.3 no.1 s.5
• /
• pp.89-94
• /
• 2001

The purpose of this study is development of the management system for convenient use of new address guide system for systematic management and use of spatial information gained by mapping of numerical map of building and road to large basic new address, survey and input of main gate, decision of the road session, naming and input of road name, grant of numbering of all houses and buildings, new address guide, real life geographical information and added information service on Web-site in Jecheon-city area. In this study, the development and establishment of new address management in local cities are designed by making full use of GIS function of client server based system. In the result, the effectiveness of new address management system of Jecheon- city could be highly increased owing to not only citizens' easy access but also easy availability of various informations necessary in life by developed its system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.80-89
• /
• 2001

The development in the mobile computing systems have arisen new and previously unforeseen problems, such as problems in information management of mobile host, disconnection of mobile host and low bandwidths of wireless communications. Especially, location information management strategy of mobile host results in an increased overhead in mobile computing systems. Due to the mobility of the mobiles host, the changes in the mobile host's address depends on the mobile host's location, and is maintained by mapping physical address on virtual address, Since previously suggested several strategies for mapping method between physical address and virtual address did not tackle the increase of mobile host and distribution of location information, it was not able to support the scalability in mobile computing systems. Thus, to distribute the location inrormation, we propose an advanced n-depth LiST (Location information Search Tree) and the parallel location search and update strategy based on the advanced n-depth LiST. The advanced n-depth LiST is logically a hierarchical structure that clusters the location information server by ring structure and reduces the location information search and update cost by parallel seatch and updated method. The experiment shows that even though the distance of two MHs that communicate with each other is large, due to the strnctural distribution of location information, advanced n-depth LiST results in good performance. Moreover, despite the reduction in the location information search cost, there was no increase in the location information update cost.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.6
• /
• pp.591-598
• /
• 2020

The all revision of the Road Name Address Act, which contains the contents to be used by expanding the road name address as a means of indicationg the location, has been resloved by the National Assembly. Addresses will be assigned to large-sized facilities (3D mixed-use complex spaces). Here, the 3D (Three-dimensional) address is assigned an indoor path section in the inner passage, dividing the section at intervals. The 3D address will be built on the address information map. For 3D address, data should be built and managed for a 3D complex space(indoor space). Therefore, in this study, the object of the 3D address is defined based on the address conceptual model defined in the international standard, and the 3D address data model is proposed based on IndoorGML. To this, it is proposed as a method of mapping the Core and Navigation module of IndoorGML so that the entity of the 3D address can be expressed in IndoorGML. This study has a limitation in designing a 3D address data model only, but it is meaningful that it suggested a standard for constructing 3D address data in the future.