• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.59-66
• /
• 2020

Content Centric Network(CCN) with architecture that is completely different from traditional host-based networks has emerged to address problems such as the explosion of traffic load in the current network. Research on cache replacement policies is very active to improve the performance of CCN with the characteristics that all routers cache on the network. Therefore, this paper proposes a cache replacement policy suitable for situations in which popularity is constantly changing, taking into account the actual network situation. In order to evaluate the performance of the proposed algorithm, we experimented in an environment where the popularity of content is constantly changing, and confirmed that we are superior to the existing replacement policy through comparing hit rates and analyzing server load.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.149-163
• /
• 2023

Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.81-88
• /
• 2009

This paper alined at the development of a lateral drift control method that is able to quantitatively control the lateral drift of global node. For this, we applied an efficient partial reanalysis algorithm. By using this algorithm, we could recalculate the displacement and member force of the specific node without reanalyzing the entire structure when member stiffness changes partially. The theoretical concepts of the algorithm are so simple that it is not necessary to solve the complicate differential equation or to repeat the analysis of entire structure. The proposed method calculates the drift contribution of each member for the global displacement according to the variation of section sizes by using the algorithm. Then by changing the member sizes as the order of drift contribution, we could control the lateral drift of global node with a minimum quantity of materials. 20 story braced frame structure system is presented to illustrate the usefulness of proposed method. It is shown that the proposed method is very effective in lateral drift control and the results obtained by proposed method are consistent with those of commercial analysis program.

• 한국정보교육학회:학술대회논문집
• /
• 2010.08a
• /
• pp.271-280
• /
• 2010

Education focus on cultivating creative talent in the rapidly changing knowledge and Information society. Algorithms of computer science students to logical thinking and problem solving to find the best solution is an effective learning content. But the algorithm often educate at the University of reality when considering the level of elementary school students' cognitive structure and it is very important for teaching. In this study, based on the principle of the algorithm with an educational content for students to understand the principles of their own problems as the best way to resolve the situation with the ability to want to kidney. Content that contains elements of the game interesting for students to participate actively interested in effective teaching methods to the understanding of the principles of the algorithm will be a big help.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.5
• /
• pp.747-753
• /
• 2018

In the license-plate recognition systems for automobile black Image, the license-plate image frequently has a shadow due to outdoor environments which are frequently changing. Such a shadow makes unpredictable errors in the segmentation process of individual characters and numbers of the license plate image, and reduces the overall recognition rate. In this paper, to improve the recognition rate in these circumstance, a license-plate image binarization algorithm is proposed removing the shadow effectively. The propose algorithm splits the license-plate image into the regions with the shadow and without. To find out the boundary of two regions, the algorithm estimates the curve for shadow boundary using the least-squares method. The simulation is performed for the license-plate image having its shadow, and the results show much higher recognition rate than the previous algorithm.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.45-56
• /
• 2005

The weak foundation of the computing environment caused information leakage and hacking to be uncontrollable, Therefore, dynamic control of security threats and real-time reaction to identical or similar types of accidents after intrusion are considered to be important, h one of the solutions to solve the problem, studies on intrusion detection systems are actively being conducted. To improve the anomaly IDS using system calls, this study focuses on neural networks learning using the soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern, That Is, by changing variable length sequential system call data into a fixed iength behavior pattern using the soundex algorithm, this study conducted neural networks learning by using a backpropagation algorithm. The backpropagation neural networks technique is applied for anomaly detection of system calls using Sendmail Data of UNM to demonstrate its performance.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.339-347
• /
• 2008

A balanced game is one where the main determining factor for the success of the player is the skill level of that player Random events can occur, but a better player should be more successful than a poor one unless the player has an unusually long run of bad luck. Balancing a game is a very difficult to define a purpose, and to implement process. The possible ways are somewhat subjective and depend on the nature of the game. This paper provides new algorithm for character adjustment using log function with some nature-based Ideas. The algorithm shows not only how we decide the exact point of character adjustment but also how much we have to modify the parameters for changing abilities of the character. This paper shows the experimental results of the algorithm and shows differences between normal game playing and playing with character adjustment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.79-85
• /
• 2006

Generally, it is essential that high-speed routers, switches, and network security appliances should have an efficient packet classification scheme in order to achieve the high-speed packet forwarding capability. For the multi-gigabit packet-processing network equipment the high-speed content search hardware such as TCAM and search engine is recently used to support the content-based packet inspection. During the packet classification process, hundreds and thousands of rules are applied to provide the network security policies regarding traffic screening, traffic monitoring, and traffic shaping. In addition, these rules could be dynamically changed during operations of systems if anomaly traffic patterns would vary. Particularly, in the high-speed network, an efficient algorithm that updates and reorganizes the packet classification rules is critical so as not to degrade the performance of the network device. In this paper, we have proposed an efficient update algorithm using a partial-ordering that can relocate the dynamically changing rules at the TCAM. Experimental results should that our algorithm does not need to relocate existing rules feature until 70$\%$ of TCAM utilization.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.46-58
• /
• 2003

The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.