• Journal of the Korean Society for information Management
• /
• v.34 no.1
• /
• pp.177-195
• /
• 2017

This study attempts to infer research fronts using factor graph model based on heterogeneous features. The model suggested by this study infers research fronts having documents with the potential to be cited multiple times in the future. To this end, the documents are represented by bibliographic, network, and content features. Bibliographic features contain bibliographic information such as the number of authors, the number of institutions to which the authors belong, proceedings, the number of keywords the authors provide, funds, the number of references, the number of pages, and the journal impact factor. Network features include degree centrality, betweenness, and closeness among the document network. Content features include keywords from the title and abstract using keyphrase extraction techniques. The model learns these features of a publication and infers whether the document would be an RF using sum-product algorithm and junction tree algorithm on a factor graph. We experimentally demonstrate that when predicting RFs, the FG predicted more densely connected documents than those predicted by RFs constructed using a traditional bibliometric approach. Our results also indicate that FG-predicted documents exhibit stronger degrees of centrality and betweenness among RFs.

• Journal of Satellite, Information and Communications
• /
• v.2 no.2
• /
• pp.29-35
• /
• 2007

COMS satellite is a multipurpose satellite in the geostationary orbit, which accommodates multiple payloads of the Ka band Satellite Communication Payload, Meteorological Imager, and Geostationary Ocean Color Imager into a single spacecraft platform. In this paper, Korea's first innovative geostationary Communication, Ocean and Meteorological Satellite (COMS) program is introduced which is fully funded by Korean Government. The satellite platform is based on the Astrium EUROSTAR 3000 communication satellite, but creatively combined with MARS Express satellite platform to accommodate three different payloads efficiently for COMS. The goals of the Ka band satellite communication mission are to in-orbit verify the performances of advanced communication technologies and to experiment wide-band multi-media communication service. The Meteorological Imager mission is to continuously extract meteorological products with high resolution and multi-spectral imager, to detect special weather such as storm, flood, yellow sand, and to extract data on long-term change of sea surface temperature and cloud. The Geostationary Ocean Color Imager mission aims at monitoring of marine environments around Korean peninsula, production of fishery information (Chlorophyll, etc.), and monitoring of long-term/short-term change of marine ecosystem. The system design difficulties are in the different kinds of payload mission requirements of communication and remote sensing purposes and how to combine them into one to meet the overall satellite requirements. In this paper, Ka band communication payload system is more highlighted.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.303-316
• /
• 2011

Data aggregation is important in wireless sensor networks. However, it also introduces many security problems, one of which is that a compromised node may inject false data or drop a message during data aggregation. Most existing solutions rely on encryption, which however requires high computation and communication cost. But they can only detect the occurrence of an attack without finding the attacking node. This makes sensor nodes waste their energy in sending false data if attacks occur repeatedly. Even an existing work can identify the location of a false data injection attack but it has a limitation that at most 50% of total sensor nodes can participate in data transmission. Therefore, a novel approach is required such that it can identify an attacker and also increase the number of nodes which participate in data transmission. In this paper, we propose a monitoring-based secure data aggregation protocol to prevent against a compromised aggregator which injects false data or drops a message. The proposed protocol consists of aggregation tree construction and secure data aggregation. In secure data aggregation, we use integration of abnormal data detection with monitoring and a minimal cryptographic technique. The simulation results show the proposed protocol increases the number of participating nodes in data transmission to 95% of the total nodes. The proposed protocol also can identify the location of a compromised node which injects false data or drops a message. A communication overhead for tracing back a location of a compromised node is O(n) where n is the total number of nodes and the cost is the same or better than other existing solutions.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.1
• /
• pp.23-39
• /
• 2005

As developing satellite communication, the tracking range of the moving objects which move in local area is expanded to the whole world. However previous logistics management system is able to monitor freight which transporting in local area using mobile communication system. In this paper, we propose the reefer container management system that manages the location information and other related information such as temperature, humidity of container using the satellite system. The proposed system consists of three parts; data collector, satellite communication manager, reefer container information manager. And the proposed system uses the moving object index for managing the trajectory of container and tracing the location of container or vessel that is transporting the container, and supports various services such as reefer container and vessel tracking, container control and container statistics to logistic companies like shipper and forwarding agent. And the system can be increasing the quality of container transportation service to the shipper, and it makes the efficient management of reefer container to the shipping company.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.241-248
• /
• 2002

With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.989-998
• /
• 2005

Information systems are today becoming larger and mostly broadband-networked. This exposes them at a higher risk of intrusions and hacking than ever before. Of the technologies developed to meet information system security needs, risk analysis is currently one of the most actively researched areas. Meanwhile, due to the extreme diversity of assets and complexity of network structure, there is a limit to the level of accuracy which can be achieved by an analysis tool in the assessment of risk run by an information system. Also, the results of a risk assessment are most oftennot up-to-date due to the changing nature of security threats. By the time an evaluation and associated set of solutions are ready, the nature and level of vulnerabilities and threats have evolved and increased, making them obsolete. Accordingly, what is needed is a risk analysis tool capable of assessing threats and propagation of damage, at the same time as security solutions are being identified. To do that, the information system must be simplified, and intrusion data must be diagrammed using a modeling technique this paper, we propose a modeling technique information systems to enable security risk analysis, using SPICE and Petri-net, and conduct simulations of risk analysis on a number of case studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.706-715
• /
• 2004

In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4${\times}$4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4${\times}$4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2％ to 8％ in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.4
• /
• pp.1463-1469
• /
• 2013

Portland cement used as binding material in combination of ferrous iron for reductive dechlorination of chlorinated organics is already widely studied topic by several researchers. However there is no clear evidence about the component solely responsible in cement for trichloroethylene (TCE) dechlorination. Many researchers suspect that the ettringite, monosulfate phases associated with hydration of cement are responsible active agents for TCE dechlorination. This study deals with synthesizing different pure crystalline minerals like ettringite and monosulfate phases of cement hydration and check individual phase's TCE dechlorinating capacity in combination with ferrous iron. The results indicated that the synthesized minerals showed no reduction capacity for TCE. The findings in the present study is significant as it shows that ettringite and monosulfate phases which were suspected minerals by previous researchers for TCE dechlorination are not reactive. Hence it is suspected that some other mineral or mineral form in cement phase could be responsible for TCE degradation.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.432-446
• /
• 2008

Queries for tracing tag locations are among the most challenging requirements in RFID based applications, including automated manufacturing, inventory tracking and supply chain management. For efficient query processing, a previous study proposed the index scheme for storing tag objects, based on the moving object index, in 3-dimensional domain with the axes being the tag identifier, the reader identifier, and the time. In a different way of a moving object index, the ranges of coordinates for each domain are quite different so that the distribution of query regions is skewed to the reader identifier domain. Previous indexes for tags, however, do not consider the skewed distribution for query regions. This results in producing many overlaps between index nodes and query regions and then causes the problem of traversing many index nodes. To solve this problem, we propose a new disproportional insertion and split policy of the index for RFID tags which is based on the R*-tree. For efficient insertion of tag data, our method derives the weighted margin for each node by using weights of each axis and margin of nodes. Based the weighted margin, we can choose the subtree and the split method in order to insert tag data with the minimum cost. Proposed insertion method also reduces the cost of region query by reducing overlapped area of query region and MBRs. Our experiments show that the index based on the proposed insertion and split method considerably improves the performance of queries than the index based on the previous methods.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.37-57
• /
• 2006

To support Location Based Services, the technology to store and search locations information of moving objects effectively was needed. And the study about indexes to manage these moving objects effectively has been done. As these indexes for moving objects was not considered for the objects which are moving along constrained networks such as road and railroad, indexes for the moving objects based on constrained networks was proposed. But these kinds of indexes have two problems as following. First, as the indexes for the moving objects based on constrained networks is divided according to time domain, when the places of moving objects from the present to the past are needed, the problem to search past indexes as well as present indexes occurs. Second, in this case, we should construct both present indexes and past indexes, so we have no other choice but to spend space cost and reconstruction cost additionally. This paper proposes A Unified Index for Moving Objects in Constrained Networks to solve these kinds of problems. As this proposed indexes support both present location and past location of moving objects, it can solve the current problems such as when we search present and past location of moving objects, we need a separate processing procedure. And as it consolidated the common parts of current location indexes and past location indexes, we can use less space cost and reconstruction cost than when we maintain indexes separately.