http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
한국지방잡종과 백색레그혼종 암탉의 혈액상과 혈정단백량에 관하여;1. 지방잡종과 백색레그혼종 암닭의 혈액상에 관하여
조충호,남치주,최창해 한국축산학회 1969 한국축산학회지 Vol.11 No.1
For the future experimental study on hemograms of the sick chickens, and of chickens with good egg production, normal values of blood pictures in 10 Local cross-bred hens and 10 White Leghorn hens between ages of 8 and 10 months were determined. The results obtained were as follows; 1. The erythrocyte count ranged from 2.75 to 3.81 (3.28±0.10) million per cu. ㎜. in Local cross-bred hens, and 3.00 to 3.51 (3.23±0.05) in White Leghorn hens. 2. The hemoglobin value ranged from 9.6 to 12.2 (11.24±0.30) gm. per 100 ㎖. in Local cross-bred hens, and 10.2 to 12.0 (11.09±0.16) in White Leghorn hens. 3. The hematocrit value ranged from 28 to 37 (34.00±0.98) per cent in Local cross-bred hens, and 29 to 36 (33.40±0.75) in White Leghorn hens. 4. The mean corpusular volume ranged from 97.1 to 109.1 (103.66±1.22) cμ. in Local cross-bred hens, and 96.7 to 109.4 (103.32±1.28) in White Leghorn hens. 5. The mean corpusular hemoglobin ranged from 32.0 to 37.1 (34.19±0.41) μ㎍. in Local cross-bred hens, and 32.2 to 35.7 (34.37±0.31) in White Leghorn hens. 6. The mean corpusular hemoglobin concentration ranged from 32.2 to 34.3 (33.09±0.22) per cent in Local cross-bred hens, and 31.9 to 35.2 (33.25±0.36) in White Leghorn hens. 7. The total leukocyte count ranged from 21.2 to 58.4 (42.17±3.35) thousand per cu. ㎜. in Local cross-bred hens, and 24.2 to 55.6 (35.64±2.89) in White Leghorn hens. 8. All items observed did not show significant difference between Local cross-bred hens and White Leghorn hens.
이질적인 제약조건하에서 Admissible Schedules의 특성화
조충호 순천향대학교 1994 논문집 Vol.17 No.1
A lot of scheduling problems have been studied, and several types of software are used. A problem arises in updating the production planning, or 'rescheduling'. when an unexpected event occurs in the shop. To solve this problem, we propose to manipulate a set of equivalent schedules during the short term schedule. Then, if an unexpected event prevents realization of the given schedule, it will be possible to find an equivalent one, without full rescheduling. The primary requirement is to find a formal representation of a set of admissibles schedules. In this paper, A data structure called a PQR-tree Is introduced to be used to represent all admissible schedules under precedence and group constraints. We specify the PQR-tree structure and apply to m machine flow-shop scheduling problem.