• Journal of KIISE
• /
• v.45 no.3
• /
• pp.224-233
• /
• 2018

Recently, there are many of studies on SWRL reasoning engine based on user-defined rules in a distributed environment using a large-scale ontology. Unlike the schema based axiom rules, efficient inference orders cannot be defined in SWRL rules. There is also a large volumet of network shuffled data produced by unnecessary iterative processes. To solve these problems, in this study, we propose a method that uses Map-Reduce algorithm and distributed in-memory framework to deduce multiple rules simultaneously and minimizes the volume data shuffling occurring between distributed machines in the cluster. For the experiment, we use WiseKB ontology composed of 200 million triples and 36 user-defined rules. We found that the proposed reasoner makes inferences in 16 minutes and is 2.7 times faster than previous reasoning systems that used LUBM benchmark dataset.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.104-112
• /
• 2008

RFID/USN is considered important basic infra of ubiquitous community and tried practical adaption through various research. Specially, there is during researcher progresses for stock and state management of logistics to let you get at u-mart systems. It discern thing from warehouse to deliver as adhere RFID tag of palette in keeping unit of article and construct form of thing to analyze information of environment status using sence module based on function of wireless communication. in the paper, propose composition of customer satisfaction system using RFID chip in u-Mart status management system based on RFID/USN and according to analysis specific information of commodity, propose movement reader device to offer real-time information from customer. And it presents the improvement program for the provision of product information which is appropriate uses the RFID chip and the provision of control information in the customer who is a core of consuming.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.4
• /
• pp.265-269
• /
• 2009

A conference key agreement system is a scheme to generate a session key in a contributory manner in order to communicate with each other securely among participants. In this paper an efficient conference key agreement system is proposed by employing symmetric balanced incomplete block design(SBIBD), one class of block designs. The protocol presented not only minimizes the message overhead and message exchanging rounds but also makes every participant contribute evenly for generating a conference key. Our protocol constructs a conference key which takes modified Diffe-Helman form of ${\prod}_{i=0}^{v-1}R_i$, where v is the number of participants and $R_i$ is a random number generated from member i. In a special class of SBIBD, it takes only 3 rounds message exchange and message overhead is $O(v{\sqrt{v}})$. Our protocol can be proved as computationally difficult to calculate as discrete logarithms.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Membrane Journal
• /
• v.16 no.1
• /
• pp.1-8
• /
• 2006

Nanofiber is a broad phrase generally referring to a fiber with diameter less than 1 micron. Various polymers have been successfully electrospun into nanofibers in recent years. These nanofibers, due to their high surface area and porosity, have a great potential for use as filter medium, adsorption layers in protective clothing, etc. Nanofiber filters will enable new levels of filtration performance in the field of air filtration. In particular, nanofibers provide marked increases in filtration efficiency at relatively small pressure drop in permeability. Therefore, nanofiber filters could be substituted for conventional filter market due to the easy application of process and the possibility of coating to micron-sized non-woven sheets. This review is discussed on the trend of researche and development related to nanofiber filter including future marketability.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.219-228
• /
• 2012

As the wireless Internet become more widely accessible, variety of Internet services can be used without limitation of location. However, existing mobility management methods such as MIP and PMIP of IETF requires the load of heavy protocol stack on the mobile nodes or the addition of components such as LMA and MAG. In this paper, we proposed the location management technique in the PMIPv6 and Fast Handover technique. according to the moving pattern of the node, the location management technique proposed in order to adjust the paging area dynamically. The Fast Handover technique applied MIH technology and it reduced the handover signal processing time between heterogeneous network. The location management cost in the environment which the node moves in order to evaluate this and handover delay time was calculate. The proposal technique was efficiently more evaluated than PMIPv6 with the smallest 29% and maximum 83%.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.424-436
• /
• 2003

In this paper, we propose the Centroid-based Backbone Core Tree(CBCT) generation algorithm for the shared tree-based IP multicasting. The proposed algorithm is based on the Core Based Tree(CBT) protocol. Despite the advantages over the source-based trees in terms of scalability, the CBT protocol still has the following limitations; first, the optimal core router selection is very difficult, and second, the multicast traffic is concentrated near a core router. The Backbone Core Tree(BCT) protocol, as an extension of the CBT protocol has been proposed to overcome these limitations of the CBT Instead of selecting a specific core router for each multicast group, the BCT protocol forms a backbone network of candidate core routers which cooperate with one another to make multicast trees. However, the BCT protocol has not mentioned the way of selecting candidate core routers and how to connect them. The proposed CBCT generation algorithm employs the concepts of the minimum spanning tree and the centroid. For the performance evaluation of the proposed algorithm, we showed the performance comparison results for both of the CBT and CBCT protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.10
• /
• pp.1300-1305
• /
• 2020

Due to the simplicity of communication structure using RS-232 and RS-422, the majority ships have still adapted on these communication interfaces and have constructed their own communication network in the ship. NMEA-0183 is the one of standards for BNWAS(Bridge Navigational Watch Alarm System) and currently being used in many countries. BNWAS utilises diverse sensor devices, GPS, AIS and so on for monitoring the status of ships and their deployments and environmental information(temperature, humidity, wind speed/direction, water temperature/current etc…). This paper proposes the use of any image sensors in NMEA-0183 environment and verifies possibility with certain video qualities through the experiment results. Furthermore the paper gathers videos and monitors the change of their qualities depending on the number of NMEA messages on RS-232 communication link. Finally we make conclusion that our proposal is sufficiently appropriate for ship monitoring system in the NMEA-0183.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.879-884
• /
• 2020

In the conventional video file system, videos are stored in a high performance server which has mass storage hard disks or disk arrays. For 3D internet broadcasting, real time operations are required to transmit video files to many clients. This paper describes the design of the 3D internet broadcasting system which can provide realtime streaming service to many users in the 5G environment. In reality, unicast is used to transmit multimedia contents over the internet rather than IP multicast since IP multicast has its own drawbacks in deployment, security, maintenance and so on. In addition, multimedia broadcasting service system like VoD has difficulties in applying to 3D internet broadcasting system since it requires a large amount of system and network resources. In this work, we develop a 3D internet broadcasting system which can construct effective data delivery by minimizing performance-degrading factors.

• Journal of Convergence for Information Technology
• /
• v.11 no.6
• /
• pp.270-281
• /
• 2021

With the development of information technology, the size of insurance fraud is increasing rapidly every year, and the method is being organized and advanced in conspiracy. Although various forms of prediction models are being studied to predict and detect this, insurance-related information is highly sensitive, which poses a high risk of sharing and access and has many legal or technical constraints. In this paper, we propose a machine learning insurance fraud prediction model based on blockchain, one of the most popular technologies with the recent advent of the Fourth Industrial Revolution. We utilize blockchain technology to realize a safe and trusted insurance information sharing system, apply the theory of social relationship analysis for more efficient and accurate fraud prediction, and propose machine learning fraud prediction patterns in four stages. Claims with high probability of fraud have the effect of being detected at a higher prediction rate at an earlier stage, and claims with low probability are applied differentially for post-reference management. The core mechanism of the proposed model has been verified by constructing an Ethereum local network, requiring more sophisticated performance evaluations in the future.