• Title/Summary/Keyword: even

Search Result 36,304, Processing Time 0.052 seconds

Physical Properties of Various Structured Knitted Fabrics (니트의 편성조직에 따른 물성 평가)

  • Yea, Su-Jeong;Song, Wha-Soon
    • Fashion & Textile Research Journal
    • /
    • v.13 no.6
    • /
    • pp.990-995
    • /
    • 2011
  • This study analyzed the effects of the knit stitch type, fiber composition, and yarn thickness on the mechanical properties of knitted fabric. The results were as follows: The course density was the highest in the case of the rib stitch. On the other hand, the wale density was the highest in the case of the float stitch. The thickness was the highest in the case of the rib stitch. The same results were obtained even for different fiber compositions and yarn thicknesses considered in this study. The burst strength of wool knit fabric was higher than that of A/W knit fabric. The stiffness was the lowest in the case of the plain stitch. The same results were obtained even for different fiber compositions and yarn thicknesses. The pilling properties were excellent for all knit stitches, fiber composition, and yarn thicknesses as pilling degree : 5. The air permeability decreased in the following order : rib > plain > float stitch. The same results were obtained even for different fiber compositions and yarn thicknesses. The heat retention rate decreased in the following order : rib > float > plain stitch. The same results were obtained even for different fiber compositions and yarn thicknesses.

Canonical Latin Square Algorithm for Round-Robin Home-and-Away Sports Leagues Scheduling (라운드-로빈 홈 앤드 어웨이 스포츠 리그 대진표 작성 정규형 라틴 방진 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.177-182
    • /
    • 2018
  • The home-and-way round-robin sports leagues scheduling problem with minimum brake is very hard to solve in polynomial time. This problem is NP-hard, the complexity status is not yet determined. This paper suggests round-robin sports leagues scheduling algorithm not computer-aided program but by hand with O(n) time complexity for arbitrary number of teams n with always same pattern. The algorithm makes a list of mathes using $n{\times}n$ canonical latin square for n=even teams. Then trying to get home(H) and away(A) with n-2 minimum number of brakes. Also, we get the n=odd scheduling with none brakes delete a team own maximum number of brakes from n=even scheduling.

MOEPE: Merged Odd-Even PE Architecture for Stereo Matching Hardware (MOEPE: 스테레오 정합 하드웨어를 위한 Merged Odd-Even PE구조)

  • Han, Phil-Woo;Yang, Yeong-Yil
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.10
    • /
    • pp.57-64
    • /
    • 2000
  • In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamprogrammethod. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities form the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the same number of the range constraint, which reduced the nuMber of the necessary PEs draMatically compared to the traditional method which uses the PEs with the same number of pixels on the epipolar line. For the normal sized images, the numof the MOEPE architecture is less than that of the PEs in the traditional method by 25${\times}$The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

  • PDF

An Analysis of Evaluation for Korean Native Cattle (Hanwoo) Reproductive Performance and Cow-Calf Profitability (한우의 번식실태평가 및 번식우 생산성 분석)

  • Cho, Jaesung;Do, Changhee;Song, Hyungjun;Choi, Inchul
    • Journal of Embryo Transfer
    • /
    • v.30 no.3
    • /
    • pp.189-193
    • /
    • 2015
  • Calculating break-even price of calf production is closely associated with reproductive efficiency. To determine the price, we need data from reproduction records including number of claves weaned, number of cows exposed for breeding, and annual cash coast per cow, and average weaning or market weight of claves sold and retained. Unfortunately, the data were not available in Korea native cow (Hanwoo). To evaluate the performance and the price, we collected calving interval from about 60,000 cows for last 10 years and estimated reproductive performance. Calving interval was increased 4.3% and pregnancy rate was decreased about 1.4~2.8% year-on-year. Increases in growth rates of number of cow and semen per calf supported the low reproductive performance. Finally, break-even price was calculated using estimated percent calf crop and demonstrated that growth rate of break-even price is larger than that of annual cash per cow, suggesting cow-calf profitability and financial efficiency in Korea native cow (Hanwoo) is getting worse.

Nodal Transport Methods Using the Simplified Even-Parity Neutron Transport Equation (단순 우성 중성자 수송방정식을 이용한 노달 수송해법)

  • Noh, Taewan
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.16 no.2
    • /
    • pp.211-221
    • /
    • 2018
  • Nodal transport methods are proposed for solving the simplified even-parity neutron transport (SEP) equation. These new methods are attributed to the success of existing nodal diffusion methods such as the Polynomial Expansion Nodal and the Analytic Function Expansion Nodal Methods, which are known to be very effective for solving the neutron diffusion equation. Numerical results show that the simplified even-parity transport equation is a valid approximation to the transport equation and that the two nodal methods developed in this study also work for the SEP transport equation, without conflict. Since accuracy of methods is easily increased by adding node unknowns, the proposed methods will be effective for coarse mesh calculation and this will also lead to computation efficiency.

Voice and Image: A Pilot Study (음성과 인상의 관계규명을 위한 실험적 연구)

  • Moon Seung-Jae
    • MALSORI
    • /
    • no.35_36
    • /
    • pp.37-48
    • /
    • 1998
  • When we hear someone's voice, even without having met the person before, we usually make up a certain mental image of the person. This study aims at investigating the relationship between the voice and the image information carried within the voice. Does the mental picture created by the voice closely reflect the real image and if not, is it related with the real image at all\ulcorner To answer the first question, a perception experiment was carried out. Speech samples reading a short sentence from 8 males and 8 females were recorded and pictures of subjects were also taken. Ajou University students were asked to participate in the experiment to match the voice with the corresponding picture. Participants in the experiment correctly match 1 female voice and 4 male voices with their corresponding pictures. However, it is interesting to note that even in cases of mismatch, the results show that there is a very strong tendency. In other words, even though participants falsely match a certain voice with a certain picture, majority of them chose the same picture for the voice. It is the case for all mismatches. It seems that voice does give the listener a certain impression about physical characteristics even if it might not be always correct. By showing that there is a clear relationship between voice and image, this study provides a starting point for further research on voice characteristics: what characteristics of the voice carry the relevant information\ulcorner This kind of study will contribute toward the understanding of the affective domain of human voice and toward the speech technology.

  • PDF

A Corpus-Based Analysis of Crosslinguistic Influence on the Acquisition of Concessive Conditionals in L2 English

  • Newbery-Payton, Laurence
    • Asia Pacific Journal of Corpus Research
    • /
    • v.3 no.1
    • /
    • pp.35-49
    • /
    • 2022
  • This study examines crosslinguistic influence on the use of concessive conditionals by Japanese EFL learners. Contrastive analysis suggests that Japanese native speakers may overuse the concessive conditional even if due to partial similarities to Japanese concessive conditionals, whose formal and semantic restrictions are fewer than those of English concessive conditionals. This hypothesis is tested using data from the written module of the International Corpus Network of Asian Learners of English (ICNALE). Comparison of Japanese native speakers with English native speakers and Chinese native speakers reveals the following trends. First, Japanese native speakers tend to overuse concessive conditionals compared to native speakers, while similar overuse is not observed in Chinese native speaker data. Second, non-nativelike uses of even if appear in contexts allowing the use of concessive conditionals in Japanese. Third, while overuse and infelicitous use of even if is observed at all proficiency levels, formal errors are restricted to learners at lower proficiency levels. These findings suggest that crosslinguistic influence does occur in the use of concessive conditionals, and that its particular realization is affected by L2 proficiency, with formal crosslinguistic influence mediated at an earlier stage than semantic cross-linguistic influence.

Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed (이븐 연결망 Ed의 에지 중복 없는 스패닝 트리를 구성하는 알고리즘)

  • Kim, Jong-Seok;Kim, Sung-Won
    • The KIPS Transactions:PartA
    • /
    • v.17A no.3
    • /
    • pp.113-120
    • /
    • 2010
  • Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.