• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2101-2123
• /
• 2023

Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4275-4291
• /
• 2021

With the unprecedented growth of textual information on the Internet, an efficient automatic summarization system has become an urgent need. Recently, the neural network models based on the encoder-decoder with an attention mechanism have demonstrated powerful capabilities in the sentence summarization task. However, for paragraphs or longer document summarization, these models fail to mine the core information in the input text, which leads to information loss and repetitions. In this paper, we propose an abstractive document summarization method by applying guidance signals of key sentences to the encoder based on the hierarchical encoder-decoder architecture, denoted as KI-HABS. Specifically, we first train an extractor to extract key sentences in the input document by the hierarchical bidirectional GRU. Then, we encode the key sentences to the key information representation in the sentence level. Finally, we adopt key information representation guided selective encoding strategies to filter source information, which establishes a connection between the key sentences and the document. We use the CNN/Daily Mail and Gigaword datasets to evaluate our model. The experimental results demonstrate that our method generates more informative and concise summaries, achieving better performance than the competitive models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1477-1483
• /
• 2020

The stability guarantee of wireless network based control systems is still challenging due to the lossy links and node failures. This paper proposes a hierarchical cluster-based network protocol called robust wireless sensor and actuator network (R-WSAN) by combining time, channel, and space resource diversity. R-WSAN includes a scheduling algorithm to support the network resource allocation and a control task sharing scheme to maintain the control stability of multiple plants. R-WSAN was implemented on a real test-bed using Zolertia RE-Mote embedded hardware platform running the Contiki-NG operating system. Our experimental results demonstrate that R-WSAN provides highly reliable and robust performance against lossy links and node failures. Furthermore, the proposed scheduling algorithm and the task sharing scheme meet the stability requirement of control systems, even if the controller fails to support the control task.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.146-153
• /
• 2009

Recently, the research relative to NGN(Next Generation Network) is progressing in 3GPP(The 3rd Generation Partnership Progect), IETF(Internet Engineering Task Force), and so on. Although user needs frequently mobility which is various service pattern, In accordance with the development of these various applications, IMS(IP Multimedia Subsystem) and hierarchical networks ie, Femtocell/WiBro/3G etc is constructed for more user demands which provide service in anytime, anywhere. It is necessary to optimum network selection criterion which consider to wireless signal quality add to user service profile and service network traffic balance. NGN also needs a method to perform heterogeneous handover and to constraint Ping-pong phenomenon when using existing terminal-based handover decision. This paper proposes scheme for network selection and heterogeneous handover procedure in hierarchical wireless multi-access network based on SIP-MIH(Session Initiation Protocol-Media Independent Handover) with IMS by using user service profile that the considerations are dealing with not only selection and registration of various access network but also easy of developing the terminal.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.61-83
• /
• 2012

A knowledge map describes the network of related knowledge into the form of a diagram, and therefore underpins the structure of knowledge categorizing and archiving by defining the relationship of the referential navigation between knowledge. The referential navigation between knowledge means the relationship of cross-referencing exhibited when a piece of knowledge is utilized by a user. To understand the contents of the knowledge, a user usually requires additionally information or knowledge related with each other in the relation of cause and effect. This relation can be expanded as the effective connection between knowledge increases, and finally forms the network of knowledge. A network display of knowledge using nodes and links to arrange and to represent the relationship between concepts can provide a more complex knowledge structure than a hierarchical display. Moreover, it can facilitate a user to infer through the links shown on the network. For this reason, building a knowledge map based on the ontology technology has been emphasized to formally as well as objectively describe the knowledge and its relationships. As the necessity to build a knowledge map based on the structure of the ontology has been emphasized, not a few researches have been proposed to fulfill the needs. However, most of those researches to apply the ontology to build the knowledge map just focused on formally expressing knowledge and its relationships with other knowledge to promote the possibility of knowledge reuse. Although many types of knowledge maps based on the structure of the ontology were proposed, no researches have tried to design and implement the referential navigation-enabled knowledge map. This paper addresses a methodology to build the ontology-based knowledge map enabling the referential navigation between knowledge. The ontology-based knowledge map resulted from the proposed methodology can not only express the referential navigation between knowledge but also infer additional relationships among knowledge based on the referential relationships. The most highlighted benefits that can be delivered by applying the ontology technology to the knowledge map include; formal expression about knowledge and its relationships with others, automatic identification of the knowledge network based on the function of self-inference on the referential relationships, and automatic expansion of the knowledge-base designed to categorize and store knowledge according to the network between knowledge. To enable the referential navigation between knowledge included in the knowledge map, and therefore to form the knowledge map in the format of a network, the ontology must describe knowledge according to the relation with the process and task. A process is composed of component tasks, while a task is activated after any required knowledge is inputted. Since the relation of cause and effect between knowledge can be inherently determined by the sequence of tasks, the referential relationship between knowledge can be circuitously implemented if the knowledge is modeled to be one of input or output of each task. To describe the knowledge with respect to related process and task, the Protege-OWL, an editor that enables users to build ontologies for the Semantic Web, is used. An OWL ontology-based knowledge map includes descriptions of classes (process, task, and knowledge), properties (relationships between process and task, task and knowledge), and their instances. Given such an ontology, the OWL formal semantics specifies how to derive its logical consequences, i.e. facts not literally present in the ontology, but entailed by the semantics. Therefore a knowledge network can be automatically formulated based on the defined relationships, and the referential navigation between knowledge is enabled. To verify the validity of the proposed concepts, two real business process-oriented knowledge maps are exemplified: the knowledge map of the process of 'Business Trip Application' and 'Purchase Management'. By applying the 'DL-Query' provided by the Protege-OWL as a plug-in module, the performance of the implemented ontology-based knowledge map has been examined. Two kinds of queries to check whether the knowledge is networked with respect to the referential relations as well as the ontology-based knowledge network can infer further facts that are not literally described were tested. The test results show that not only the referential navigation between knowledge has been correctly realized, but also the additional inference has been accurately performed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.101-108
• /
• 2009

Since the use of wireless communication instruments was standardized, users expect to be provided with seamless information whenever and wherever they use the instruments. Also, some technology is required to satisfy the users' needs which will cover their mobility. To support the mobility of host, the Internet Engineering Task Force (lETF) Mobile IP Working Group proposed a protocol called MIPv6 (Mobile IPv6). But in the case of the existing MIPv6, sometimes Mobile Node cannot receive data packet if Handover occurs although it is a temporal phenomenon. For solving these Handover problems, there are many methods like FMIPv6 (Fast Handover for Mobile IPv6) and HMIPv6 (Hierarchical Mobile IPv6) have been suggested. This paper suggested the use of Dual Buffer of Access Point and an effective way of registration as a way of reducing delayed time caused by Handover. Also, it analyzed and compare the existing MIPv6 with a proposed scheme concerning delayed time of Handover. Finally, the main objective of this paper is to proposed scheme that can reduce the delayed time of Handover compare to the existing MIPv6.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1735-1755
• /
• 2012

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

• Industry Promotion Research
• /
• v.5 no.4
• /
• pp.29-37
• /
• 2020

The purpose of this study was to confirm the influence of the types of organizational culture perceived by members of Korean network companies on customer orientation and service orientation. Therefore, the results of the valid survey for the final 165 among the results of 204 applicants for about two weeks from September 7th to 25th, 2020 using the SSP 24.0 and AMOS 24.0 statistical package programs showed the following results. First, as a result of the analysis of the impact of organizational culture on customer orientation, the sub-factors of the organizational culture, such as relationship-oriented culture, innovation-oriented culture, hierarchical-oriented culture, and task-oriented culture types, all had a positive (+) effect on customer-oriented. It was analyzed as crazy. In other words, it can be seen that the organizational culture has a statistically significant impact on customer orientation in that it gives positive meaning through a comprehensive operation rather than a single substructure. Second, as a result of analyzing the effect of organizational culture on service orientation, organizational culture showed positive (+) influence on service orientation. In other words, it was analyzed that relational orientation, innovation orientation, hierarchical orientation, and task orientation, which are sub-constituent factors of organizational culture, act as positive factors for service orientation.

• Journal of the Korean Regional Science Association
• /
• v.39 no.4
• /
• pp.33-51
• /
• 2023

This study aims to investigate the changes in the employment structure of occupational groups by job characteristics and analyze the factors influencing wage premiums in local labor markets from 2010 to 2020. This study's analysis involves three primary steps. First, the occupational characteristics data from the Korea Network for Occupations and Workers are subjected to an exploratory factor analysis, and then a non-routine task intensity index is calculated by each occupations. Then, we conduct an exploratory analysis of changes in the distribution of employment by occupation from 2010 to 2020 by combining data from the Population Census with data from the Korean Labor and Income Panel Study to construct individual-level and regional-level data. Thirdly, we employ a hierarchical linear model to examine the individual-level and regional-level factors influencing wage premiums. Since 2010, the proportion of employment in occupations requiring non-routine task has continued to rise and now dominates the metropolitan labor market. Moreover, agglomeration effects resulting from urbanization produce a substantial wage premium for wage workers in occupations requiring non-routine tasks. This study seeks to provide policy implications to mitigate inequality and polarization in local labor markets by empirically analyzing the transition of occupational structure and wage inequality in relation to the local labor market context.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.328-330
• /
• 2004

차세대 네트워크는 IP 기반의 무선 네트워크로 진화하고 있다. 이에따라 최근의 internet Engineering Task force (IETF)에서 효율적인 이동성 관리를 위한 Hierarchical Mobile IPv6 (HMIPV6)을 제안하였다. HMIPV6는 Mobile Anchor Point(MAP)영역안에 지역 등록을 통하여 상당한 시그널링을 줄일 수 있고 핸드 오프 지연시간을 줄이면서 MIPv6의 성능을 향상 가져왔다. 그러나 MAP 영역이 고정되어 있고 단일 MAP에 집중적인 트랙픽이 발생하는 문제점을 가지고 있다. 따라서 이동노드의 이동성 및 트래픽에 의해서 동적으로 MAP 영역을 설정함으로써 트랙픽이 분산되어 질수 있다. 또한 HMIPv6는 Idle 이동노드도 불필요한 위치 등록으로 인하여 시그널링 오버헤드를 방생한다. 따라서 IP 페이징 기법을 사용하여 불필요한 위치 등록에 따른 시그널링을 줄이기 위한 방법을 제시한다. 또한 explicit multicast (Xcast) 방법을 사용하여 효율적인 메시지 전달방법을 제시한다.