• Journal of information and communication convergence engineering
• /
• 제21권1호
• /
• pp.9-16
• /
• 2023

The natural language on social network platforms has a certain front-to-back dependency in structure, and the direct conversion of Chinese text into a vector makes the dimensionality very high, thereby resulting in the low accuracy of existing text classification methods. To this end, this study establishes a deep learning model that combines a big data ultra-deep convolutional neural network (UDCNN) and long short-term memory network (LSTM). The deep structure of UDCNN is used to extract the features of text vector classification. The LSTM stores historical information to extract the context dependency of long texts, and word embedding is introduced to convert the text into low-dimensional vectors. Experiments are conducted on the social network platforms Sogou corpus and the University HowNet Chinese corpus. The research results show that compared with CNN + rand, LSTM, and other models, the neural network deep learning hybrid model can effectively improve the accuracy of text classification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.240-259
• /
• 2020

Analyzing network traffic is the basis of dealing with network security issues. Most of the network security systems depend on the feature selection of network traffic data and the detection ability of malicious traffic in network can be improved by the correct method of feature selection. An FAFS method, which is short for Fuzzy Association Feature Selection method, is proposed in this paper for network malicious traffic detection. Association rules, which can reflect the relationship among different characteristic attributes of network traffic data, are mined by association analysis. The membership value of association rules are obtained by the calculation of fuzzy reasoning. The data features with the highest correlation intensity in network data sets are calculated by comparing the membership values in association rules. The dimension of data features are reduced and the detection ability of malicious traffic detection algorithm in network is improved by FAFS method. To verify the effect of malicious traffic feature selection by FAFS method, FAFS method is used to select data features of different dataset in this paper. Then, K-Nearest Neighbor algorithm, C4.5 Decision Tree algorithm and Naïve Bayes algorithm are used to test on the dataset above. Moreover, FAFS method is also compared with classical feature selection methods. The analysis of experimental results show that the precision and recall rate of malicious traffic detection in the network can be significantly improved by FAFS method, which provides a valuable reference for the establishment of network security system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

• 한국정보시스템학회지:정보시스템연구
• /
• 제8권1호
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.81-84
• /
• 2005

Various design schemes for network using wireless sensor nodes have been widely studied on the several application areas ranging from the real world information collection to environmental monitor. Currently, the schemes are focused on the design of sensor network for low power consumption, power-aware routing protocol, micro miniature operating system and sensor network middleware. The indoor localization system that identifies the location of the distributed nodes in a wireless sensor network requires features dealing with mobility, plurality and other environmental constraints of a sensor node. In this paper, we present an efficient location system to cope with mobility of multiple mobile nodes by designing a location handler that processes location information selectively depending on the nodes' density in a specific region. In order to resolve plurality of multiple mobile nodes, a routing method for the location system is also proposed to avoid the occurrence of overlapped location data.

• 한국비블리아학회지
• /
• 제16권1호
• /
• pp.285-314
• /
• 2005

이 연구는 대학 및 연구기관의 도서관들이 자원의 공동 활용을 위해 이용하는 과학기술분야 정보유통 체제의 기능과 역할 및 서비스 내용을 조사 분석 하는 것이다. 이러한 연구는 이 정보유통체제들의 활동과 서비스의 중복성 여부를 규명해서 중복투자에 의한 국가적 예산 낭비를 줄일 수 있도록 하고, 정보이용자 및 정보 관리자들에게는 필요한 서비스만을 이용하도록 하여 시간과 노력과 경비를 절감할 수 있도록 하는데 필요한 것이다. 연구 대상으로는 KISTI와 KERIS를 선정하고 연구하였다. 연구방법으로는 문헌적 연구와 온라인상의 기능을 확인하기 위한 실제 분석을 병행 하였다. 연구 결과, 정보유통체제들의 서비스 및 정보의 중복성이 부분적으로 확인 되었다. 도서관네트웍으로서의 기능도 수행하고 있는 것으로 평가하였다.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• KNOM Review
• /
• 제22권2호
• /
• pp.39-47
• /
• 2019

과학기술연구망(KREONET)에서는 기상기후 정보, 고에너지물리, 천문연구, 위성정보데이터, 유전체 연구데이터 등의 빅데이터 중심 첨단 연구 활동을 지원을 수행하고 있다. 기존의 네트워크 보안장비들이 있는 환경에서는 성능 저하가 발생하기 때문에, 고성능 연구전용 네트워크 상에서 성능저하를 방지하고, 고속 연구협업을 위한 방안들이 연구되고 있다. 또한 최근 이슈가 되는 양자컴퓨터의 등장으로 기존 암호체계를 활용한 보안성에 위협이 되고 있다. 본 논문에서는 단대단(End-to-End)의 고속 연구전용 네트워크상에서 양자암호기반의 통신망 구축을 통하여 물리적 보안성을 강화시키는 환경구축과 고성능 전송테스트를 통하여 양자암호기반 통신망을 구성한다. 물리적 암호화 수행시에 망 성능에 미치는 영향을 분석하여, 고성능 연구협업 네트워크 구축을 위한 기초 자료로 활용하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2267-2285
• /
• 2016

Information Centric Networking that uses content name instead of IP address as routing identifier can handle challenges such as traffic explosion and user mobility, but it also suffers from scalability and incompatibility problems. In this paper by combining the concept of software defined networking and Internet end to end arguments, we propose a wide area deployable software defined information centric networking service model named SD-ICN. SD-ICN employs a dual space structure that separates edge service network and core transmission network. The enhanced SDN techniques are used in edge service network in order to implement intelligent data routing and caching, while traditional IP technique is reserved in core transmission network so as to provide wide area high speed data transmission. Besides, a distributed name resolution system based on the cooperation of different controllers is also presented. The prototype experiments in our campus network show that SD-ICN can be deployed in a scalable and incremental way with no modification of the core network, and can support typical communication modes such as multicast, mobility, multihoming, load balancing, and multipath data transmission effectively.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.64-73
• /
• 1997

Network technology has been developed for very high-speed networking and multimedia data whose characteristics are the continuous and bursty transmission as well as a large amount of data. With this trend users wish to view the information about the application services as well as network devices and system hardware. However, it is rarely available for the users the information of performance or faults of the application services. Most of information is limited to the information related network devices or system hardware. Furthermore, users expect the best services without knowing the service environments in the network and there is no good way of delivering the service related problems and fault information of application services in a high speed network yet. In this paper we present a web-based application management system that we have developed for the past year. It includes a method to build an agent system that uses an existing network management standards, SNMP MIB and SNMP protocols. The user interface of the system is also developed to support visualization effects with web-based Java interface which offers a convenient way not only to access management information but also to control networked applications.