• Title/Summary/Keyword: cell problems

Search Result 1,087, Processing Time 0.029 seconds

Performance Evaluation of Pico Cell Range Expansion and Frequency Partitioning in Heterogeneous Network (Heterogeneous 네트워크에서 Pico 셀 범위 확장과 주파수 분할의 성능 평가)

  • Qu, Hong Liang;Kim, Seung-Yeon;Ryu, Seung-Wan;Cho, Choong-Ho;Lee, Hyong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.677-686
    • /
    • 2012
  • In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

Optimization of Controller Parameters using A Memory Cell of Immune Algorithm (면역알고리즘의 기억세포를 이용한 제어기 파라메터의 최적화)

  • Park, Jin-Hyeon;Choe, Yeong-Gyu
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.8
    • /
    • pp.344-351
    • /
    • 2002
  • The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response. We use the proposed algorithm to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore the usefulness of memory-cell mechanism in immune algorithm is without. This paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. The results of Computer simulations represent that the proposed immune algorithm shows a fast convergence speed and a good control performances under the varying system parameters.

The study for inter-cell interference reduction techniques in portable internet networks. (휴대인터넷의 셀간 간섭 제거에 관한 연구)

  • Park, Chi-Ho;Hwan, Oh-Young
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.229-230
    • /
    • 2006
  • In this thesis, we analyze performance related to reduction scheme of inter-cell interference causing serious problems in portable internet system. Frequency reusing factor(FUF) is 1 in portable internet system, and it means that a adjacent cell uses same frequency band. This channel environment raises inter-cell interference problem, which provokes serious problems related to system performance and channel capacity. Consequently, it affects deterioration in system performance as a whole. We analyze inter-cell interference when appling a various schemes such as (DCA)Dynamic Channel Allocation, CS(Channel Segregation), IDMA(Interleave Division Multiple Access), FH-OFDM, CRSA(Conceptual Random Subcarrier Allocation), and HDD

  • PDF

The Use of Stem Cells as Medical Therapy (줄기세포를 이용한 세포치료법)

  • Son Eun-Hwa;Pyo Suhkneung
    • KSBB Journal
    • /
    • v.20 no.1 s.90
    • /
    • pp.1-11
    • /
    • 2005
  • Recently, there has been extremely active in the research of stem cell biology. Stem cells have excellent potential for being the ultimate source of transplantable cells for many different tissues. Researchers hope to use stem cells to repair or replace diseased or damaged organs, leading to new treatments for human disorders that are currently incurable, including diabetes, spinal cord injury and brain diseases. There are primary sources of stem cells like embryonic stem cells and adult stem cells. Stem cells from embryos were known to give rise to every type of cell. However, embryonic stem cells still have a lot of disadvantages. First, transplanted cells sometimes grow into tumors. Second, the human embryonic stem cells that are available for research would be rejected by a patient's immune system. Tissue-matched transplants could be made by either creating a bank of stem cells from more human embryos, or by cloning a patient's DNA into existing stem cells to customize them. However, this is laborious and ethically contentious. These problems could be overcome by using adult stem cells, taken from a patient, that are treated to remove problems and then put back. Nevertheless, some researchers do not convince that adult stem cells could, like embryonic ones, make every tissue type. Human stem cell research holds enormous potential for contributing to our understanding of fundamental human biology. In this review, we discuss the recent progress in stem cell research and the future therapeutic applications.

A Study of Formation of Machine Cell-Part Family in FMS using the Simulated Annealing Algorithm (시뮬레이티드 어닐링 알고리즘을 이용한 유연생산시스템의 기계셀-부품군 형성에 관한 연구)

  • Kim, Jin-Yong;Park, Dae-Geuk;Oh, Byeong-Wan;Hong, Sung-Jo;Choi, Jin-Yeong
    • IE interfaces
    • /
    • v.10 no.2
    • /
    • pp.1-13
    • /
    • 1997
  • The problem of the formation of machine-part cells in FMS is a very important issue at the planning and operating stages of FMS. This problem is inherently a combinatorial optimization problem, proven to be NP-complete(or, NP-hard). Among the several kinds of approaches which have been applied to solve the combinatorial optimization problems, the Simulated Annealing(SA) algorithm, a technique of random search type with a flexibility in generating alternatives, is a powerful problem solving tool. In this paper, the SA algorithm is used to solve machine cell-part family formation problems. The primary purpose of the study is to find the near-optimal solution of machine cell-part family formation problem, whare the product volume and number of operations are prespecified, that can minimize the total material handling cost caused by exceptional elements and intercell moves as much as possible. The results show that the SA algorithm is able to find a near-optimal solution for practical problems of the machine cell-part family formation.

  • PDF

Cross section generation for a conceptual horizontal, compact high temperature gas reactor

  • Junsu Kang;Volkan Seker;Andrew Ward;Daniel Jabaay;Brendan Kochunas;Thomas Downar
    • Nuclear Engineering and Technology
    • /
    • v.56 no.3
    • /
    • pp.933-940
    • /
    • 2024
  • A macroscopic cross section generation model was developed for the conceptual horizontal, compact high temperature gas reactor (HC-HTGR). Because there are many sources of spectral effects in the design and analysis of the core, conventional LWR methods have limitations for accurate simulation of the HC-HTGR using a neutron diffusion core neutronics simulator. Several super-cell model configurations were investigated to consider the spectral effect of neighboring cells. A new history variable was introduced for the existing library format to more accurately account for the history effect from neighboring nodes and reactivity control drums. The macroscopic cross section library was validated through comparison with cross sections generated using full core Monte Carlo models and single cell cross section for both 3D core steady-state problems and 2D and 3D depletion problems. Core calculations were then performed with the AGREE HTR neutronics and thermal-fluid core simulator using super-cell cross sections. With the new history variable, the super-cell cross sections were in good agreement with the full core cross sections even for problems with significant spectrum change during fuel shuffling and depletion.

A Manufacturing Cell Formantion Algorithm Using Neural Networks (신경망을 이용한 제조셀 형성 알고리듬)

  • 이준한;김양렬
    • Korean Management Science Review
    • /
    • v.16 no.1
    • /
    • pp.157-171
    • /
    • 1999
  • In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

  • PDF

Status of Fuel Cell Technology (연료전지의 개발 동향)

  • Kim, Gwi-Yeol
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2007.11a
    • /
    • pp.3-4
    • /
    • 2007
  • Many electrochemical power devices such as solid state batteries and solid oxide fuel cell have been studied and developed for solving energy and environmental problems. Fuel cell is a modular, high efficient and environmentally energy conversion device, it has become a promising option to replace the conventional fossil fuel based electric power plants. This paper offers some new perspectives on fuel cell development and commercialization which come from the broad consideration of the commercialization efforts of the entire fuel cell industry.

  • PDF

Immune Algorithm Controller Design of DC Motor with parameters variation (DC 모터 파라메터 변동에 대한 면역 알고리즘 제어기 설계)

  • 박진현;전향식;이민중;김현식;최영규
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.175-178
    • /
    • 2002
  • The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response, and has been used as methods to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore, the effect of memory-cell mechanism, which is a merit of immune algorithm, is without. this paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. Computer simulation studies show that the proposed immune algorithm has a fast convergence speed and a good control performances under the varying system parameters.

  • PDF

GPU Algorithm for Outer Boundaries of a Triangle Set (GPU를 이용한 삼각형 집합의 외경계 계산 알고리즘)

  • Kyung, Min-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.4
    • /
    • pp.262-273
    • /
    • 2012
  • We present a novel GPU algorithm to compute outer cell boundaries of 3D arrangement subdivided by a given set of triangles. An outer cell boundary is defined as a 2-manifold surface consisting of subdivided polygons facing outward. Many geometric problems, such as Minkowski sum, sweep volume, lower/upper envelop, Bool operations, can be reduced to finding outer cell boundaries with specific properties. Computing outer cell boundaries, however, is a very time-consuming job and also is susceptible to numerical errors. To address these problems, we develop an algorithm based on GPU with a robust scheme combining interval arithmetic and multi-level precisions. The proposed algorithm is tested on Minkowski sum of several polygonal models, and shows 5-20 times speedup over an existing algorithm running on CPU.