• Journal of the East Asian Society of Dietary Life
• /
• v.1 no.3
• /
• pp.305-311
• /
• 1991

The study was designed to investigate overall acceptability of rice extrudate with added ginseng flour extruded by single screw extruder. Graphic three dimension analysis on response surface regression was conducted for overall acceptability evaluated by balanced incomplete block design. Overall acceptability, which formed a saddle point, increased as moisture content increased at lower die temperature, and as moisture content decreased at higher die temperature. Critical values of each variable which indicated optimum response are 5.0% ginseng content, 17.8% moisture content and 104.6$^{\circ}C$ die temperature, and optimum inferred score of overall acceptability is 59.6 and 90. Key words: extrdate, overall acceptability, response surface regression analysis, balanced incomplete block method.

• The Korean Journal of Applied Statistics
• /
• v.3 no.2
• /
• pp.55-77
• /
• 1990

In this paper we descuss some E-optimal block designs having unequal block sizes, and give a table of E-optimal designs with 2 different block sizes which can be constructed using the method described in Theorem 3. 2, Theorem 3. 4 and Theorem 3. 5 proved by Lee and Jacroux (1987). All of source designs used are Group Divisible designs which can be found in Clathworthy(1973) or Balanced Incomplete block designs in Raghavarar(1971).

• Journal of the Korean Statistical Society
• /
• v.3 no.2
• /
• pp.85-101
• /
• 1974

In a Balanced Factorial Experiments (BFE) with n factors $F_1, F_2,\cdots,F_n$ at $m_1, m_2,\cdots,m_n$ levels respectively, Shah [15] has considered the following association scheme: the two treatments are the $(P_1, P_2,\cdot,P_n)$th associates, where $p_i=1$ if the ith factor occurs at the same level in both treatments and $p_i=0$ otherwise; $\lambda_{(p_1,p_2,\cdots,p_n)}$ will denote the number of times these treatments occur together in a block. He has showed that a BFE is partially Blanced Incomplete Block(PBIB) design with repsect to the above association scheme. Kurjian and Zelan [6] have proved that factorial designs possessing a Property A (a particular structure for their matrix NN') are factorially balanced.

• The Korean Journal of Applied Statistics
• /
• v.12 no.1
• /
• pp.253-260
• /
• 1999

이어진 블록계획 중에서 대칭 균형된 불완비 블록계획(Symmetrical Balanced Incomplete Block Design : SBIBD)을 이용하여 n-ary를 블록 완전이면교배(Complete Diallel Cross : CDC)계획을 설계하였다. 처리 수와 반복 수가 고정된 경우, 이렇게 설계된 계획이 균형된 불완비 블록계획을 이용해서 설계한 계획들 중에서 가장 효율이 높은 계획임을 보인다.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.331-340
• /
• 2008

In order to make load balancing, workload information of nodes should be informed to the network. In a load balancing algorithm[13] based on the SBIBD(Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O (${\upsilon}{\sqrt{\upsilon}}$) traffic overhead, where ${\upsilon}$ is the number of nodes. It is very efficient but works well only when ${\upsilon}=p^2+p+1$ for a prime number p. In this paper, we generate a special incidence structure in order for the algorithm works well for an arbitrary number of nodes. In the experiment with w,($5{\leq}w{\leq}5,000$), nodes and more than 80% of receiving workload information, traffic overhead was less than O ($w{\sqrt{w}})$ and the result for standard deviation of traffic overhead showed that each node has largely balanced amount of traffic overhead.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.271-276
• /
• 2001

회의용 키분배 시스템은 회의용 키를 생성하여 키를 회의에 참석하고 있는 사람에게만 전달하여 서로간에 안전하게 통신하도록 한다. 본 논문에서는 Block Design의 한 분류인 symmetric balanced incomplete block design(SBIBD)를 적용한 효율적인 회의용 키분배시스템을 제안한다. 회의용 키를 생성하고 개인식별 정보를 근거로 하여 인증을 수행하는 통신 프로토콜이 설계된다. 제안된 프로토콜은 회의용 키를 생성하는 메시지의 복잡도를 최소화시키는데, SBIBD의 특별한 분류에서는 참석자의 수 v에 따라 메시지 복잡도는 O(v√v)가 된다. 보안시스템의 구현에서 중요한 요소인 프로토콜의 안전성은 factoring과 discrete logarithm을 계산할 정도로 난해하여 충분히 보장됨을 증명할 수 있다.

• Journal of Korean Society for Quality Management
• /
• v.44 no.4
• /
• pp.799-811
• /
• 2016

Purpose: The conjoint analyst in marketing are interested in detecting whether there exist synergy or antagonistic effects between two attributes. In the cases where attributes have two or three levels, we research on the design of survey questionnaire to estimate all the main effect and as many two factor interaction effects as possible. Methods: We consider the balanced incomplete block (BIB) mixed level factorial design $2^f{\times}3^g$ or fractional factorial design. To reduce the number of questions in a questionnaire, we propose the balanced incomplete block mixed level design with minimum aberration which is generated by implementing proc factex in SAS. Also, we propose using two or three level BIB factorial design instead of mixed level designs by transforming three level attributes into two attributes of two levels and two level attribute into three level attribute by using dummy level technique. Results: We propose three methods for designing survey questionnaire where the block and design generators are found with practical number of questions in a questionnaire. By analyzing all the respondents survey data generated by the simulation study, we find the proper model and do the concepts optimization. Conclusion: The proposed methods of designing survey questionnaires seem to perform well in the sense that the proper model, and then the optimal concept is found in a case study where all the respondents survey data are generated by the simulation study.

• The Korean Journal of Applied Statistics
• /
• v.27 no.2
• /
• pp.185-195
• /
• 2014

Ranking-based conjoint analysis is widely used in various fields such as marketing research. While the ranking-based conjoint affords several advantages over the rating-based or choice-based conjoint, it has a serious shortcoming that respondents have much difficulty in ranking the product profiles in order of preference when many profiles are involved. This article suggests a new method for the preference measurement to improve the response efficiency. The method employs the concept of ranking sets that let the respondent evaluate a small number of profiles at a time. Through the proposed method, preference rankings of profiles obtained from each ranking set are aggregated to generate overall rankings. The balanced incomplete block design is expanded and transformed to the dual design in order to construct well-balanced ranking sets that can accommodate a large number of profiles. The proposed method is applied to the analysis of consumer preferences for perfume-for-women.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.68-75
• /
• 2006

Multimedia fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. Differ from a symmetric/asymmetric scheme, fingerprinting schemes, only regular user can know the inserted fingerprint data and the scheme guarantee an anonymous before recontributed data. In this paper, we present a scheme which is the algorithm using LDPC(Low Density Parity Check) for detection of colluded multimedia fingerprint and correcting errors. This proposed scheme is consists of the LDPC block, Hopfield Network and the algorithm of anti-collusion code generation. Anti-collusion code based on BIBD(Balanced Incomplete Block Design) was made 100% collusion code detection rate about the linear collusion attack(average, AND and OR) and LD% block for the error bits correction confirmed that can correct error until AWGN 0dB.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.343-351
• /
• 2004

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requires $O(v^2)$ communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k ＋ 1, 1)-configured network applying a symmetric balanced incomplete block design, where $v\;=\;k^2$\;＋\;k\;＋\;1$. Our algorithm needs only $O(\sqrt[v]{v})$ communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.