• 한국멀티미디어학회논문지
• /
• 제19권10호
• /
• pp.1792-1807
• /
• 2016

Android application is vulnerable to reverse engineering attack. And by this, it is easy to extract significant module from source code and repackage it. To prevent this problem, dynamic class loading technique, which is able to exclude running code from distributed source code and is able to load running code dynamically during runtime can be used. Recently, this technique was adapted on variety of fields and applications like updating pre-loaded android application, preventing from repacking malicious application, etc. Despite the fact that this technique is used on variety of fields and applications, there is fundamental lack on the study of potential weakness or related secure coding. This paper would deal with potential weaknesses during the implementation of dynamic class loading technique with analysing related international/domestic standard of weaknesses and suggest a secure way for the implementation of dynamic class loading technique. Finally, we believe that this technique described here could increase the level of trust by decreasing the weakness related to dynamic class loading technique.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2001년도 정기총회 및 학술대회
• /
• pp.109-113
• /
• 2001

최근 들어 디지털 이동통신 시스템은 음성 통신 뿐만 아니라 멀티미디어 통신에도 그 적용범위를 확장시키고 있다. 그러나 이러한 시스템에서 한정된 채널 대역폭의 사용은 멀티미디어 정보의 대용량성을 고려할 때, 그 적용범위를 심각하게 축소시키는 가장 큰 제한요소이다. 일반적인 통신 시스템의 소스 부호화기는 채널 잡음을 고려하지 않고 설계되며, 채널 부호화기는 소스 신호의 특성과 무관하게 채널 환경의 극복에만 중점을 두고 설계된다. 그러나 대역폭 제한적인 통신 환경에서 보다 효율적인 대역폭 사용을 위해서는 채널 환경에 따라 소스 부호율과 채널 부호율을 가변적으로 운용하여야 한다. 본 논문에서는 영상을 부대역 부호화하여 각 부대역 영상이 원래의 영상 재구성에 기여하는 중요도에 따라 한정된 채널 자원을 최적으로 할당하는 공동 소스/채널 부호화(Joint Source-channel Coding)에 관하여 연구하였다. 부대역 영상의 소스 부호화로는 DPCM과 PCM을 사용하였고, 채널 부호화는 TCM 부호화기를 사용하였으며 상이오류보호(Unequal Error Protection)를 위해 3가지 채널 부호율에 따라 각각 TCQPSK, TC8PSK, TC16PSK 변조방식을 사용하였다. 모의실험에 사용된 채널 환경은 랜덤잡음 환경과 이동수신의 경우에 발생하는 Rayleigh 페이딩 환경을 고려하였으며, 각 환경에서의 채널 SNR에 따라 동일오류보호(Equal Error Protection) 시스템과 상이오류보호(Unequal Error Protection) 시스템의 성능을 비교하였다.

• 디지털산업정보학회논문지
• /
• 제11권4호
• /
• pp.81-87
• /
• 2015

Recently, with the development of the ICT environment, the use of the software is growing rapidly. And the number of the web server software used with a variety of users is also growing. However, There are also various damage cases increased due to a software security vulnerability as software usage is increasing. Especially web shell hacking which abuses software vulnerabilities accounts for a very high percentage. These web server environment damage can induce primary damage such like homepage modification for malware spreading and secondary damage such like privacy. Source code weaknesses checking system is needed during software development stage and operation stage in real-time to prevent software vulnerabilities. Also the system which can detect and determine web shell from checked code in real time is needed. Therefore, in this paper, we propose the system improving security for web server by detecting web shell attacks which are invisible to existing detection method such as Firewall, IDS/IPS, Web Firewall, Anti-Virus, etc. while satisfying existing secure coding guidelines from development stage to operation stage.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1373-1391
• /
• 2022

We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.

• 말소리와 음성과학
• /
• 제3권2호
• /
• pp.89-96
• /
• 2011

In this paper, details of the design and implementation of a voice source simulator using Simulink and Matlab are discussed. This simulator is an implementation by model-based design concept. Voice sources can be analyzed and manipulated through various factors by choosing options from GUI input and selecting pre-defined blocks or user created ones. This kind of simulation tool can simplify the procedure of analyzing speech signals for various purposes such as voice quality analysis, pathological voice analysis, and speech coding. Also, basic analysis functions are supported to compare the original signal and the manipulated ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• 대한전자공학회논문지
• /
• 제15권2호
• /
• pp.1-7
• /
• 1978

이 논문은 한국어 정보원의 구조를 분석하고 기본문자의 출현확율에 따른 KS몰스코오드를 재구성하여 전송속도및 효율을 14%이상 향상시키고 또 앞서 일부 제안된 바 있는 △parameter의 효과와 그것에 의한 한글의 단음절의 자동 식별방법 및 코오드의 개선및 data entry의 합리화에 미치는 영향에 대해서 기술하였다. 아울러 단음절의 자동식별은 13∼16%의 효율을 향상시킨다는 것도 명백히 하였다.

• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.249-254
• /
• 2002

본 논문에서는 영상압축을 위한 버퍼제약에 의한 적응양자화 알고리즘에 대해서 논하고져 한다. 버퍼제약에 의한 알고리즘은 source coding과 더불어 그간 연구되다가, 최근에는 비트율 왜곡의 이름으로 연구가 더욱 진전돼 오고 있다. 여기에서 우리는 버퍼 occupancy의 값이 비트율 왜곡의 측정치에서 Lagrange multiplier 형식으로 통합되는 것을 제안한다. 여기서 제안하는 알고리즘이 Viterbi 알고리즘과는 반대로 최적치에는 약간 못미치는 성능을 보여주지만, 대신 계산의 복잡도가 매우 낮을 뿐 아니라, 버퍼 제어 알고리즘의 안정도를 Liapnov의 안정화이론을 이용해서 간단하게 설명 할 수 있다는 것이다.

• Journal of the Optical Society of Korea
• /
• 제17권6호
• /
• pp.471-480
• /
• 2013

The beating of two or more lasers that have the same or a finite difference in the central frequencies, is the main source of noise in spectral amplitude coding optical code division multiple access (SAC OCDMA) systems. In this paper we adopt a spatial multiplexing (SM) scheme for SAC OCDMA systems to mitigate this beat noise. The results show that for different code weights and different data rates SM SAC can support a larger number of users than the conventional SAC for all different laser source configurations. However, SM SAC requires a more complex system than the conventional SAC, and almost twice as much optical component.