• Title/Summary/Keyword: Value problem

Search Result 4,704, Processing Time 0.031 seconds

Enforcing minimum-phase conditions on an arbitrry one-dimensional signal and its application ot two-dimensional phase retrieval problem (임의의 1 차원 신호의 최소 위상 신호화와 2차원 위상복원문제에의 응용)

  • 김우식
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.1
    • /
    • pp.105-114
    • /
    • 1997
  • The phase retrieval problem is concerned with the reconstruction of a signal or its fourier transform phase form the fourier transform magnitude of the signal. This problem does not have a unique solution, in general. If, however, the desired signal is minimum-phase, then it can be decided uniquely. This paper shows that we can make a minimum-phase signal by adding a delta function having a large value at the origin of an arbitrary one-dimensional signal, and a two-dimensional signal can be uniquely specified from its fourier transform magnitude if it is added by a delta function having a large value at the origin, and finally we can solve a two-dimensional phase retrieval problem by decomposing it into several ine-dimensional phase retrieval problems.

  • PDF

Two-dimensional Elastic Analysis of Doubly Periodic Circular Holes in Infinite Plane

  • Lee, Kang-Yong;Chen, Yi-Zhou
    • Journal of Mechanical Science and Technology
    • /
    • v.16 no.5
    • /
    • pp.655-665
    • /
    • 2002
  • Two-dimensional elastic analysis of doubly periodic circular holes in an infinite plane is given in this paper. Two cases of loading, remote tension and remote shear, are considered. A rectangular cell is cut from the infinite plane. In both cases, the boundary value problem can be reduced to a complex mixed one. It is found that the eigenfunction expansion variational method is efficient to solve the problem. Based on the deformation response under certain loading, the notched medium could be modeled by an orthotropic medium without holes. Elastic properties for the equivalent orthotropic medium are investigated, and the stress concentration along the hole contour is studied. Finally, numerical examples and results are given.

Digital Image Enhancement Algorithm

  • Yoo, Suk Won
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.3
    • /
    • pp.48-55
    • /
    • 2016
  • Conventional techniques for solving the noise problem have problems to generate different results, depending on the image size and weight values of the used masks, and they require many operations by using a complex formula. In this paper, we propose an image enhancement algorithm to solve the noise problem in a simple, yet easy-to-use way. For this purpose, we determined the difference between the noise of the two adjacent pixels for the horizontal and vertical, and for the two diagonal directions that each of the noise problem occurred, and then we got the average value of these pixel values. Then, we solve the noise problem by using the optimal average value in accordance with occurrence of the noise in the horizontal and vertical, and two adjacent pixels in a diagonal direction. As a result, we got the result that the noise solution in a simple, yet easy-to-use method to obtain a resultant image.

A Study on the Application of SVD to an Inverse Problem in a Cantilever Beam with a Non-minimum Phase (비최소 위상을 갖는 외팔보에서 SVD를 이용한 역변환 문제에 관한 연구)

  • 이상권;노경래;박진호
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.11 no.9
    • /
    • pp.431-438
    • /
    • 2001
  • This paper present experimental results of source identification for non-minimum phase system. Generally, a causal linear system may be described by matrix form. The inverse problem is considered as a matrix inversion. Direct inverse method can\`t be applied for a non-minimum phase system, the reason is that the system has ill-conditioning. Therefore, in this study to execute an effective inversion, SVD inverse technique is introduced. In a Non-minimum phase system, its system matrix may be singular or near-singular and has one more very small singular values. These very small singular values have information about a phase of the system and ill-conditioning. Using this property we could solve the ill-conditioned problem of the system and then verified it for the practical system(cantilever beam). The experimental results show that SVD inverse technique works well for non-minimum phase system.

  • PDF

CONSTRAINED DEFUZZIFICATION

  • Yager, Ronald R.;Filev, Dimitar P.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1167-1170
    • /
    • 1993
  • We look at the problem of defuzzification in situations in which in addition to the usual fuzzy output of the controller there exists some ancillary restriction on the allowable defuzzified values. We provide two basic approaches to address this problem. In the first approach we enforce the restriction by selecting the defuzzified value through a random experiment in which the values which have nonzero probabilities are in the allowable region, this method is based on the RAGE defuzzification procedure and makes use of a nonmonotonic conjunction operator. The second approach which in the spirit of the commonly used methods, a kind of expected value, converts the problem to a constraint optimization problem.

  • PDF

A Lagrangean Relaxation Method of Three-Dimensional Nonguillotine Cutting-Stock Problem (3차원 비길로틴 자재절단문제의 라그랑지안 완화 해법)

  • Kim, Sang-Youl;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.741-751
    • /
    • 1996
  • The three dimensional cutting-stock problem is to maximize the total value of pieces which are smaller cubics-cut from a original cubic stock. This paper suggests a method to maximize the total value of different size cut pieces using the orthogonal non-guillotine cut technique. We first formulated a zero-one integer programming, then developed a Lagrangeon relaxation method far the problem. The solutions were given by using a brunch-end-bound technique associates with Lagrangean relaxation, which guarantees an optimal solution.

  • PDF

A Stochastic Facility Location Model for Both Ameliorating and Deteriorating Items in Two-Echelon Supply-Chain Management (증식 및 진부화되는 제품을 취급하는 물류시스템의 최적 설비계획모델의 연구)

  • Hwang, Heung-Suk
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.384-391
    • /
    • 2000
  • Most of the previous works on classical location models are based on the assumption that the value(or utilities) of inventory remains constants over time. In this study a special case of location problem is studied for both ameliorating and deteriorating items in two-echelon supply-chain management such as agricultural and fishery products. The objective of this study is to determine the minimum number of storage facilities among a discrete set of location sites so that the probability for each customer to be covered is not less than a critical value. We have formulated this problem using stochastic set-covering problem which can be solved by 0-1 programming method. Also we developed a computer program and applied to a set of problems for fish culture storage and distribution centers and the sample results well show the impact of ameliorating and deteriorating rate on the location problem. For the further study, a graphical user-interface with visualization for input and output is needed to be developed.

  • PDF

Analyzing Problem Instance Space Based on Difficulty-distance Correlation (난이도-거리 상관관계 기반의 문제 인스턴스 공간 분석)

  • Jeon, So-Yeong;Kim, Yong-Hyuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.4
    • /
    • pp.414-424
    • /
    • 2012
  • Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.