• Title/Summary/Keyword: Divisible

Search Result 89, Processing Time 0.022 seconds

The Distributions of Copepods and Chaetognaths in the Southern Waters of Korea and Their Relationship to the Characteristics of Water Masses (한국 남해의 요각류 및 모악류의 분포와 수괴특성)

  • PARK Joo-Suck;LEE Sam-Seuk;KANG Young-Shil;LEE Byung-Don;Hun Sung-Hoi
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.23 no.3
    • /
    • pp.245-252
    • /
    • 1990
  • The distributions of copepods and chaetognaths in waters off the southern coast of Korea were investigated to evaluate their reliability as indicator species of different water masses. The samples for this study were collected vertically from about 5m above the bottom at 28 stations along 8 transects in three different months, February, April, and August, 1988. The sampling gear used was 0.45-meter NORPAC plankton net fitted with 0.33mm mesh. Acartia clausi, Centropages abdominalis, and Sagitta crassa were found to be reliable indicator species of neritic cold waters; Pleuromamma gracilis, Undinula darwini, Calocalanus plumulosus, Calanopia elliptica, and Sagitta enflata were of oceanic warm waters; Temora discaudata and Centropages furcatus were of neritic warm waters. According to the cluster analyses of the species found, the distinctive area in February was divisible into two regions or water masses, the coastal and off-shore regions; in April, however, it was divisible into four regions. In August, it was divisible into three areas, further indicating the strength of the Kuroshio tributaries pushing toward the coast.

  • PDF

Minimizing the Total Stretch when Scheduling Flows of Divisible Requests without Interruption (총 스트레치 최소화를 위한 분할 가능 리퀘스트 흐름 스케줄링)

  • Yoon, Suk-Hun
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.1
    • /
    • pp.79-88
    • /
    • 2015
  • Many servers, such as web and database servers, receive a continual stream of requests. The servers should schedule these requests to provide the best services to users. In this paper, a hybrid genetic algorithm is proposed for scheduling divisible requests without interruption in which the objective is to minimize the total stretch. The stretch of a request is the ratio of the amount of time the request spent in the system to its response time. The hybrid genetic algorithm adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms. Extensive computational experiments have been conducted to compare the performance of the hybrid genetic algorithm with that of genetic algorithms.

A Study on the Divisible Electronic Cash System Functioning Electronic License (전자면허의 기능을 갖는 분할 가능한 전자화폐시스템에 관한 연구)

  • 이애리;이지영
    • The Journal of Information Technology
    • /
    • v.3 no.1
    • /
    • pp.89-97
    • /
    • 2000
  • Electronic commerce on the network requires a new payment system, electronic cash that carries digitalized information of cash. The new system, however, demands the security and privacy because electronic cash is different from real cash in that it can be easily duplicated, forged, or traced. Therefore, electronic cash system should be guaranteed security and privacy to be used as a new payment mechanism with assurance. First, this paper analyzes the existing electronic cash system involving electronic coins, divisible electronic bills, and electronic license. Then the paper proposes a new electronic cash system which claims to be more efficient in the amount of communication and computation. Finally, this study attempts to solve the problem of electronic license.

  • PDF

Design of Divisible Electronic Cash based on Double Hash Chain (이중해쉬체인에 기반한 분할 가능 전자화폐의 설계)

  • 용승림;이은경;이상호
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.408-416
    • /
    • 2003
  • An electronic cash system has to provide the security, to prevent the double spending and to support the divisibility of electronic cash for the easy of use. Divisible electronic cash system allows an electronic cash to be divided into subdivisions. Each subdivision is worth any desired value, but all values must add up to the original cash value. Divisible scheme brings some advantages. It reduces to make the change and also there is no necessity that a customer must withdraw a cash of the desired value whenever transactions occur. In this paper, we present an electronic cash protocol which provides the divisibility based on the double hash chain technique. Electronic cash is constructed in the form of coins. Coins, generated by the double hush chain, have different denominations. The divisibility based on the double hash chain technique. Electronic cash is constructed in the form of coins. Coins, generated by the double hash chain, have different denominations. The divisibility of an electronic cash is satisfied by the payment certificate, which is a pair of bank´s proxy signature received from the bank. When a customer pays the coin of subdivision, the fairness of that coin is certified by a customer´s signing instead of a bank. Although the proposed method does not guarantee user´s anonymity, it generates coins which cannot be forged, and the customer can use an electronic cash conveniently and efficiently with its divisibility.

ON A SYMMETRIC FUNCTIONAL EQUATION

  • Chung, Jae-Young
    • Honam Mathematical Journal
    • /
    • v.34 no.3
    • /
    • pp.375-379
    • /
    • 2012
  • We find a general solution $f:G{\rightarrow}G$ of the symmetric functional equation $$x+f(y+f(x))=y+f(x+f(y)),\;f(0)=0$$ where G is a 2-divisible abelian group. We also prove that there exists no measurable solution $f:\mathbb{R}{\rightarrow}\mathbb{R}$ of the equation. We also find the continuous solutions $f:\mathbb{C}{\rightarrow}\mathbb{C}$ of the equation.

SOME REMARKS ON EISENSTEIN'S CRITERION

  • Woo, Sung-Sik
    • Communications of the Korean Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.499-509
    • /
    • 2008
  • In [4] we showed that a polynomial over a Noetherian ring is divisible by some other polynomial by looking at the matrix formed by the coefficients of the polynomials which we called the resultant matrix. Using the result, we will find conditions for a polynomial over a commutative ring to be irreducible. This can be viewed as a generalization of the Eisenstein's irreducibility criterion.