• Journal of electromagnetic engineering and science
• /
• 제2권2호
• /
• pp.68-74
• /
• 2002

In this paper, a pre-layout design approach for high-speed microprocessor is proposed. For multilayer PCB stark up configuration as well as selection and placement of decoupling capacitors, an effective solution for reducing SSN and EMI is obtained by modeling and simulation of complete power distribution system. The system model includes VRM, decoupling capacitors, multiple power and ground planes for core voltage, vias, as well as microprocessor. Finally, the simulation results are verified by measurements data.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.315-318
• /
• 1996

The machine-part cell formation means the grouping of similar parts and similar machines into families in order to minimize bottleneck machines, bottleneck parts, and inter-cell part movements in cellular manufacturing systems and flexible manufacturing systems. The cell formation problem is knows as a kind of NP complete problems. This paper briefly introduces the cell-formation problem and proposes a cell formation method based on the Kohonen's self-organizing feature map which is a neural network model. It also shows some experiment results using the proposed method. The proposed method can be easily applied to the cell formation problem compared to other meta-heuristic based methods. In addition, it can be used to solve large-scale cell formation problems.

• 한국컴퓨터정보학회논문지
• /
• 제22권7호
• /
• pp.31-37
• /
• 2017

There are lots of combined battlefield elements which complete the war. It looks problematic when collecting and analyzing these elements and then predicting the situation of war. Commander's experience and military power assessment have widely been used to come up with these problems, then simulated combat training program recently supplements the war-game models through recording real-time simulated combat data. Nevertheless, there are challenges to assess winning factors of combat. In this paper, we characterize the combat element (ce) by clustering simulated combat data, and then suggest multi-layered artificial neural network (ANN) model, which can comprehend non-linear, cross-connected effects among ces to assess mission completion degree (MCD). Through our ANN model, we have the chance of analyzing and predicting winning factors. Experimental results show that our ANN model can explain MCDs through networking ces which overperform multiple linear regression model. Moreover, sensitivity analysis of ces will be the basis of predicting combat situation.

• International Journal of Control, Automation, and Systems
• /
• 제3권1호
• /
• pp.15-31
• /
• 2005

Nowadays, the road safety is an important research field. One of the principal research topics in this field is the vehicle localization in the road network. This article presents an approach of multi sensor fusion able to locate a vehicle with a decimeter precision. The different informations used in this method come from the following sensors: a low cost GPS, a numeric camera, an odometer and a steer angle sensor. Taking into account a complete model of errors on GPS data (bias on position and nonwhite errors) as well as the data provided by an original approach coupling a vision algorithm with a precise numerical map allow us to get this precision.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.99-100
• /
• 2006

One of the fundamental problems in sensor networks is the deployment of sensor nodes. The Fuzzy C-Means(FCM) clustering algorithm is proposed to determine the optimum location and minimum number of sensor nodes for the specific application space. We performed a simulation using two dimensional L shape model. The actual length of the L shape model is about 100m each. We found the minimum number of 15 nodes are sufficient for the complete coverage of modeled area. We also found the optimum location of each nodes. The real deploy experiment using 15 sensor nodes shows the 95.7%. error free communication rate.

• Journal of Information Technology Applications and Management
• /
• 제22권4호
• /
• pp.59-76
• /
• 2015

The study on Wholesale pricing of MVNO using two way interconnection charge system is rare. This paper considers MVNO possessing its own facilities and subscribers. While previous studies focus on wholesale provision by MNO, this paper employs another approach from existing MVNO model. This paper introduces two way interconnection charge system by recognizing that mobile network interconnection is important to complete the call from MNO to MVNO as well as the call from MVNO to MNO. Also it is interesting to analyze wholesale pricing when there is brand loyalty between MNO and MVNO. This paper analyzes retail pricing and wholesale pricing under duopoly competition and drives social optimal solutions using linear city model.

• 전기학회논문지
• /
• 제65권12호
• /
• pp.2061-2068
• /
• 2016

A Bloom filter is a space-efficient data structure popularly applied in many network algorithms. This paper proposes a vectored Bloom filter to provide a high-speed Internet protocol (IP) address lookup. While each hash index for a Bloom filter indicates one bit, which is used to identify the membership of the input, each index of the proposed vectored Bloom filter indicates a vector which is used to represent the membership and the output port for the input. Hence the proposed Bloom filter can complete the IP address lookup without accessing an off-chip hash table for most cases. Simulation results show that with a reasonable sized Bloom filter that can be stored using an on-chip memory, an IP address lookup can be performed with less than 0.0003 off-chip accesses on average in our proposed architecture.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• 한국정보시스템학회지:정보시스템연구
• /
• 제17권3호
• /
• pp.39-58
• /
• 2008

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

• 산업경영시스템학회지
• /
• 제24권64호
• /
• pp.1-20
• /
• 2001

In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.