• Title/Summary/Keyword: Identical Distribution

Search Result 358, Processing Time 0.037 seconds

SHAPE OPTIMIZATION OF COMPRESSOR BLADES USING 3D NAVIER-STOKES FLOW PHYSICS

  • Lee K. D.;Chung J.;Shim J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2001.05a
    • /
    • pp.1-8
    • /
    • 2001
  • A CFD-based design method for transonic axial compressor blades was developed based on three-dimensional Navier-Stokes flow physics. The method employs a sectional three-dimensional (S3D) analysis concept where the three-dimensional flow analysis is performed on the grid plane of a span station with spanwise flux components held fixed. The S3D analysis produced flow solutions nearly identical to those of three-dimensional analysis, regardless of the initialization of the flow field. The sectional design based on the S3D analysis can include three-dimensional effects of compressor flows and thus overcome the deficiencies associated with the use of quasi-three-dimensional flow physics in conventional sectional design. The S3D design was first used in the inverse triode to find the geometry that produces a specified target pressure distribution. The method was also applied to optimize the adiabatic efficiency of the blade sections of Rotor 37. A new blade was constructed with the optimized sectional geometries at several span stations and its aerodynamic performance was evaluated with three-dimensional analyses.

  • PDF

A Two-phase Method for the Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

A New Exact Algorithm Using the Stair Structure for the Pallet Loading Problem (계단 구조를 이용한 팔레트적재문제의 새로운 해법)

  • Ji, Yeong-Geun;Jin, Go-Whan
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.3
    • /
    • pp.43-53
    • /
    • 2009
  • The pallet loading problem(PLP) requires the best orthogonal layout that loads the maximum number of identical boxes(small rectangle) onto a pallet(large rectangle). Since the high pallet utilization saves the distribution and storage costs, many heuristic and exact algorithms have been developed so far. Martins and Dell have found the optimal layouts for the all PLPs less than or equal to 100 boxes except for only 5 problems in their recent research. This paper defines the 'stair structure' and proposes a new exact algorithm applying it. In order to show the priority of the proposed algorithm, computational results are compared to previous algorithms and the optimal layouts for the S unsolved problems are given.

Wave scattering among a large number of floating cylinders

  • Kashiwagi, Masashi
    • Structural Engineering and Mechanics
    • /
    • v.21 no.1
    • /
    • pp.53-66
    • /
    • 2005
  • When a large number of identical cylinders are placed in an array with equal separation distance, near-resonant phenomena may occur between cylinders at critical frequencies, and cause large wave forces on each element of the array. In this paper, 64 truncated circular cylinders arranged in 4 rows and 16 columns are considered to check occurrence of near-resonant phenomena and performance of theoretical predictions based on the potential flow. Experiments are conducted in head waves to measure the wave elevation along the longitudinal centerline of the model, and measured results are compared with numerical ones. Attention is focused on the spatial variation of the wave amplitude around the first near-trapped-mode frequency.

Estimation of the Evoked Potential using Bispectrum with Confidence Thresholding (Bispectrum을 이용한 EP 신호 복원에서의 Wiener process 응용)

  • Park, J.I.;Ahn, C.B.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1995 no.11
    • /
    • pp.265-268
    • /
    • 1995
  • Signal averaging technique to improve signal-to-noise ratio has widely been used in various fields, especially in electrophysiology. Estimation of the EP(evoked potential) signal using the conventional averaging method fails to correctly reconstruct the original signal under EEG(electroencephalogram) noise especial]y when the latency times of the evoked potential are not identical. Therefore, a technique based on the bispectrum averaging was proposed for recovering signal waveform from a set o noisy signals with variable signal dalay. In this paper an improved bispectrum estimation technique of the RP signal is proposed using a confidence thresholding of the EP signal in frequency domain in which energy distribution of the EP signal is usually not uniform. The suggested technique is coupled with the conventional bispectrum estimation technique such as least square method and recursive method. Some results with simulated data and real EP signal are shown.

  • PDF

ON THE STRONG LAW OF LARGE NUMBERS FOR WEIGHTED SUMS OF NEGATIVELY SUPERADDITIVE DEPENDENT RANDOM VARIABLES

  • SHEN, AITING
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.1
    • /
    • pp.45-55
    • /
    • 2016
  • Let {$X_n,n{\geq}1$} be a sequence of negatively superadditive dependent random variables. In the paper, we study the strong law of large numbers for general weighted sums ${\frac{1}{g(n)}}{\sum_{i=1}^{n}}{\frac{X_i}{h(i)}}$ of negatively superadditive dependent random variables with non-identical distribution. Some sufficient conditions for the strong law of large numbers are provided. As applications, the Kolmogorov strong law of large numbers and Marcinkiewicz-Zygmund strong law of large numbers for negatively superadditive dependent random variables are obtained. Our results generalize the corresponding ones for independent random variables and negatively associated random variables.

Probabilistic Soft Error Detection Based on Anomaly Speculation

  • Yoo, Joon-Hyuk
    • Journal of Information Processing Systems
    • /
    • v.7 no.3
    • /
    • pp.435-446
    • /
    • 2011
  • Microprocessors are becoming increasingly vulnerable to soft errors due to the current trends of semiconductor technology scaling. Traditional redundant multi-threading architectures provide perfect fault tolerance by re-executing all the computations. However, such a full re-execution technique significantly increases the verification workload on the processor resources, resulting in severe performance degradation. This paper presents a pro-active verification management approach to mitigate the verification workload to increase its performance with a minimal effect on overall reliability. An anomaly-speculation-based filter checker is proposed to guide a verification priority before the re-execution process starts. This technique is accomplished by exploiting a value similarity property, which is defined by a frequent occurrence of partially identical values. Based on the biased distribution of similarity distance measure, this paper investigates further application to exploit similar values for soft error tolerance with anomaly speculation. Extensive measurements prove that the majority of instructions produce values, which are different from the previous result value, only in a few bits. Experimental results show that the proposed scheme accelerates the processor to be 180% faster than traditional fully-fault-tolerant processor with a minimal impact on overall soft error rate.

A Study on the Stochastic User Equilibrium Assignment (확솔적 이용자 평형통행 배분에 관한 연구)

  • 이승재;전경수;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.8 no.1
    • /
    • pp.55-71
    • /
    • 1990
  • The behavioral mechanism underlying the traffic assignment model is a choice, or decision-making process of traveling paths between origins and destinations. The deterministic approach to traffic assignment assumes that travelers choose shortest path from their origin-destination pair. Although this assumption seems reasonable, it presumes that all travelers have perfect information regarding travel time, that they make consistently correct decision, and that they all behave in identical fashion. Stochastic user equilibrium assignment relaxes these presumptions by including a random component in traveler's perception of travel time. The objective of this study is to compare "A Model of Deterministic User Equilibrium Assignment" with "Models of Stochastic User Equilibrium Assignment" in the theoretical and practical aspects. Specifically, SUE models are developed to logit and probit based models according to discrete choice functions. The models were applied to sioux Falls net ork consisting of 24 zones, 24 nodes and 76 links. The distribution of perceived travel time was obtained by using the relationship between speed and traffic flow.

  • PDF

On The Performance of A Suboptimal Assignment Policy in N-Queue m-Server System

  • Ko Soon-Ju
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.43-60
    • /
    • 1991
  • Consider N queues without arrivals and with m identical servers. All jobs are independent and service requirements of jobs in a queue are i.i.d. random variables. At any time only one server may be assigned to a queue and switching between queues are allowed. A unit cost is imposed per job per unit time. The objective is to minimized the expected total cost. An flow approximation model is considered and an upperbound for the percentage error of best nonswitching policies to an optimal policy is found. It is shown that the best nonswitching policy is not worse than $11\%$ of an optimal policy For the stochastic model, we consider the case in which the service requirements of all jobs are i.i.d. with an exponential distribution. A longest first policy is shown to be optimal and a worst case analysis shows that the nonswitching policy which starts with the longest queues is not worse than $11\%$ of the optimal policy.

  • PDF

New PAPR Reduction Method for Spatial Modulation (공간변조 기법을 위한 새로운 PAPR 감쇄 방법)

  • Shang, Yulong;Kim, Hojun;Kim, Hongjoong;Jung, Taejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.1
    • /
    • pp.12-18
    • /
    • 2014
  • In this paper, a new peak-to-average power ratio (PAPR) reduction method for spatial modulation(SM) is presented. By using the matrix with all non-zero elements to precode the signals before transmitting, the transmit power is scattered over all transmit antennas for achieving the goal of PAPR reduction. If this matrix is also an unitary matrix, the distribution of transmit power over transmit antennas will be uniform and it also could retain the characteristic of avoiding inter channel interference (ICI) due to the orthogonality of unitary matrix. In case of a non-ideal amplifier, the proposed method can produce a considerable improvement that increases with a number of transmit antennas in performance. Furthermore, the new scheme achieves an identical performance with conventional one in the case of ideal amplifier.