• Title/Summary/Keyword: N generation

Search Result 1,906, Processing Time 0.027 seconds

Power Flow Control of Grid-Connected Fuel Cell Distributed Generation Systems

  • Hajizadeh, Amin;Golkar, Masoud Aliakbar
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.143-151
    • /
    • 2008
  • This paper presents the operation of Fuel Cell Distributed Generation(FCDG) systems in distribution systems. Hence, modeling, controller design, and simulation study of a Solid Oxide Fuel Cell(SOFC) distributed generation(DG) system are investigated. The physical model of the fuel cell stack and dynamic models of power conditioning units are described. Then, suitable control architecture based on fuzzy logic and the neural network for the overall system is presented in order to activate power control and power quality improvement. A MATLAB/Simulink simulation model is developed for the SOFC DG system by combining the individual component models and the controllers designed for the power conditioning units. Simulation results are given to show the overall system performance including active power control and voltage regulation capability of the distribution system.

A New Test Generation Algorithm Using a Backtrace Fault Simulation (역추적 결함 시뮬레이션을 이용한 새로운 테스트 생성 알고리즘)

  • 권기창;백덕화;권기룡
    • KSCI Review
    • /
    • v.2 no.1
    • /
    • pp.121-129
    • /
    • 1995
  • Fault simulation of logic circuits is an important part of the test-generation process. It is used for the propose of generation fault dictionaries or for the verification of the adequacy of tests. In this paper, a backtrace fault simulation is proposed to test generation. This is consists of 3 part ; initialization phase for given circuit, backtrace fault simulation phase to find fault list and reevaluation phase to list event. The main idea of this algorithm is to retain a minimum fault list by cutting uncontrollable lines of path when a logic event occurs in backward tracing phases. And the simulator is revaluates a fault list associated with the output of an element only if logic event occurs at any of its inputs when a list event occurs at one of its primary inputs. It reguires a O(n) memory space complexity. where n is a number of signal lines for the given circuits. Several examples are given to illustrate the power of this algorithm.

  • PDF

Plans and Strategies for UBcN Networks and Services

  • Lee, Eun-Young
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.323-334
    • /
    • 2010
  • The broadcasting & telecommunication services in the future will be converged and be serviced on mobile devices. However, the current ICT infrastructure does not fully meet the future demand for those converged, realistic, intelligent, and personalized services. The Korean government is going to establish a high speed next generation network called UBcN (Ultra-Broadband Convergence Network) by 2013. The Korean government has announced a multi-year plan to establish an UBcN network and to discover and stimulate new converged services for an UBcN in January, 2009. The author of this paper has taken part in formulating development plans since the early stages of planning. In this paper, Korea's development plans for the next generation network and their development strategies are analyzed and discussed based on the author's experience. The paper also discusses the expected impacts of the plan for the future ICT industry, and the implications of government-driven development plans.

Efficient Generation of Computer-generated Hologram Patterns Using Spatially Redundant Data on a 3D Object and the Novel Look-up Table Method

  • Kim, Seung-Cheol;Kim, Eun-Soo
    • Journal of Information Display
    • /
    • v.10 no.1
    • /
    • pp.6-15
    • /
    • 2009
  • In this paper, a new approach is proposed for the efficient generation of computer-generated holograms (CGHs) using the spatially redundant data on a 3D object and the novel look-up table (N-LUT) method. First, the pre-calculated N-point principle fringe patterns (PFPs) were calculated using the 1-point PFP of the N-LUT. Second, spatially redundant data on a 3D object were extracted and re-grouped into the N-point redundancy map using the run-length encoding (RLE) method. Then CGH patterns were generated using the spatial redundancy map and the N-LUT method. Finally, the generated hologram patterns were reconstructed. In this approach, the object points that were involved in the calculation of the CGH patterns were dramatically reduced, due to which the computational speed was increased. Some experiments with a test 3D object were carried out and the results were compared with those of conventional methods.

Analysis and Design of a Multi-resonant Converter with a Wide Output Voltage Range for EV Charger Applications

  • Sun, Wenjin;Jin, Xiang;Zhang, Li;Hu, Haibing;Xing, Yan
    • Journal of Power Electronics
    • /
    • v.17 no.4
    • /
    • pp.849-859
    • /
    • 2017
  • This paper illustrates the analysis and design of a multi-resonant converter applied to an electric vehicle (EV) charger. Thanks to the notch resonant characteristic, the multi-resonant converter achieve soft switching and operate with a narrowed switching frequency range even with a wide output voltage range. These advantages make it suitable for battery charging applications. With two more resonant elements, the design of the chosen converter is more complex than the conventional LLC resonant converter. However, there is not a distinct design outline for the multi-resonant converters in existing articles. According to the analysis in this paper, the normalized notch frequency $f_{r2n}$ and the second series resonant frequency $f_{r3n}$ are more sensitive to the notch capacitor ratio q than the notch inductor ratio k. Then resonant capacitors should be well-designed before the other resonant elements. The peak gain of the converter depends mainly on the magnetizing inductor ratio $L_n$ and the normalized load Q. And it requires a smaller $L_n$ and Q to provide a sufficient voltage gain $M_{max}$ at ($V_{o\_max}$, $P_{o\_max}$). However, the primary current increases with $(L_nQ)^{-1}$, and results in a low efficiency. Then a detailed design procedure for the multi-resonant converter has been provided. A 3.3kW prototype with an output voltage range of 50V to 500V dc and a peak efficiency of 97.3 % is built to verify the design and effectiveness of the converter.

Theory of Generation Linewidth in Spin-torque Nano-sized Auto-oscillators

  • Kim, Joo-Von;Tiberkevich, Vasil;Slavin, Andrei N.
    • Journal of Magnetics
    • /
    • v.12 no.2
    • /
    • pp.53-58
    • /
    • 2007
  • Theory of the generation linewidth of a current-driven spin-torque magnetic nano-oscillator in the presence of thermal fluctuations has been developed and a simple analytical formula for the generation linewidth in the supercritical regime of generation has been derived. It is shown that the strong dependence of the oscillator frequency on the precession power leads to substantial broadening of the generation linewidth of a spin-torque oscillator compared to the case of a linear oscillator, i.e. an oscillator with power-independent generation frequency. The relation between the nonlinearity-induced broadening of the generation linewidth and the nonlinearity-induced increase of the phase-locking band of a spin-torque oscillator to an external microwave signal has been revealed. The derived expression for the generation linewidth predicts a linewidth minimum when the nano-contact is magnetized at a certain angle to its plane, at which the nonlinear frequency shift vanishes. This result is in good agreement with recent experiments.

A Decomposition Algorithm for a Local Access Telecommunication Network Design Problem

  • Cho, Geon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.29-46
    • /
    • 1998
  • In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n=150 and H=1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

  • PDF

A decomposition algorithm for local access telecommunication network design problem

  • Cho, Geon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.54-68
    • /
    • 1995
  • In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) Design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column. Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot, an entering variable is selected by detecting the Locally Most Violated (LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN Design problem can be solved in O(n$^{2}$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN Design problem with n = 150 and H = 1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

  • PDF

NUMERICAL SIMULATIONS FOR THE CONTRACTION FLOW USING GRID GENERATION

  • Salem, S.A.
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.383-405
    • /
    • 2004
  • We study the incomprssible Navier Stokes equations for the flow inside contraction geometry. The governing equations are expressed in the vorticity-stream function formulations. A rectangular computational domain is arised by elliptic grid generation technique. The numerical solution is based on a technique of automatic numerical generation of acurvilinear coordinate system by transforming the governing equation into computational plane. The transformed equations are approximated using central differences and solved simultaneously by successive over relaxation iteration. The time dependent of the vorticity equation solved by using explicit marching procedure. We will apply the technique on several irregular-shapes.

Estimation of Unit Loads Generation for Swine Wastewater by Cage Test (Cage Test를 통한 양돈폐수 발생원단위 설정)

  • Kim, Yong Seok;Park, Jae Hong;Park, Ji Hyoung;Park, Bae Kyung;Oa, Seong Wook
    • Journal of Korean Society on Water Environment
    • /
    • v.31 no.3
    • /
    • pp.235-240
    • /
    • 2015
  • To evaluate the unit load generation and discharge, pig cage test was conducted. Feed intake, drink amount, and urine generation increased growth stage (heavy weight) of the pig more great. However, the sum of the urine and manure did not show a significant difference in the growth stages of pigs. Because of the limit of the experiment, e.g., research period, high pigpen temperature, breed-related stress and etc., it could not be derived the results of the four seasons. Therefore, in order to generalize the results, the feed intakes were calibrated using a NRC (National Research and nutritional requirements of pigs from the Commission) standards. The finalized unit load generation and generation amounts of manure and urine were estimated at BOD 104.1 g/head/d, T-N 21.2 g/head/d, T-P 4.9 g/head/d, manure 0.96 L/d, urine 1.66 L/d with consideration of revised feed intake. Compare to the former research results of MOE (Ministry of Environment, 1999) and NIAS (National Institute of Animal Science, 2008), the generation amounts of manure and urine were similar to the NIAS's values. In case of unit load generation, BOD and T-N were almost similar in all of them. However, the T-P unit load generation of MOE was more difference, e.g., 2.5 times high, compare to this study.