• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1078-1099
• /
• 2021

Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.486-501
• /
• 2005

XPDL is a XML-based language for process definition exchange that is proposed by WfMC. This paper propose a model which model XPDL document structure (Schema) using UML in order to define and to exchange workflow process, and make business flow understanding ease for inter-business cooperation. So, we define mapping rules in which map XPDL documents into UML class diagram and UML activity diagram. By these mapping rules, elements composing XPDL process meta-model are mapped into UML class diagram, and process activities are mapped into UML activity diagram. Also, we apply proposed mapping technique to model a workflow of (')Credit card state check system.(')

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.1-30
• /
• 2013

The capitalization of know-how, knowledge management, and the control of the constantly growing information mass has become the new strategic challenge for organizations that aim to capture the entire wealth of knowledge (tacit and explicit). Thus, knowledge mapping is a means of (cognitive) navigation to access the resources of the strategic heritage knowledge of an organization. In this paper, we present a new mapping approach based on the Boolean modeling of critical domain knowledge and on the use of different data sources via the data mining technique in order to improve the process of acquiring knowledge explicitly. To evaluate our approach, we have initiated a process of mapping that is guided by machine learning that is artificially operated in the following two stages: data mining and automatic mapping. Data mining is be initially run from an induction of Boolean case studies (explicit). The mapping rules are then used to automatically improve the Boolean model of the mapping of critical knowledge.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.67-80
• /
• 2022

In this paper, we propose a system which automatically generates the ShEx schemas to describe and validate RDF knowledge graphs constructed by RML mapping. ShEx schemas consist of constraints. The proposed system generates most of the constraints by converting the RML mapping rules. The schemas consisting only of constraints obtained from mapping rules can help users to figure out the structure of the graphs generated by RML mapping, but they are not sufficient for sophisticated validation purposes. For users who need a schema for validation, the proposed system is also able to provide the schema with added constraints generated from metadata extracted from the input data sources for RML mapping. The proposed system has the ability to handle CSV, XML, JSON or RDBMS as input data sources. Testing results from 297 cases show that the proposed system can be applied for RDF graph validation in various practical cases.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.52-57
• /
• 2003

In this paper, we propose a Fuzzy Classifier System(FCS) to find a set of fuzzy rules which can carry out the edge detection. The classifier system of Holland can evaluate the usefulness of rules represented by classifiers with repeated learning. FCS makes the classifier system be able to carry out the mapping from continuous inputs to outputs. It is the FCS that applies the method of machine learning to the concept of fuzzy logic. It is that the antecedent and consequent of classifier is same as a fuzzy rule. In this paper, the FCS is the Michigan style. A single fuzzy if-then rule is coded as an individual. The average gray levels which each group of neighbor pixels has are represented into fuzzy set. Then a pixel is decided whether it is edge pixel or not using fuzzy if-then rules. Depending on the average of gray levels, a number of fuzzy rules can be activated, and each rules makes the output. These outputs are aggregated and defuzzified to take new gray value of the pixel. To evaluate this edge detection, we will compare the new gray level of a pixel with gray level obtained by the other edge detection method such as Sobel edge detection. This comparison provides a reinforcement signal for FCS which is reinforcement learning. Also the FCS employs the Genetic Algorithms to make new rules and modify rules when performance of the system needs to be improved.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.30 no.4
• /
• pp.29-50
• /
• 2019

This study was to suggest the considerations for application profiles of 2019 revised RDA using literature reviews and case studies according to new RDA that revised in order to reflect the LRM and linked data. First, the additional elements were recommended as the contents of application profiles such as inverse element, broader element, narrow element, domain, range, alternate label name, mapping to MARC, mapping to BIBFRAME, and RDA description examples as new elements as well as element name, element ID, element URL, description method, vocabulary encoding scheme, data provenance element, data provenance value, and notes as the elements that were already suggested by previous researches. Second, RDA rules' representations in forms of flow chart and application profiles through analyzing RDA rules were suggested in order to apply the rules to RDA application profiles to structure the rules in which every element has 4 types of description method, many conditions, and options. Third, the RDA mapping to BIBFRAME was suggested in RDA application profiles because RDA and BIBFRAME are co-related in context of content standard and encoding format, and mapping BIBFRAME and RDA is necessitated for programming BIBFRAME editors with RDA as content standard. This study will contribute to find the methods for constructing RDA application profiles and BIBFRAME application profiles with RDA as content standard.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.175-177
• /
• 2004

In this paper, we provide a mechanism to map topics between similar Topic Map ontologies, which enlarge the capacities of current Topic Maps. That is, there is no explicit way to map topics across multiple Topic Maps in current technology. Therefore, our approach provide semi-automatic or automatic mapping of topics between Topic Maps. In order to map the topics, we provide precise definitions of mapping properties and mapping rules.

• Journal of KIBIM
• /
• v.9 no.2
• /
• pp.21-28
• /
• 2019

Recently, many scan projects are gradually increasing for maintenance, construction. The scan data contains useful data, which can be generated in the target application from the facility, space. However, modeling the scan data required for the application requires a lot of cost. In example, the converting 3D point cloud obtained from scan data into 3D object is a time-consuming task, and the modeling task is still very manual. This research proposes Scan-to-Geometry Mapping Rule Definition (S2G-MD) which maps point cloud data to geometry for irregular building plane objects. The S2G-MD considers user use case variability. The method to define rules for mapping scan to geometry is proposed. This research supports the reverse engineering semi-automatic process for the building planar geometry from the user perspective.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.429-438
• /
• 2008

NGN is a packet-based converged network to support session and non-session services in QoS-enabled broadband transport network. QoS based resource control must be defined to support differentiated services for various network users in NGN. We designed and implemented DIAMETER protocol as the Rs interface, and also defined mapping rules between DIAMETER information elements and SDP(Session Description Protocol) attributes for QoS based resource control in NGN. We selected and implemented DIAMETER protocol among alternate resource control protocols in ITU-T as the Rw interface because of simple interworking method with Rs interface and adequate AAA functionality. We defined mapping rules of messages and information elements between Rs and Rw interfaces for resource control from a service layer to a transport layer. Based on the mapping rule of QoS information elements and the interworking method between Rs and Rw interfaces, we built up a test-bed that support differentiated delivery services.

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.423-438
• /
• 2017

The aim of this paper is to present two new viscosity rules for nonexpansive mappings in Hilbert spaces. Under some assumptions, the strong convergence theorems of the purposed new viscosity rules are proved. Some applications are also included.