Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 14, Issue 6 - Dec 2013
Volume 14, Issue 5 - Oct 2013
Volume 14, Issue 4 - Aug 2013
Volume 14, Issue 3 - Jun 2013
Volume 14, Issue 2 - Apr 2013
Volume 14, Issue 1 - Feb 2013
Selecting the target year
Improving BER Performance of IEEE 802.15.4 with Alamouti Scheme in MIMO System
Halim, Eddy Hartono ; Shin, Soo-Yong ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 1~7
DOI : 10.7472/jksii.2013.14.1
This paper proposes a technique for applying space-time block coding (STBC) - Alamouti scheme on Multiple Inputs Multiple Output (MIMO) system based on IEEE 802.15.4 standard. It is applied to IEEE 802.15.4 standard in
MIMO systems. Simulation is performed using Matlab and the results are compared with conventional IEEE 802.15.4 approaches, Single Input Single Output (SISO) system and switching diversity
Single Input Multiple Output (SIMO) system. The simulations show that applied Alamouti scheme gave better Bit Error Rate (BER) performance compared to combined IEEE 802.15.4 with switching diversity and SISO system.
Biased Zero-Error Probability for Adaptive Systems under Non-Gaussian Noise
Kim, Namyong ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 9~14
DOI : 10.7472/jksii.2013.14.9
The criterion of zero-error probability provides a limitation on error probability functions being used for adaptive systems when the error samples are shifted by the influence of DC-bias noise. In this paper, we employ a bias term in the error distribution and propose a new criterion of the biased zero-error probability with error being zero. Also, by maximizing the proposed criterion on expanded filter structures, a supervised adaptive algorithm has been derived. From the simulation results of supervised equalization, the algorithm based on the proposed criterion yielded zero-centered and highly concentrated error samples without disturbance in the environments of strong impulsive and DC-bias noise.
The 64-Bit Scrambler Design of the OFDM Modulation for Vehicles Communications Technology
Lee, Dae-Sik ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 15~22
DOI : 10.7472/jksii.2013.14.15
WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.
Design of Test-Effort Estimation Model
Kim, Hankyoung ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 23~30
DOI : 10.7472/jksii.2013.14.23
Test effort estimated so far is as a by-product of the development effort estimation activity which is based on the FP, UCP, COCOMO model, or calculated data from the project knowledge base which is containing test effort information for the test phase on software development life cycle. In this paper, test effort estimation model and calculating procedures are suggested, which is independent from software development effort estimation model. Generally test efforts is depends on the number and the complexity of test cases, and also maturity of test organization that performs test activities, such as integration test, system test, acceptance test and so on. The estimated results with the suggested test effort estimation model has deviation of 4.7% compare to the corresponding test efforts generated by the development effort estimationprocedures. The suggesting model will be accurate more and more with refinements of coefficients which reflect the technical and environmental maturity level of test organization, and also including the software complexity level of projects.
A Method for Improving Interface Fault Tolerance in the Embedded Software
Choi, In Hwa ; Paik, Jong Ho ; Hwang, Jun ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 31~39
DOI : 10.7472/jksii.2013.14.31
Generally, there can be a interface discrepancy between the legacy hardware and the new software in combining new software component with reused hardware components in the embedded system. This kind of the interface discrepancy may cause various types of faults and also result in declining interface fault tolerance. In this paper we propose a method to improve interface fault tolerance. First of all, the new interface discrepancy fault type which has not been dealt with before is to be defined and next the testing method for generating test paths is proposed by considering the new defined interface discrepancy fault type in this paper. Several tests show that the proposed method detects more fatal faults about 7.9% in comparison with the existing testing method for commercial broadcasting receiver. Since the proposed method can provide software developers with test paths to be available earlier on the software development cycle, in addition, software developers can regard on interface discrepancy fault in advance. Consequently, more efficient test planning can be established to improve the interface fault tolerance.
Research on Military SNS Protection Profile for National defense
Yu, DeokHoon ; Kim, SeungJoo ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 41~52
DOI : 10.7472/jksii.2013.14.41
Social Network Service(SNS) have become very popular during the past few years. Also SNS, an current communication platform, greatly contributes to transmit the information rapidly and strengthen a sense of community and fellowship in military service. however it has vulnerable factors. For example, invasion of privacy, exposure of personal information and military data. In this particular case, it is a deathblow to the military service. Military Social Network Service require to protect the military security threats and disclosure of defense secrets. For such reasons we need the secure SNS that protects from any attacks or vulnerable factors. We present classification of functional type and analysis the SNS architecture. The goal of this work is propose military SNS security functional requirements for practical use safely.
Ubiquitous Workspace Synchronization in a Cloud-based Framework
Elijorde, Frank I. ; Yang, Hyunho ; Lee, Jaewan ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 53~62
DOI : 10.7472/jksii.2013.14.53
It is common among users to have multiple computing devices as well as to access their files or do work at different locations. To achieve file consistency as well as mobility in this scenario, an efficient approach for workspace synchronization should be used. However, file synchronization alone cannot guarantee the mobility of work environment which allows activities to be resumed at any place and time. This paper proposes a ubiquitous synchronization approach which provides cloud-based access to a user`s workspace. Efficient synchronization is achieved by combining session monitoring with file system management. Experimental results show that the proposed mechanism outperforms Cloud Master-replica Synchronization in terms of number of I/O operations, CPU utilization, as well as the average and maximum latencies in responding to client requests.
Performance evaluation of approximate frequent pattern mining based on probabilistic technique
Pyun, Gwangbum ; Yun, Unil ;
Journal of Internet Computing and Services, volume 14, issue 1, 2013, Pages 63~69
DOI : 10.7472/jksii.2013.14.63
Approximate Frequent pattern mining is to find approximate patterns, not exact frequent patterns with tolerable variations for more efficiency. As the size of database increases, much faster mining techniques are needed to deal with huge databases. Moreover, it is more difficult to discover exact results of mining patterns due to inherent noise or data diversity. In these cases, by mining approximate frequent patterns, more efficient mining can be performed in terms of runtime, memory usage and scalability. In this paper, we study the characteristics of an approximate mining algorithm based on probabilistic technique and run performance evaluation of the efficient approximate frequent pattern mining algorithm. Finally, we analyze the test results for more improvement.