• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.5
• /
• pp.1-9
• /
• 2012

Memristor which is known as fourth basic circuit element has been developed recently but its electrical characteristics are not still fully understood. Memristor has the incremental and decremental feature of the resistance depending upon the connected polarities. Also, its operational behavior become diverse depending on its connection topologies. In this work, electrical characteristics of diverse types of serial and parallel connections are investigated using the HP $TiO_2$ model. The characteristics are analyzed with pinched hystersis loops on the V-I plane when sine input signal is applied. The results of the work would be utilized usefully for analyzing the characteristics of memristor element and applications to logic circuit and neuron cells.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.106-113
• /
• 2017

In this paper, we propose a suitable network topology for the Ethernet based Train Communication Network (TCN) for control system in a autonomous multi-articulated vehicle. We propose a network topology considering the structural constraints such as the number of cables and ports, and the performance constraints such as network response time and maximum throughput. We compare the network performances of star topology and daisy chain topology as well as hybrid topology, which is proposed in previous studies and a compromise between daisy chain and star topology. Here, the appropriate number of nodes in a group is obtained for the configuration of the hybrid topology. We first derive estimates of the network performance through simulation with different topologies, and then, implement the network by connecting the actual devices with each network topology. The performance of each topology is measured using various network performance measurement programs and the superiority of the proposed topology is described through comparison.

• Journal of Korean Association for Spatial Structures
• /
• v.7 no.5
• /
• pp.67-74
• /
• 2007

The unsymmetrically layered artificial material model is consistently introduced to find the optimum topologies of the plate structures. Reissner-Mindlin (RM) plate theory is adopted to formulate the present 9-node plate element considering the first-order shear deformation of the plates. In the topology optimization process, the strain energy to be minimized is employed as the objective function and the initial volume of structures is adopted as the constraint function. In addition, the resizing algorithm based on the optimality criteria is used to update the hole size introduced in the proposed artificial material model. Several numerical examples are rallied out to investigate the performance of the proposed technique. From numerical results, the proposed topology optimization techniques are found to be very effective to produce the optimum topology of plate structures. In particular, the proposed unsymmetric stiffening layer model make it possible to produce more realistic stiffener design of the plate structures.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1820-1826
• /
• 2001

In this paper, we present a modeling scheme for the already-installed two-wire home phone lines with arbitrary topologies and show that the inter-symbol interference due to the topology can be removed using an adaptive equalizer. The transmission characteristics of the arbitrary-configured two-wire home phone lines can be analyzed through the ABCD matrices. The simulation result shows that the impedance mismatch due to the branch lines renders nulls in the frequency response or delayed pulses in the impulse response. These nulls or delayed pulses cause inter-symbol interference that inhibits correct signal detection. An adaptive equalizer is shown to be effective in eliminating the interference. Also, the simulation result shows that the equalizer converges in 1.5 ms at a data rate of 1 Msps at signal-to-noise ratios greater than 15 dB. In addition, from the result of relation between E$\_$b//N$\_$and BER(Bit Error Rate), we can see that E$\_$b//N$\_$o/ more than 19 dB is required for the data communication with a BER less than 10$\^$-5/.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.131-134
• /
• 2005

This paper describes the efficient peer-to-peer migration method of Grid service agent on the mobile agent based P-Grid. The migration mechanism for transmitting service agent upon the service request is based on the peer's logic network topology. The network topologies that this system uses are organized as star topology, ring topology and tree topology, and agents are migrated by the master/slave method and serial/parallel method. The migration method of services is chosen based on the execution range and characteristic of the requested service. Also, the entire execution time of service is affected by the performance of peer that is a part of network topology, and the migration order, Therefore, the system monitors the performance of peers, and determines the migration priority based on analyzing and learning history. The system can reduce service execution time efficiently with decisions of migration method for service agent and priority of peers.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.499-510
• /
• 2011

Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.16 no.3
• /
• pp.209-218
• /
• 2011

In low voltage high current applications such as fuel cells the current-fed DC-DC converter which has small ripple current and turn ratio is more efficient. In the applications larger than 5kW the conventional single-phase current-fed converter based on full-bridge, half-bridge or push-pull topologies has high current burden of devices such as switches, and the selection and optimized design of the devices are not easy. In this paper a three-phase active-clamped current-fed push-pull DC-DC converter suitable for high power high step-up applications is proposed. The proposed converter has reduced current burden and is suitable for wide input voltage applications due to the use of whole duty cycle range. Design methods of main components including three-phase high frequency transformers are provided, and the validity and performance of the proposed converter are proved from a 5kW prototype.

• KIISE Transactions on Computing Practices
• /
• v.22 no.8
• /
• pp.357-362
• /
• 2016

A social network or bio network is one of the complex networks that are formed by connecting specific relationships between interacting objects. Usually, these networks consist of community structures. Automatically detecting the structures is an important technique to understand and control the interaction objects. However, the topologies and structures of the networks change by interactions of the objects, with respect to time. Conventional techniques for finding the community structure have a high computational complexity. Additionally, the methods inefficiently deal with repeated computation concerning graph operation. In this paper, we propose an incremental technique for detecting interaction-based communities in dynamic networks. The proposed technique is able to efficiently find the communities, since there is an awareness of changed objects from the previous network, and it can incrementally reuse the previous community structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.24-51
• /
• 2011

When supporting both voice and TCP in a wireless multihop network, there are two conflicting goals: to protect the VoIP traffic, and to completely utilize the remaining capacity for TCP. We investigate the interaction between these two popular categories of traffic and find that conventional solution approaches, such as enhanced TCP variants, priority queues, bandwidth limitation, and traffic shaping do not always achieve the goals. TCP and VoIP traffic do not easily coexist because of TCP aggressiveness and data burstiness, and the (self-) interference nature of multihop traffic. We found that enhanced TCP variants fail to coexist with VoIP in the wireless multihop scenarios. Surprisingly, even priority schemes, including those built into the MAC such as RTS/CTS or 802.11e generally cannot protect voice, as they do not account for the interference outside communication range. We present VAGP (Voice Adaptive Gateway Pacer) - an adaptive bandwidth control algorithm at the access gateway that dynamically paces wired-to-wireless TCP data flows based on VoIP traffic status. VAGP continuously monitors the quality of VoIP flows at the gateway and controls the bandwidth used by TCP flows before entering the wireless multihop. To also maintain utilization and TCP performance, VAGP employs TCP specific mechanisms that suppress certain retransmissions across the wireless multihop. Compared to previous proposals for improving TCP over wireless multihop, we show that VAGP retains the end-to-end semantics of TCP, does not require modifications of endpoints, and works in a variety of conditions: different TCP variants, multiple flows, and internet delays, different patterns of interference, different multihop topologies, and different traffic patterns.