• Title/Summary/Keyword: Hypercube Network

Search Result 75, Processing Time 0.022 seconds

Design Optimization of a Staggered Dimpled Channel Using Neural Network Techniques (신경회로망기법을 사용한 엇갈린 딤플 유로의 최적설계)

  • Shin, Dong-Yoon;Kim, Kwang-Yong
    • The KSFM Journal of Fluid Machinery
    • /
    • v.10 no.3 s.42
    • /
    • pp.39-46
    • /
    • 2007
  • This study presents a numerical procedure to optimize the shape of staggered dimple surface to enhance turbulent heat transfer in a rectangular channel. The RBNN method is used as an optimization technique with Reynolds-averaged Navier-Stokes analysis of fluid flow and heat transfer with shear stress transport (SST) turbulence model. The dimple depth-to-dimple print diameter (d/D), channel height-to-dimple print diameter ratio (H/D), and dimple print diameter-to-pitch ratio (D/S) are chosen as design variables. The objective function is defined as a linear combination of heat transfer related term and friction loss related term with a weighting factor. Latin Hypercube Sampling (LHS) is used to determine the training points as a mean of the design of experiment. The optimum shape shows remarkable performance in comparison with a reference shape.

Vertex disjoint covering cycle set in hypercubes (하이퍼큐브에서의 정점을 공유하지 않는 커버링사이클 집합)

  • Park, Won;Lim, Hyeong-Seok
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.11-14
    • /
    • 2003
  • In interconnection network for parallel processing, the cycle partitioning problem for parallel transmission with faulty vertieces or edges is very important. In this paper, we assume that k($\leq$m-1) edges do not share any vertices of m dimension hypercube Q$_{m}$ and show that it is possible to construct a cycle set which consists of k cycles covering all the vertices of the hypercube and one cycle including one of the given edges. This cycle set can be used to parallel transmission between two vertices joined by faulty edges.s.

  • PDF

DESIGN OPTIMIZATION OF A STAGGERED DIMPLED CHANNEL TO ENHANCE TURBULENT HEAT TRANSFER (열전달성능 향상을 위한 엇갈린 딤플 유로의 최적설계)

  • Shin, D.Y.;Kim, K.Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2007.04a
    • /
    • pp.159-162
    • /
    • 2007
  • This study presents a numerical procedure to optimize the shape of a staggered dimpled surface to enhance the turbulent heat transfer in a rectangular channel. A optimization technique based on neural network is used with Reynolds-averaged Navier-Stakes analysis of the fluid flow and heat transfer with Shear Stress Transport turbulence model. The dimple depth-to-dimple print diameter ratio, channel height-to-dimple print diameter ratio, and dimple print diameter-to-pitch ratio are chosen as design variables. The objective function is defined as a linear combination of terms related to heat transfer and friction loss with a weighting factor. Latin Hypercube Sampling is used to determine the training points as a mean of the Design of Experiment. Optimal values of the design variables were obtained in a range of the weighting factor.

  • PDF

Optimum Logical Topology for WDM Networks

  • Nittayawan, Jittima;Runggeratigul, Suwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1371-1374
    • /
    • 2002
  • This paper compares four network con-figurations for using as the logical topology in multi- hop wavelength division multiplexing (WDM) networks. The regular network configurations studied in this paper axe ShuffleNet, de Bruijn graph, hypercube, and Man-hattan street network. Instead of using the weight mean hop distance of node placement problem for comparing optimum logical topology, we introduce a new objective function that includes h and the network cost. It can be seen that the network cost strongly depends on the logical topology selected for the implementation of the network. The objective of this paper is to find an optimum logical topology for WDM networks that gives low as well as low network cost.

  • PDF

Study on Improving Learning Speed of Artificial Neural Network Model for Ammunition Stockpile Reliability Classification (저장탄약 신뢰성분류 인공신경망모델의 학습속도 향상에 관한 연구)

  • Lee, Dong-Nyok;Yoon, Keun-Sig;Noh, Yoo-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.6
    • /
    • pp.374-382
    • /
    • 2020
  • The purpose of this study is to improve the learning speed of an ammunition stockpile reliability classification artificial neural network model by proposing a normalization method that reduces the number of input variables based on the characteristic of Ammunition Stockpile Reliability Program (ASRP) data without loss of classification performance. Ammunition's performance requirements are specified in the Korea Defense Specification (KDS) and Ammunition Stockpile reliability Test Procedure (ASTP). Based on the characteristic of the ASRP data, input variables can be normalized to estimate the lot percent nonconforming or failure rate. To maintain the unitary hypercube condition of the input variables, min-max normalization method is also used. Area Under the ROC Curve (AUC) of general min-max normalization and proposed 2-step normalization is over 0.95 and speed-up for marching learning based on ASRP field data is improved 1.74 ~ 1.99 times depending on the numbers of training data and of hidden layer's node.

Embedding Mechanism between Pancake and Star, Macro-star Graph (팬케익 그래프와 스타(Star) 그래프, 매크로-스타(Macro-star) 그래프간의 임베딩 방법)

  • 최은복;이형옥
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.556-564
    • /
    • 2003
  • A Star and Pancake graph also have such a good property of a hypercube and have a low network cost than the hypercube. A Macro-star graph which has the star graph as a basic module has the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. And, it is an interconnection network which improves the network cost against the Star graph. In this paper, we propose a method to embed between Star graph, Pancake graph, and Macro-star graph using the edge definition of graphs. We prove that the Star graph $S_n$ can be embedded into Pancake graph $P_n$ with dilation 4, and Macro-star graph MS(2,n) can be embedded into Pancake graph $P_{2n+1}$ with dilation 4. Also, we have a result that the embedding cost, a Pancake graph can be embedded into Star and Macro-star graph, is O(n).

  • PDF

Optimization of Wind Turbine Pitch Controller by Neural Network Model Based on Latin Hypercube (라틴 하이퍼큐브 기반 신경망모델을 적용한 풍력발전기 피치제어기 최적화)

  • Lee, Kwangk-Ki;Han, Seung-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.9
    • /
    • pp.1065-1071
    • /
    • 2012
  • Wind energy is becoming one of the most preferable alternatives to conventional sources of electric power that rely on fossil fuels. For stable electric power generation, constant rotating speed control of a wind turbine is performed through pitch control and stall control of the turbine blades. Recently, variable pitch control has been implemented in modern wind turbines to harvest more energy at variable wind speeds that are even lower than the rated one. Although wind turbine pitch controllers are currently optimized using a step response via the Ziegler-Nichols auto-tuning process, this approach does not satisfy the requirements of variable pitch control. In this study, the variable pitch controller was optimized by a genetic algorithm using a neural network model that was constructed by the Latin Hypercube sampling method to improve the Ziegler-Nichols auto-tuning process. The optimized solution shows that the root mean square error, rise time, and settle time are respectively improved by more than 7.64%, 15.8%, and 15.3% compared with the corresponding initial solutions obtained by the Ziegler-Nichols auto-tuning process.

Fault Tolerant Static Shuffle-Exchange Network (결함 포용 정적 Shuffle-Exchange 네트워크)

  • Choi Hong In
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.3_4
    • /
    • pp.160-167
    • /
    • 2003
  • A static shuffle-exchange network is not only useful for several parallel applications but also use less hardware than the popular multi-stage network or hypercube. Even though it has a lot of advantages, it has never been used in any implemented parallel machine. One of the reasons is there has not been any techniques to make the network fault-tolerant. In this paper multiple fault-tolerant static shuffle-exchange networks are presented. In order to recover from k faulty processing elements, a network needs at least 2 k additional processing elements and at most 4 k additional shuffle ports for each processing elements. By decomposing the k fault-tolerant static shuffle-exchange network into m identical modules, this paper shows that the reliability of the network can be increased.

Choosing an optimal connecting place of a nuclear power plant to a power system using Monte Carlo and LHS methods

  • Kiomarsi, Farshid;Shojaei, Ali Asghar;Soltani, Sepehr
    • Nuclear Engineering and Technology
    • /
    • v.52 no.7
    • /
    • pp.1587-1596
    • /
    • 2020
  • The location selection for nuclear power plants (NPP) is a strategic decision, which has significant impact operation of the plant and sustainable development of the region. Further, the ranking of the alternative locations and selection of the most suitable and efficient locations for NPPs is an important multi-criteria decision-making problem. In this paper, the non-sequential Monte Carlo probabilistic method and the Latin hypercube sampling probabilistic method are used to evaluate and select the optimal locations for NPP. These locations are identified by the power plant's onsite loads and the average of the lowest number of relay protection after the NPP's trip, based on electricity considerations. The results obtained from the proposed method indicate that in selecting the optimal location for an NPP after a power plant trip with the purpose of internal onsite loads of the power plant and the average of the lowest number of relay protection power system, on the IEEE RTS 24-bus system network given. This paper provides an effective and systematic study of the decision-making process for evaluating and selecting optimal locations for an NPP.