• Title/Summary/Keyword: 함수 최소화 기법

Search Result 319, Processing Time 0.026 seconds

A New Clock Routing Algorithm for High Performance ICs (고성능 집적회로 설계를 위한 새로운 클락 배선)

  • 유광기;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.11
    • /
    • pp.64-74
    • /
    • 1999
  • A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

  • PDF

Design and Analysis of Data File Protection based on the Stream Cipher (데이터파일의 보호를 위한 스트림 암호방식 설계와 해석)

  • 이경원;이중한;김정호;오창석
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.1
    • /
    • pp.55-66
    • /
    • 2004
  • Recently, as the personal computers are supplied rapidly, they formed the nucleus of the computer system. But, because of the easiness that anyone uses them to go near easily, it is the fact that the security of personal computer is weakness. So, in the paper, 1 propose the technical method that minimizes the loss and leakage of important data. This paper implemented a crypto system for security of data file on personal computer and assistance storage medium. The way of encryption/decryption is applied by complexity method which mixed Diffie-Hellman key exchange protocol, a typical RC4(Rivest Cipher version 4) algorithm of stream cipher and a typical MD5(Message Digest version 5) of Hash Function. For valuation implemented crypto system, three criteria is presented, which are crypto complexity, processing time and pattern matching. And according to analysis the three criteria the crypto system is verified the security, efficiency and usefulness. The crypto system is programmed with Visual C++ language of Microsoft. And so, as this is software system, we shall have a technical security system at a minimum cost for all personal computer.

  • PDF

Application of Spatial Data Integration Based on the Likelihood Ratio Function nad Bayesian Rule for Landslide Hazard Mapping (우도비 함수와 베이지안 결합을 이용한 공간통합의 산사태 취약성 분석에의 적용)

  • Chi, Kwang-Hoon;Chung, Chang-Jo F.;Kwon, Byung-Doo;Park, No-Wook
    • Journal of the Korean earth science society
    • /
    • v.24 no.5
    • /
    • pp.428-439
    • /
    • 2003
  • Landslides, as a geological hazard, have caused extensive damage to property and sometimes result in loss of life. Thus, it is necessary to assess vulnerable areas for future possible landslides in order to mitigate the damage they cause. For this purpose, spatial data integration has been developed and applied to landslide hazard mapping. Among various models, this paper investigates and discusses the effectiveness of the Bayesian spatial data integration approach to landslide hazard mapping. In this study, several data sets related to landslide occurrences in Jangheung, Korea were constructed using GIS and then digitally represented using the likelihood ratio function. By computing the likelihood ratio, we obtained quantitative relationships between input data and landslide occurrences. The likelihood ratio functions were combined using the Bayesian combination rule. In order for predicted results to provide meaningful interpretations with respect to future landslides, we carried out validation based on the spatial partitioning of the landslide distribution. As a result, the Bayesian approach based on a likelihood ratio function can effectively integrate various spatial data for landslide hazard mapping, and it is expected that some suggestions in this study will be helpful to further applications including integration and interpretation stages in order to obtain a decision-support layer.

Sample thread based real-time BRDF rendering (샘플 쓰레드 기반 실시간 BRDF 렌더링)

  • Kim, Soon-Hyun;Kyung, Min-Ho;Lee, Joo-Haeng
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.3
    • /
    • pp.1-10
    • /
    • 2010
  • In this paper, we propose a novel noiseless method of BRDF rendering on a GPU in real-time. Illumination at a surface point is formulated as an integral of BRDF producted with incident radiance over the hemi-sphere domain. The most popular method to compute the integral is the Monte Carlo method, which needs a large number of samples to achieve good image quality. But, it leads to increase of rendering time. Otherwise, a small number of sample points cause serious image noise. The main contribution of our work is a new importance sampling scheme producing a set of incoming ray samples varying continuously with respect to the eye ray. An incoming ray is importance-based sampled at different latitude angles of the eye ray, and then the ray samples are linearly connected to form a curve, called a thread. These threads give continuously moving incident rays for eye ray change, so they do not make image noise. Since even a small number of threads can achieve a plausible quality and also can be precomputed before rendering, they enable real-time BRDF rendering on the GPU.

Query Processing of Uncertainty Position Using Road Networks for Moving Object Databases (이동체 데이타베이스에서 도로 네트워크를 이용한 불확실 위치데이타의 질의처리)

  • Ahn Sung-Woo;An Kyung-Hwan;Bae Tae-Wook;Hong Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.283-298
    • /
    • 2006
  • The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

Comparison of Volume of Fluid (VOF) type Interface Capturing Schemes using Eulerian Grid System (오일러 격자체계에서 유체율 함수에 기초한 경계면 추적기법의 비교)

  • Kim, Do-Sam;Kim, Tag-Gyeom;Shin, Bum-Shick;Lee, Kwang-Ho
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.32 no.1
    • /
    • pp.1-10
    • /
    • 2020
  • The application of multiphase flows is increasingly being applied to analyze phenomena such as single phase flows where the fluid boundary changes continuously over time or the problem of mixing a liquid phase and a gas phase. In particular, multiphase flow models that take into account incompressible Newtonian fluids for liquid and gas are often applied to solve the problems of the free water surface such as wave fields. In general, multi-phase flow models require time-based the surface tracking of each fluid's phase boundary, which determines the accuracy of the final calculation of the model. This study evaluates the advection performance of representative VOF-type boundary tracking techniques applied to various CFD numerical codes. The effectiveness of the FCT method to control the numerical flux to minimize the numerical diffusion in the conventional VOF-type boundary tracking method and advection calculation was mainly evaluated. In addition, the possibility of tracking performance of free surface using CIP method (Yabe and Aoki, 1991) was also investigated. Numerical results show that the FCT-VOF method introducing an anti-diffusive flux to precent excessive diffusion is superior to other methods under the confined conditions in this study. The results from this study are expected to be used as an important basic data in selecting free surface tracking techniques applied to various numerical codes.

TOPSIS-Based Multi-Objective Shape Optimization for a CRT Funnel (TOPSIS 를 적용한 CRT 후면유리의 다중목적 형상최적설계)

  • Lee, Kwang-Ki;Han, Jeong-Woo;Han, Seung-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.7
    • /
    • pp.729-736
    • /
    • 2011
  • The technique for order preference by similarity to ideal solution (TOPSIS) is regarded as a classical method of multiple attribute decision making (MADM), often used to solve various decision-making or selection problems. It is based on the concept that the chosen alternative should have the shortest distance from the positive ideal solution and the farthest distance from the negative ideal solution. The TOPSIS can be applied to a design process for carrying out multi-objective shape optimization wherein the best and worst alternatives are to be decided. In this paper, multi-objective shape optimization using the TOPSIS and Rational Bezier curve was applied to the funnel of a cathode-ray tube (CRT). In order to minimize the weight and first principal stress, a new multi-objective shape optimization methodology is proposed, wherein the relative-closeness coefficients of the TOPSIS are defined as the performance indices of a multi-objective function and evaluated by response surface models. This methodology enables the designer to decide on the best solution from a number of design specification groups by examining the various conflicts between the weight and the first principal stress.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

A Meshless Method Using the Local Partition of Unity for Modeling of Cohesive Cracks (점성균열 모델을 위한 국부단위분할이 적용된 무요소법)

  • Zi, Goangseup;Jung, Jin-kyu;Kim, Byeong Min
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.5A
    • /
    • pp.861-872
    • /
    • 2006
  • The element free Galerkin method is extended by the local partition of unity method to model the cohesive cracks in two dimensional continuum. The shape function of a particle whose domain of influence is completely cut by a crack is enriched by the step enrichment function. If the domain of influence contains a crack tip inside, it is enriched by a branch enrichment function which does not have the LEFM stress singularity. The discrete equations are obtained directly from the standard Galerkin method since the enrichment is only for the displacement field, which satisfies the local partition of unity. Because only particles whose domains of influence are influenced by a crack are enriched, the system matrix is still sparse so that the increase of the computational cost is minimized. The condition for crack growth in dynamic problems is obtained from the material instability; when the acoustic tensor loses the positive definiteness, a cohesive crack is inserted to the point so as to change the continuum to a discontiuum. The crack speed is naturally obtained from the criterion. It is found that this method is more accurate and converges faster than the classical meshless methods which are based on the visibility concept. In this paper, several well-known static and dynamic problems were solved to verify the method.

작업관련성을 고려한 U라인 밸런싱+

  • 김우열;김용주;김동묵
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2002.05a
    • /
    • pp.73-80
    • /
    • 2002
  • 본 연구는 U자형 생산라인(U라인)에서의 라인밸런싱 문제를 해결하기 위한 유전알고리즘을 제시한다. U라인에서는 사이클 타임 내에 제품이 들어가는 방향과 나오는 방향의 작업을 한 작업자가 수행 할 수 있어서, 재공품 수량을 일정하게 유지한다거나 작업부하를 평활화 하는 등의 라인관리가 기존 직선라인에 비해 용이하다. U라인은 JIT(Just-ln-Time)생산 시스템에서 흔히 볼 수 있다. 본 연구는 U라인에서 사이클 타임이 고정되었을 때 작업장 또는 작업자의 수를 최소로 하면서 동시에 작업장에 할당된 작업들 간의 관련성을 최대화하는 라인밸런싱 문제를 다루었다. 라인밸런싱에 관한 기존 연구는 대부분 직선라인에 관한 것으로 U라인의 장점을 충분히 활용하지 못한다. 특히, 라인의 작업장의 수를 최소화하는 문제는 많은 대안해가 있음에도 불구하고, 작업관련성을 고려하여 해를 구하는 기법에 관한 연구는 아직 미미한 실정이다. 실제 조립라인에서는 가능한 한 관련된 작업들을 동일한 작업자에 할당하는 것이 바람직하며, 이러한 작업편성은 작업자의 작업능률을 향상시킬 수 있다. 유전알고리즘은 자연계의 적자생존과 생물학적 진화과정을 모방한 탐색기법으로 조합최적화 문제에 효과적인 기법으로 널리 알려져 있다. 본 연구는 유전알고리즘을 이용하여 U라인에서 작업관련성을 고려한 라인밸런싱 문제를 해결하기 위한 기법을 개발하였다. 문제의 목적에 적합한 개체의 평가함수가 제시되었으며, 개체의 형질을 효과적으로 자손에 유전할 수 있고 유전 연산이 용이한 개체의 표현방법과 개체의 해석방법이 제시되었다. 컴퓨터 실험을 통하여 개발한 알고리즘의 성능을 보였다.월 초순부터 중순에 각각 최고 성기를 나타내었다. H. papariensis의 암컷과 수컷의 발광양상을 분석하고자 정지발광과 구애 발광을 구분하여 조사하였고 각각의 발광지속시간과 발광주기를 구분하여 측정하였다. 수컷의 발광지속시간은 정지발광(0.12초)보다 구애발광(0.17초)에서 1.4배 증가하였으며 암컷의 발광지속시간은 정지발광(0.15초)보다 구애발광(0.19초)에서 1.5배 증가하였다. 발광주기는 수컷에서 정지발광(1.26초)보다 구애발광(1.12초)에서 0.88배 감소하였고, 암컷에서 정지발광(2.99초)보다 구애발광(1.06초)에서 0.35배 감소하였다. 발광양상에서 발광주파수는 수짓의 정지발광에서 0.8 Hz, 수컷 구애발광에서 0.9 Hz, 암컷의 정지발광에서 0.3 Hz, 암컷의 구애발광에서 0.9 Hz로 각각 나타났다. H. papariensis의 발광파장영역은 400 nm에서 700 nm에 이르는 모든 영역에서 확인되었으며 가장 높은 첨두치는 600 nm에 있고 500에서 600 nm 사이의 파장대가 가장 두드러지게 나타났다. 발광양상과 어우러진 교미행동은 Hp system과 같은 결과를 얻었다.하는 방법을 제안한다. 즉 채널 액세스 확률을 각 슬롯에서 예약상태에 있는 음성 단말의 수뿐만 아니라 각 슬롯에서 예약을 하려고 하는 단말의 수에 기초하여 산출하는 방법을 제안하고 이의 성능을 분석하였다. 시뮬레이션에 의해 새로 제안된 채널 허용 확률을 산출하는 방식의 성능을 비교한 결과 기존에 제안된 방법들보다 상당한 성능의 향상을 볼 수 있었다., 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른 영향을

  • PDF