• 제목/요약/키워드: 할인 크기

Search Result 3,846, Processing Time 0.033 seconds

Effect of Starvation on the Growth and Hepatocyte Nuclear Size of Larval Rockfish Sebastes schlegeli and Larval Spotted Sea Bass Lateolabrax sp. (조피볼락 Sebastes schlegeli과 점농어 Lateolabrax sp. 자어의 기아시 성장 및 간세포 핵 크기 변화)

  • 박인석;이창규;임재현;김정혜;김선웅
    • Journal of Aquaculture
    • /
    • v.11 no.3
    • /
    • pp.345-352
    • /
    • 1998
  • The effect of starvation on the growth and hepatocyte nuclear size of larval rockfish Sebastes schlegeli and spotted sea bass Lateolabrax sp. were studied. The growth of total length and wet weight in both rockfish and spotted sea bass starved were lower than their control counter-parts. The nuclei sizes of parenchymal cells in the liver of rockfish and spotted sea bass were correlated with the nutritional status of their first-feeding larvae. The result suggested that hepatocyte nuclear size in rockfish and spotted sea bass could be used as an alternative indicator for the identification of starving condition and such karyometry might be criteria for evaluating the successful transition from endogenous to exogenous feeding regime.

  • PDF

AE-CORDIC: Angle Encoding based High Speed CORDIC Architecture (AE-CORDIC: 각도 인코딩 기반 고속 CORDIC 구조)

  • Cho Yongkwon;Kwak Seoungho;Lee Moonkey
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.12
    • /
    • pp.75-81
    • /
    • 2004
  • AE-CORDIC improves the CORDIC operation speed with a rotation direction pre-computation algorithm. Its CORDIC iteration stages consist of non-predictable rotation direction states and predictable rotation stages. The non-predictable stages are replaced with lookup-table which has smaller hardware size than CORDIC iteration stages. The predictable stages can determine rotation direction with the input angle and simple encoder. In this paper, a rotation direction pre-computation algorithm with input angle encoder is proposed. and AE-CORDIC which have optimized Lookup-table is compared with the P-CORDIC algorithm. Hardware size, delay, and SQNR of the AE-CORDIC are verified with Samsung 0.18㎛ technology and Synopsys design compiler when input angle bit length is 16.

A Model of Pupil's Change with Luminance (Luminance에 의한 Pupil의 변화에 대한 모델)

  • Kim, Yong-Geun
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.1 no.2
    • /
    • pp.7-11
    • /
    • 1996
  • The size of pupil with pupillary light reflex is determined by the amount of a luminance. and it is dependent with the distribution function of the retinal illuminance which is the amount of transmittance for the external light due to the size of pupil, and the detector of cone and rod due to the amount of the luminance. The change of the pupil size with the luminance can be expressed with the mathematical model $$y(x)={\alpha}+{\beta}\frac{1}{1+{e}{x}{p}(x-x_0)/{\theta}}$$ where ${\alpha}$ is the size of the pupil diameter in a maximum value of the luminance, ${\beta}$ is the deviation of the pupil's diameter between maximum and minimum, ${\theta}$ is the parameter showed the degree of a sensitivity. Comparing with the experimental value of P.Moon et al, We known that the equation of the model is very compatible.

  • PDF

Face Texture Generation using an Image Alignment Algorithm based on Variable-Sized Blocks of Cylindrical Prototype Model (실린더형 원형모델의 가변적 블록크기를 기반으로 하는 영상정렬 알고리즘을 이용한 얼굴 텍스쳐 생성)

  • Lee, Joong-Jae;Choi, Hyung-Il
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.855-863
    • /
    • 2001
  • We propose an image alignment algorithm based on variable-sized blocks of cylindrical prototype model to generate a face texture for a realistic 3D face model. This is a block matching algorithm which aligns 2D images of a 3D cylindrical model using th correlation between them. While matching blocks, it does not use same sized blocks with considering a curvature of 3D model. And we make a texture of aligned images using a technique of image mosaic. For this purpose, we stitch them with assigning linear weights according to the overlapped region and using the cross-dissolve technique.

  • PDF

Optimal Frame Size Allocation Mechanism for Fast Tag Identification in RFID System (RFID 시스템에서 고속 태그 식별을 위한 최적의 프레임 크기 할당 기법)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1569-1574
    • /
    • 2008
  • Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

Direct digital frequency synthesizer using ROM reduction method (ROM 축소를 이용한 직접디지털 주파수 합성기법)

  • Ahn, Young-Nam;Kim, Chong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.401-404
    • /
    • 2009
  • In this paper, a new method to reduce the size of ROM in the direct digital frequency synthesizer(DDFS) is proposed. The new parallel ROM compression method can reduce the ROM size by using the two ROM. The quantized value of sine is stored by the quantized-ROM and the differential ROM. To reduce the ROM size, we use the differential quantization technique with this two ROM. So the total size of the ROM in the proposed DDFS is significantly reduced compared to the original ROM. The ROM compression ratio of 67.5% is achieved by this method. Also, the power consumption is affected mostly by this ROM reduction.

  • PDF

On sample size selection for disernment of plain and cipher text using the design of experiments (실험계획법을 이용한 평문.암호문 식별방법의 표본크기 선택에 관한 연구)

  • 차경준
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.4
    • /
    • pp.71-84
    • /
    • 1999
  • The randomness test for a sequence from an encription algorithm has an important role to make differences between plain and cipher text. Thus it is necessary to investigate and analyze the currently used randomness tests. Also in real time point of views it would be helpful to know a minimum sample size which gives discernment of plain and cipher text. In this paper we analyze the rate of successes for widely used nonparametric randomness tests to discern plain and cipher text through experiments. Moreover for given sample sizes an optimal sample size for each randomness test is proposed using the design of experiments.

인텔리전트 의복과 생활환경

  • 안영무
    • Proceedings of the Costume Culture Conference
    • /
    • 2004.04a
    • /
    • pp.1-10
    • /
    • 2004
  • 컴퓨터기술은 어디로 가고 있는가? 이 물음에 대한 답은 바로 입는 컴퓨터일 것이다. 입는 컴퓨터는 완전한 기능을 갖춘 컴퓨터를 몸에 지니고 다니면서 언제 어디서나 원하는 일을 할 수 있게 해준다. 처음 만들어진 컴퓨터는 큰 건물만 했으나 책상 위에 올려놓을 정도에서 들고 다닐 수 있는 크기까지 작아졌다. 그러나 노트북 컴퓨터는 아직 휴대하기에는 불편함이 많다. 이 문제를 해결한 제품이 PDA(Personal Data Assistant)이다. (중략)

  • PDF

글로벌리포트3/ 게임속에서 구현된 성

  • Korea Database Promotion Center
    • Digital Contents
    • /
    • no.5 s.120
    • /
    • pp.158-164
    • /
    • 2003
  • 컴퓨터 게임속의 새롭고 독특한 주인공을 만들어 내는 게임 제작을 위해 캐릭터의 '유전자 설계'를 해야 한다. 이렇게 탄생하는 캐릭터들은 性을 비롯해, 모양, 크기, 색깔 등 모든 특성을 포함하는 게놈(Genome)을 갖고 있는 것이다. 게임 캐릭터의 유전자 설계를 통해 불가능한 것은 없다. 돌연변이, 수명의 결정, 후천적인 캐릭터 계승, 그리고 학습된 행동까지 지정할 수 있는 것이다. 컴퓨터 게임에서는 좋아하는 어떤 것이다 디자인 할 수 있다.

  • PDF

Cycle Expansions and Inhibit Conditions in Pyramid Graphs (피라미드 그래프에서의 사이클 확장 및 제약조건)

  • Chang, Jung-Hwan
    • Annual Conference of KIPS
    • /
    • 2007.11a
    • /
    • pp.585-587
    • /
    • 2007
  • 본 논문에서는 피라미드 그래프 내에 내재된 사이클 특성을 분석한다. 사이클 확장 연산을 이용하여 사이클의 크기를 신장시켜 나가는 일련의 과정에서 가능한 모든 정점들을 포함시키기 위해 불가피하게 피해야 할 조건들에 대해 분석한다.