• Title/Summary/Keyword: binary number

Search Result 773, Processing Time 0.027 seconds

A Scheduling Method on Parallel Computation Models with Limited Number of Processors Using Genetic Algorithms (프로세서의 수가 한정되어있는 병렬계산모델에서 유전알고리즘을 이용한 스케쥴링해법)

  • 성기석;박지혁
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.15-27
    • /
    • 1998
  • In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

  • PDF

Branch-and-bound method for solving vertical partitioning problems in the design of the relational database (관계형 데이터 베이스 설계에서 분지한계법을 이용한 수직분할문제)

  • 윤병익;김재련
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.37
    • /
    • pp.241-249
    • /
    • 1996
  • In this paper, a 0-1 integer programming model for solving vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve the binary vertical partitioning problem. In relational databases, the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. Vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

  • PDF

On Compositional Convection in Near-Eutectic Solidification System Cooled from a Bottom Boundary

  • Hwang, In Gook
    • Korean Chemical Engineering Research
    • /
    • v.55 no.6
    • /
    • pp.868-873
    • /
    • 2017
  • Natural convection is driven by the compositional buoyancy in solidification of a binary melt. The stabilities of convection in a growing mushy layer were analyzed here in the time-dependent solidification system of a near-eutectic melt cooled impulsively from below. The linear stability equations were transformed to self-similar forms by using the depth of the mushy layer as a length scale. In the liquid layer the stability equations are based on the propagation theory and the thermal buoyancy is neglected. The critical Rayleigh number for the mushy layer increases with decreasing the Stefan number and the Prandtl number. The critical conditions for solidification of aqueous ammonium chloride solution are discussed and compared with the results of the previous model for the liquid layer.

THE NUMBER OF REPRESENTATIONS OF A POSITIVE INTEGER BY TRIANGULAR, SQUARE AND DECAGONAL NUMBERS

  • Isnaini, Uha;Melham, Ray;Toh, Pee Choon
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1143-1157
    • /
    • 2019
  • Let $T_aD_b(n)$ and $T_aD^{\prime}_b(n)$ denote respectively the number of representations of a positive integer n by $a(x^2-x)/2+b(4y^2-3y)$ and $a(x^2-x)/2+b(4y^2-y)$. Similarly, let $S_aD_b(n)$ and $S_aD^{\prime}_b(n)$ denote respectively the number of representations of n by $ax^2+b(4y^2-3y)$ and $ax^2+b(4y^2-y)$. In this paper, we prove 162 formulas for these functions.

A Study on Binary System of Calcium Phosphate-Kaolin, -Quartz, -Feldspar and Limestone (Calcium Phosphate와 Kaolin, Quartz, Feldspar, Limestone과의 이성분계 소성에 관한 연구)

  • 이응상;이성희
    • Journal of the Korean Ceramic Society
    • /
    • v.25 no.5
    • /
    • pp.437-442
    • /
    • 1988
  • We have suffered number of problems in supplying bone ash for bone china bodies as raw materals, because of its impurity and quantity. To reduce these problems, we have synthesized tricalcium phosphate that was reacted by H2PO4 and CaCO3 ; 3Ca(OH)2+2H3PO4longrightarrowCa3(PO4)2+6H2O. Therefore, we have studied solid reactions of synthesized tricalcium phosphate withkaoline, limestone, feldspar and silica, respectively.

  • PDF

An O($n^2log n$) Algorithm for the Linear Knapsack Problem with SUB and Extended GUB Constraints (단순상한 및 확장된 일반상한제약을 갖는 선형배낭문제의 O($n^2log n$) 해법)

    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.1-9
    • /
    • 1997
  • We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

  • PDF

Efficient ROM Size Reduction for Distributed Arithmetic (벡터 내적을 위한 효율적인 ROM 면적 감소 방법)

  • 최정필;성경진;유경주;정진균
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.821-824
    • /
    • 1999
  • In distributed arithmetic-based architecture for an inner product between two length-N vectors, the size of the ROM increases exponentially with N. Moreover, the ROMs are generally the bottleneck of speed, especially when their sire is large. In this paper, a ROM size reduction technique for DA (Distributed Arithmetic) is proposed. The proposed method is based on modified OBC (Offset Binary Coding) and control circuit reduction technique. By simulations, it is shown that the use of the proposed technique can result in reduction in the number of gates up to 50%.

  • PDF

Design of Nonlinear Lead and/or Lag Compensators

  • Nassirharand, Amir;Firdeh, Seyed Reza Mousavi
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.3
    • /
    • pp.394-400
    • /
    • 2008
  • A known nonlinear compensator design approach is adapted to allow design of nonlinear lead and/or lag compensators, and a number of MATLAB functions are developed that automate the compensator design procedure. With this design tool, control engineers would be able to rapidly design nonlinear lead and/or lag compensators. An example of a tutorial nature is presented.

Hardware Implementation or (255,239) BCH decoder using Direct Decoding Method (직접복호법을 이용한 (255,239) BCH 부호의 복호기)

  • Cho, Yong-Suk;Park, Cha-Sang;Rhee, Man-Young
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.203-206
    • /
    • 1988
  • Direct Decoding Method for binary BCH codes which directly can find error location number from syndrome without calculating error locator polynomial is presented in this paper. The (255,239) BCH decoder is implemented using TTL logics. It is shown from our results that this decoder can be implemented with relatively simple hardware.

  • PDF

Unsupervised segmentation of Multi -Source Remotely Sensed images using Binary Decision Trees and Canonical Transform

  • Mohammad, Rahmati;Kim, Jung-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.23.4-23
    • /
    • 2001
  • This paper proposes a new approach to unsupervised classification of remotely sensed images. Fusion of optic images (Landsat TM) and radar data (SAR) has beer used to increase the accuracy of classification. Number of clusters is estimated using generalized Dunns measure. Performance of the proposed method is best observed comparing the classified images with classified aerial images.

  • PDF