• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.1-6
• /
• 2010

Simulation analysis may be the essential means to either evaluate performance of systems or optimize system parameters for new design. Including many variations for design and implementation, MANET (Mobile Ad-hoc NETwork) is one target area of such an analysis. Since every node, however, included in the network has mobility, one MANET could be overlapped or merged with another one which use a different transport protocol. In order to communicate among nodes in this case, the new merged network should configure paths and addresses in advance. Configuring paths and addresses generates much overheads which ultimately cause delay in communicating data. Performance analysis is required to improve the data transport performance by minimizing overheads. This paper proposes a sound address auto-configuration method which is based on an on-demand manner and then presents modeling and performance analysis of the method. NS-2 simulation results verify that the proposed method can not only alleviate overheads, which are inevitably generated for address auto-configuration processes, and but also decentralize them in time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.158-166
• /
• 2004

Address lookup is one of the most essential functions of the Internet routers and a very important feature in evaluating router performance. Due to the facts that the Internet traffic keeps growing and the number of routing table entries is continuously growing, efficient address-lookup mechanism is indispensable. In recent years, various fast address-lookup schemes have been proposed, but most of those schemes are not practical in terms of the memory size required for routing table and the complexity required in table update In this paper, we have proposed a parallel IP address lookup architecture based on multiple hashing. The proposed scheme has advantages in required memory size, the number of memory accesses, and table update. We have evaluated the performance of the proposed scheme through simulation using data from MAE-WEST router. The simulation result shows that the proposed scheme requires a single memory access for the address lookup of each route when 203kbytes of memory and a few-hundred-entry TCAM are used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.545-547
• /
• 2004

Currently possibility of the change of seal computer it increases geometrical progression and the general individuals the knowledge which is special regarding the ip are using the flow child blood which it Provides without from the isp enterprise. But most of the case peon of the school which uses the fixation child blood or the company because is not the knowledge against a TCP/IP address is not oneself at deliberation or real income and it will use the TCP/IP address of the different user and the network whole it will paralyze, the original user will not be able to use the network and it makes. With information where address information where the network administrator present time after data base anger one uses address information of the civil official objective personal computers and network systems of the watch inside in the dictionary is stored will be same from the dissertation which it sees hereupon and the web which it will yell it leads and packet it detects, the use of the TCP/IP address which goes wrong in the user and it notifies the method which is the possibility of closing the paralysis of the network system which it follows in the IP address fringe land due to a deliberation or a real income to sleep it presents it does.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.86-93
• /
• 2019

The purpose of this study is to develop walk score application GUI in a smart device for improving user convenience. This study uses the walk score dataset of Seoul City developed in previous studies. Application GUI consists of five parts: address input window and search button, detail information (address, latitude, longitude, walk score), window switching and input window for a number of data, data input window, and menu button. For verifying application GUI, this study uses 12 locations (sets of address, latitude, longitude, and walk score) near Gangnam Station and Myungdong Station in Seoul in several scenarios. First, this study checks if the application has been implemented with address and keyword search options. Then, new data insertion and file output operations are evaluated. The application system developed in this study operated properly in all scenarios. This walk score application can be a useful device in our daily lives.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.974-992
• /
• 2021

Recently, the healthcare field has undergone rapid changes owing to the accumulation of health big data and the development of machine learning. Data mining research in the field of healthcare has different characteristics from those of other data analyses, such as the structural complexity of the medical data, requirement for medical expertise, and security of personal medical information. Various methods have been implemented to address these issues, including the machine learning model and cloud platform. However, the machine learning model presents the problem of opaque result interpretation, and the cloud platform requires more in-depth research on security and efficiency. To address these issues, this paper presents a recent technology for Internet-of-Things-based (IoT-based) health big data processing. We present a cloud-based IoT health platform and health big data processing technology that reduces the medical data management costs and enhances safety. We also present a data mining technology for health-risk prediction, which is the core of healthcare. Finally, we propose a study using explainable artificial intelligence that enhances the reliability and transparency of the decision-making system, which is called the black box model owing to its lack of transparency.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.89-96
• /
• 2011

ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.

• Asian Journal for Public Opinion Research
• /
• v.5 no.4
• /
• pp.285-301
• /
• 2018

There have been many studies that applied a data-driven analysis method to social media data, and some have even argued that this method can replace traditional polls. However, some other studies show contradictory results. There seems to be no consensus as to the methodology of data collection and analysis. But as social media-based election research continues and the data collection and analysis methodology keep developing, we need to review the key points of the controversy and to identify ways to go forward. Although some previous studies have reviewed the strengths and weaknesses of the social media-based election studies, they focused on predictive performance and did not adequately address other studies that utilized social media to address other issues related with public opinion during elections, such as public agenda or information diffusion. This paper tries to find out what information we can get by utilizing social media data and what limitations social media data has. Also, we review the various attempts to overcome these limitations. Finally, we suggest how we can best utilize social media data in understanding public opinion during elections.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.166-169
• /
• 2013

In this letter, we propose a data randomization scheme for endurance and interference mitigation of deeply-scaled multilevel flash memory. We address the relationships between data patterns and the raw bit error rate. An on-chip pseudorandom generator composed of an address-based seed location decoder is developed and evaluated with respect to uniformity. Experiments performed with 2x-nm and 4x-nm NAND flash memory devices illustrate the effectiveness of our scheme. The results show that the error rate is reduced up to 86% compared to that of a conventional cycling scheme. Accordingly, the endurance phenomenon can be mitigated through analysis of interference that causes tech shrinkage.