• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.7
• /
• pp.1015-1024
• /
• 1990

This paper proposes a program counter unit(PCU) on the pipelined architecture of RISC (Reduced Instruction Set Computer) type high performance processors, PCU is used for supplying instruction addresses to memory units(Instruction Cache) efficiently. A RISC processor's PCU has to compute the instruction address within required intervals continnously. So, using the method of self-generated incrementor, is more efficient than the conventional one's using ALU or private adder. The proposed PCU is designed to have the fast +4(Byte Address) operation incrementor that has no carry propagation delay. Design specifications are taken by analyzing the whole data path operation of target processor's default and exceptional mode instructions. CMOS and wired logic circuit technologic are used in PCU for the fast operation which has small layout area and power dissipation. The schematic capture and logic, timing simulation of proposed PCU are performed on Apollo W/S using Mentor Graphics CAD tooks.

• Journal of Information Technology Applications and Management
• /
• v.20 no.3
• /
• pp.105-127
• /
• 2013

Information and Communication Technology (ICT) has become a vital instrument for delivering a number of services such as education, healthcare and public services. Community wireless networks are community-centric telecommunication infrastructure developed to provide affordable communication for those who live in remote areas. This chapter discusses the role of Nepal Wireless in achieving socio economic development of rural communities by facilitating affordable Internet access. We analyze the challenges Nepal Wireless faced and articulate on the approaches it took to address those challenges such as lack of technical skills, appropriate technology and funding, difficult geographical terrains, unstable political situation, and expensive devices. In addition, we address the success and failure factors of this community-based ICT4D approach in order to guide similar endeavors. We conclude the chapter by some suggestions for policy makers, community developers, and academicians.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.197-205
• /
• 2018

Nowadays, wireless sensor networks (WSNs) have been widely adopted in structural health monitoring (SHM) systems for social overhead capital (SOC) public infrastructures. Structural health information, environmental disturbances and sudden changes of weather conditions, damage detections, and external load quantizing are among the capabilities required of SHM systems. These information requires an efficient transmission with which an efficient mobility management support for wireless networks can provide. This paper deals with the analysis of mobility management schemes in order to address the real-time requirement of data traffic delivery for critical SHM information. The host-based and network-based mobility management protocols have been identified and the advantages of network mobility (NEMO) enabled Proxy Mobile Internet Protocol version 6 (PMIPv6) have been leveraged in order to address the SHM information transmission needs. The scheme allows an efficient information transmission as it improves the handover performance due to shortened handover latency as well as reduced signaling overhead.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.585-587
• /
• 2023

Long-tailed datasets have an imbalanced distribution because they consist of a different number of data samples for each class. However, there are problems of the performance degradation in tail-classes and class-accuracy imbalance for all classes. To address these problems, this paper suggests a learning method for training of long-tailed dataset. The proposed method uses and combines two methods; one is a resampling method to generate a uniform mini-batch to prevent the performance degradation in tail-classes, and the other is a reweighting method to address the accuracy imbalance problem. The purpose of our proposed method is to train the learning models to have uniform accuracy for each class in a long-tailed dataset.

• Information Systems Review
• /
• v.4 no.1
• /
• pp.47-67
• /
• 2002

Since mid 90's, most of firms utilizing web as a communication vehicle with customers are keenly interested in web log file which contains a lot of trails customers left on the web, such as IP address, reference address, cookie file, duration time, etc. Therefore, an appropriate analysis of the web log file leads to understanding customer's behaviors on the web. Its analysis results can be used as an effective marketing information for locating potential target customers. In this study, we introduced a web mining technique using Clementine of SPSS, and analyzed a set of real web log data file on a certain Internet hub site. We also suggested a process of various strategies build-up based on the web mining results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.247-255
• /
• 2015

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.89-95
• /
• 2023

Cloud computing today provides huge computational resources, storage capacity, and many kinds of data services. Data sharing in the cloud is the practice of exchanging files between various users via cloud technology. The main difficulty with file sharing in the public cloud is maintaining privacy and integrity through data encryption. To address this issue, this paper proposes an Enhanced RSA encryption schema (ERSA) for data sharing in the public cloud that protects privacy and strengthens data integrity. The data owners store their files in the cloud after encrypting the data using the ERSA which combines the RSA algorithm, XOR operation, and SHA-512. This approach can preserve the confidentiality and integrity of a file in any cloud system while data owners are authorized with their unique identities for data access. Furthermore, analysis and experimental results are presented to verify the efficiency and security of the proposed schema.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.110-113
• /
• 2000

In this paper, we consider the problem of digital audio watermarking to robust about compression without original audio data. We specifically address the audio watermarking using BPSK with variable carrier frequency. This technique make audio data embeded watermarking robust with compression attack, for example MPEG, AC-3, etc.

• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.1-10
• /
• 2000

In this paper, we address the Bayesian hypotheses testing for the comparison of Weibull distributions. In Bayesian testing problem, conventional Bayes factors can not typically accommodate the use of noninformative priors which are Improper and are defined only up to arbitrary constants. To overcome such problem, we use the recently proposed hypotheses testing criterion called the intrinsic Bayes factor. We derive the arithmetic and median intrinsic Bayes factors for the comparison of Weibull lifetime model and we use these results to analyze real data sets.