Log in

Relevant bibliographies by topics / Balanced Incomplete Block Design

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Balanced Incomplete Block Design'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Balanced Incomplete Block Design.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Balanced Incomplete Block Design"

1

Ghosh, D. K., and K. S. Joshi. "Construction of Variance Balanced Designs through Triangular PBIB Designs." Calcutta Statistical Association Bulletin 45, no. 1-2 (March 1995): 111–18. http://dx.doi.org/10.1177/0008068319950107.

Full text

Abstract:

Several authors have obtained variance balanced (VB) and ternary variance balanced ( V B) designs using balanced incomplete block (BIB) designs and group divisible (GD) designs. In the present investigation, another systematic methods have been developed for the construction of VB designs using A Triangular PBIB design and an incomplete block design where the blocks of the incomplete block design are formed by taking the second associate treatments of the given triangular PBIB design. Two Triangular PBIB designs. The methods of construction of VB designs are further illustrated by examples.

APA, Harvard, Vancouver, ISO, and other styles

2

Breach, D. R., and Anne Penfold Street. "Irreducible designs from supplementary difference sets." Bulletin of the Australian Mathematical Society 31, no. 1 (February 1985): 105–15. http://dx.doi.org/10.1017/s0004972700002318.

Full text

Abstract:

A family of n k-subsets of the integers modulo ν are said to be supplementary difference sets if developing them by addition modulo ν leads to a balanced incomplete block design, and to be minimal if no proper subfamily leads to a balanced incomplete block design when developed modulo ν. In other words, the family of supplementary difference sets is minimal precisely when it leads to a balanced incomplete block design which cannot be partitioned into a union of proper subdesigns, each consisting of complete cyclic sets of ν blocks. We discuss the conditions under which such a balanced incomplete block design can be partitioned in some non-cyclic fashion into a union of proper subdesigns.

APA, Harvard, Vancouver, ISO, and other styles

3

Jhee, Yoon Kyoo. "Spectral Efficiency 0f Symmetric Balance Incomplete Block Design Codes." Journal of the Institute of Electronics and Information Engineers 50, no. 1 (January 25, 2013): 117–23. http://dx.doi.org/10.5573/ieek.2013.50.1.117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lal, Kishan, Rajender Prasad, and V. K. Gupta. "Trend‐Free Nested Balanced Incomplete Block Designs and Designs for Diallel Cross Experiments." Calcutta Statistical Association Bulletin 59, no. 3-4 (September 2007): 203–21. http://dx.doi.org/10.1177/0008068320070306.

Full text

Abstract:

Abstract: Nested balanced incomplete block (NBIB) designs are useful when the experiments are conducted to deal with experimental situations when one nuisance factor is nested within the blocking factor. Similar to block designs, trend may exist in experimental units within sub‐blocks or within blocks in NBIB designs over time or space. A necessary and sufficient condition, for a nested block design to be trend‐free at sub‐block level, is derived. Families and catalogues of NBIB designs that can be converted into trend‐free NBIB designs at sub‐block and block levels have been obtained. A NBIB design with sub‐block size 2 has a one to one correspondence with designs for diallel crosses experiments. Therefore, optimal block designs for dialled cross experiments have been identified to check if these can be converted in to trend‐free optimal block designs for diallel cross experiments. A catalogue of such designs is also obtained. Trend‐free design is illustrated with example for a NBIB design and a design for diallel crosses experiments. AMS (2000) Subject Classification: 62K05, 62K10.

APA, Harvard, Vancouver, ISO, and other styles

5

Goud, T. Shekar, and N. Ch Bhatra Charyulu. "Variance balanced incomplete block designs." Bulletin of Pure & Applied Sciences- Mathematics and Statistics 37e, no. 2 (2018): 286. http://dx.doi.org/10.5958/2320-3226.2018.00031.0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Morgan, J. P., D. A. Preece, and D. H. Rees. "Nested balanced incomplete block designs." Discrete Mathematics 231, no. 1-3 (March 2001): 351–89. http://dx.doi.org/10.1016/s0012-365x(00)00332-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Whiteman, A. L. "Some balanced incomplete block designs." Computers & Mathematics with Applications 39, no. 11 (June 2000): 117–19. http://dx.doi.org/10.1016/s0898-1221(00)00116-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dauran, N. S., A. B. Odeyale, and A. Shehu. "CONSTRUCTION AND ANALYSIS OF BALANCED INCOMPLETE SUDOKU SQUARE DESIGN." FUDMA JOURNAL OF SCIENCES 4, no. 2 (July 2, 2020): 290–99. http://dx.doi.org/10.33003/fjs-2020-0402-219.

Full text

Abstract:

Sudoku squares have been widely used to design an experiment where each treatment occurs exactly once in each row, column or sub-block. For some experiments, the size of row (or column or sub-block) may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Sudoku squares design (BISSD) is proposed. A general method for constructing BISSD is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Sudoku designs. The relative efficiencies of a delete-one-transversal balance incomplete Latin Square (BILS) design with respect to Sudoku design are derived. In addition, linear model, numerical examples and procedure for the analysis of data for BISSD are proposed

APA, Harvard, Vancouver, ISO, and other styles

9

R. Rink, David. "Balanced incomplete block designs: selected business-related applications and usage caveats." Innovative Marketing 12, no. 1 (April 27, 2016): 15–28. http://dx.doi.org/10.21511/im.12(1).2016.02.

Full text

Abstract:

Whenever respondents must rank-order a large number of items and/or the reliability of their rankings may be questionable, balanced incomplete block designs (BIBDs) represent a more effective means for doing so than either complete rankings or paired comparisons for business and marketing researchers. By providing a type of balancing and replication across items and respondents, BIBDs significantly reduce the number of subjective evaluations each individual must make. But, at the same time, BIBDs allow a limited number of respondents as a group to rank many items. This balancing and replication in BIBDs also reduces standard deviation, which increases the precision of a study. BIBDs, therefore, can improve response rates as well as increase the accuracy and reliability of the data collected. After discussing the general nature of BIBDs and statistical techniques for analyzing preference data collected by BIBDs, three business-related applications are presented to illustrate the benefits of BIBDs. Next, caveats concerning the use of BIBDs are presented. In the last section, advantages of BIBDs are discussed

APA, Harvard, Vancouver, ISO, and other styles

10

Colburn, Wayne A. "Balanced Incomplete-Block Design: Its Use and Misuse." Journal of Pharmaceutical Sciences 74, no. 7 (July 1985): 795. http://dx.doi.org/10.1002/jps.2600740725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Balanced Incomplete Block Design"

1

Boothroyd, Derek Brian. "On some properties of balanced incomplete block designs." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61935.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jesso, Andrew Thomas. "The hamiltonicity of block-intersection graphs of balanced incomplete block designs/." Internet access available to MUN users only. Search for this title in:, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Osafo, Mamfe. "Nonparametric Test for Nondecreasing Order Alternatives in Randomized Complete Block and Balanced Incomplete Block Mixed Design." Diss., North Dakota State University, 2020. https://hdl.handle.net/10365/31936.

Full text

Abstract:

Nonparametric tests are used to test hypotheses when the data at hand violate one or more of the assumptions for parametric tests procedures. The test is an ordered alternative (nondecreasing) when there is prior information about the data. It assumes that the underlying distributions are of the same type and therefore differ in location. For example, in dose-response studies, animals are assigned to k groups corresponding to k doses of an experimental drug. The effect of the drug on the animals is likely to increase or decrease with increasing doses. In this case, the ordered alternative is appropriate for the study. In this paper, we propose eight new nonparametric tests useful for testing against nondecreasing order alternatives for a mixed design involving randomized complete block and balanced incomplete block design. These tests involve various modifications of the Jonckheere-Terpstra test (Jonckheere(1952), Terpstra(1954)) and Alvo and Cabilio’s test (1995). Three, four and five treatments were considered with different location parameters under different scenarios. For three and four treatments, 6,12, and 18 blocks were used for the simulation, while 10, 20, and 30 blocks were used for five treatments. Different tests performed best under different block combinations, but overall the standardized last for Alvo outperformed the other test when the number of treatments and number of missing observations per block increases. A simulation study was conducted comparing the powers of the various modification of Jonckheere-Terpstra (Jonckheere(1952), Terpstra(1954)) and Alvo and Cabilio’s (1995) tests under different scenarios. Recommendations are made.

APA, Harvard, Vancouver, ISO, and other styles

4

Wells, Andrew. "Quasi-cyclic LDPC codes based on balanced incomplete block designs." Thesis, Lancaster University, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.587502.

Full text

Abstract:

The ever-increasing demand and requirements of communication systems necessitates research into advanced techniques to ensure reliable and optimum use of communication resources such as bandwidth. Channel characteristics such as noise, erasures and fading have a destructive effect on the transmission requiring novel approaches to obtain a reliable reconstruction at the receiver. In this thesis, we investigate error protection using linear block codes for Gaussian noise, erasure and fading channels. In the design of an error protection system, we focus on a class of near Shannon-limit approaching codes called Low-Density Parity-Check (LDPC) codes. The work presents and investigates a method of constructing LDPC codes using combinatorial mathematics known as Balanced Incomplete Block Designs (BIBD). Two classes of BIBDs are used to create new construction methods for generating quasi- cyclic (QC) LDPC matrices. The method of constructing QC-LDPC codes using BIBDs introduced offer flexible matrices while preserving the QC structure whilst ensuring efficient and low complexity encoding using linear shift registers. The structure provides similar performance to that of MacKay codes over the Gaussian channel, whilst also showing very good performance over both the random and burst erasure channels. The construction of QC-LDPC codes using BIBDs methods also result in codes with fast decoding convergence and low error floors. The introduced QC-BIBD-LDPC codes are applied to the power-line environment, which inhibits both frequency-selective fading and severe noise characteristics. The effects of the frequency-selective fading of the channel are reduced-using a Multi-carrier- Modulation (MCM) technique known as Orthogonal Frequency Division Multiplexing (OFDM). This MCM improves the operating performance of the system by effectively creating a flat fading environment. With the presence of impulsive noise present in power-line communications, this work introduces a combination of recursive filtering in conjunction with>tht QC-BIBD-LDPC coding to mitigate its effects. To implement the sum-product algorithm (SPA) for decoding Low-Density Parity-Check (LDPC) codes in a power-line communications channel impaired by highly impulsive noise, it is essential to find the right channel probability distribution to optimize the algorithm. However, the computational complexity of the reliability factor is very high. This research proposes the use of a Kalman filter to help cancel out the degradation effect of impulsive noise and consequently approximate the output of the filter as a normal random variable. It is shown that LDPC-coded OFDM system in conjunction with Kalman filtering offers an efficient alternative solution to compensate for the disturbances caused by impulsive noise. Simulation results are provided to demonstrate the performance with the Kalman filter; it is shown that a gain of 15dB is achievable over a system equipped with a channellimiter. The performance evaluation of error-control codes for research and development purposes using software implementation can be a timely and complex process due to computational complex algorithms. Simulating codes to very low BitIBlock error rates is a computationally intense operation, but it is shown that many aspects of simulating LDPC codes are perfect for parallel computation. The speed and accuracy of the QC-LDPC simulations can be greatly increased by utilising the parallel architecture of graphics processing units (GPUs) from conventional "central processing" using CPUs. It is shown that simulating the QC-BIBD-LDPC codes in chapter 3 using Graphics Processing Units simulation speed-ups are achievable when compared to equivalent implementations using central processing units (CPUs). These speedups are related to an increase in simulation complexity, with speedups increasing with an increase in block-size, number of Sum- Product Algorithm (SPA) iterations and number of codewords decoded in parallel.

APA, Harvard, Vancouver, ISO, and other styles

5

Modisett, Matthew Clayton. "A characterization of the circularity of certain balanced incomplete block designs." Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184393.

Full text

Abstract:

When defining a structure to fulfill a set of axioms that are similar to those prescribed by Euclid, one must select a set of points and then define what is meant by a line and what is meant by a circle. When properly defined these labels will have properties which are similar to their counterparts in the (complex) plane, the lines and circles which Euclid undoubtedly had in mind. In this manner, the geometer may employ his intuition from the complex plane to prove theorems about other systems. Most "finite geometries" have clearly defined notions of points and lines but fail to define circles. The two notable exceptions are the circles in a finite affine plane and the circles in a Mobius plane. Using the geometry of Euclid as motivation, we strive to develop structures with both lines and circles. The only successful example other than the complex plane is the affine plane over a finite field, where all of Euclid's geometry holds except for any assertions involving order or continuity. To complement the prolific work concerning finite geometries and their lines, we provide a general definition of a circle, or more correctly, of a collection of circles and present some preliminary results concerning the construction of such structures. Our definition includes the circles of an affine plane over a finite field and the circles in a Mobius plane as special cases. We develop a necessary and sufficient condition for circularity, present computational techniques for determining circularity and give varying constructions. We devote a chapter to the use of circular designs in coding theory. It is proven that these structures are not useful in the theory of error-correcting codes, since more efficient codes are known, for example the Reed-Muller codes. However, the theory developed in the earlier chapters does have applications to Cryptology. We present five encryption methods utilizing circular structures.

APA, Harvard, Vancouver, ISO, and other styles

6

Hemmer, Michael Toshiro. "Nonparametric Test for the Umbrella Alternative in a Randomized Complete Block and Balanced Incomplete Block Mixed Design." Thesis, North Dakota State University, 2012. https://hdl.handle.net/10365/26696.

Full text

Abstract:

Nonparametric tests have served as robust alternatives to traditional statistical tests with rigid underlying assumptions. If a researcher expects the treatment effects to follow an umbrella alternative, then the test developed in this research will be applicable in the Balanced Incomplete Block Design (Hemmer’s test). It is hypothesized that Hemmer’s test will prove to be more powerful than the Durbin test when the umbrella alternative is true. A mixed design consisting of a Balanced Incomplete Block Design and a Randomized Complete Block Design will also be considered, where two additional test statistics are developed for the umbrella alternative. Monte Carlo simulation studies were conducted using SAS to estimate powers. Various underlying distributions were used with 3, 4, and 5 treatments, and a variety of peaks and mean parameter values. For the mixed design, different ratios of complete to incomplete blocks were considered. Recommendations are given.

APA, Harvard, Vancouver, ISO, and other styles

7

Bilous, Richard T. "The point code of a (22, 33, 12, 8, 4)-balanced incomplete block design." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq62627.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nilson, Tomas. "Some matters of great balance." Doctoral thesis, Mittuniversitetet, Avdelningen för ämnesdidaktik och matematik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-18757.

Full text

Abstract:

This thesis is based on four papers dealing with two different areas of mathematics.Paper I–III are in combinatorics, while Paper IV is in mathematical physics.In combinatorics, we work with design theory, one of whose applications aredesigning statistical experiments. Specifically, we are interested in symmetric incompleteblock designs (SBIBDs) and triple arrays and also the relationship betweenthese two types of designs.In Paper I, we investigate when a triple array can be balanced for intersectionwhich in the canonical case is equivalent to the inner design of the correspondingsymmetric balanced incomplete block design (SBIBD) being balanced. For this we derivenew existence criteria, and in particular we prove that the residual designof the related SBIBD must be quasi-symmetric, and give necessary and sufficientconditions on the intersection numbers. We also address the question of whenthe inner design is balanced with respect to every block of the SBIBD. We showthat such SBIBDs must possess the quasi-3 property, and we answer the existencequestion for all know classes of these designs.As triple arrays balanced for intersections seem to be very rare, it is natural toask if there are any other families of row-column designs with this property. In PaperII we give necessary and sufficient conditions for balanced grids to be balancedfor intersection and prove that all designs in an infinite family of binary pseudo-Youden designs are balanced for intersection.Existence of triple arrays is an open question. There is one construction of aninfinite, but special family called Paley triple arrays, and one general method forwhich one of the steps is unproved. In Paper III we investigate a third constructionmethod starting from Youden squares. This method was suggested in the literaturea long time ago, but was proven not to work by a counterexample. We show interalia that Youden squares from projective planes can never give a triple array bythis method, but that for every triple array corresponding to a biplane, there is asuitable Youden square for which the method works. Also, we construct the familyof Paley triple arrays by this method.In mathematical physics we work with solitons, which in nature can be seen asself-reinforcing waves acting like particles, and in mathematics as solutions of certainnon-linear differential equations. In Paper IV we study the non-commutativeversion of the two-dimensional Toda lattice for which we construct a family ofsolutions, and derive explicit solution formulas.
Denna avhandling baseras på fyra artiklar som behandlar två olika områden avmatematiken. Artikel I-III ligger inom kombinatoriken medan artikel IV behandlarmatematisk fysik.Inom kombinatoriken arbetar vi med designteori som bland annat har tillämpningardå man ska utforma statistiska experiment.I artikel I undersöker vi när en triple array kan vara snittbalanserad vilket i detkanoniska fallet är ekvivalent med den inre designen till den korresponderandesymmetriska balanserade inkompletta blockdesignen (SBIBD) är balanserad. För dettapresenterar vi nya nödvändiga villkor. Speciellt visar vi att den residuala designentill den korresponderande SBIBDen måste vara kvasi-symmetrisk och ger nödvändigaoch tillräckliga villkor för dess blockskärningstal. Vi adresserar ocksåfrågan om när den inre designen är balanserad med avseende på alla SBIBDensblock. Vi visar att en sådan SBIBD måste ha den egenskap som kallas kvasi-3 ochsvarar på existensfrågan för alla kända klasser av sådana designer.Eftersom snittbalanserade triple arrays verkar vara väldigt sällsynta är detnaturligt att fråga om det finns andra familjer av rad-kolumn designer som hardenna egenskap. I artikel II ger vi nödvändiga och tillräckliga villkor för att enbalanced grid ska vara snittbalanserad och visar att alla designer i en oändlig familjav binära pseudo-Youden squares är snittbalanserade.Existensfrågan för triple arrays är öppen fråga. Det finns en konstruktionsmetodför en oändlig men speciell familj kallad Paley triple arrays och så finns det enallmän metod för vilken ett steg är obevisat. I artikel III undersöker vi en tredjekonstruktionsmetod som utgår från Youden squares. Denna metod föreslogs i litteraturenför länge sedan men blev motbevisad med hjälp av ett motexempel. Vivisar bland annat att Youden squares från projektiva plan aldrig kan ge en triplearray med denna metod, men att det för varje triple array som korresponderartill ett biplan, så finns det en lämplig Youden square för vilken metoden fungerar.Vidare konstruerar vi familjen av Paley triple arrays med denna metod.Inom matematisk fysik arbetar vi med solitoner som man i naturen kan få sesom självförstärkande vågor vilka beter sig som partiklar. Inom matematiken ärde lösningar till vissa ickelinjära differentialekvationer. I artikel IV studerar vi dettvådimensionella Toda-gittret för vilken vi konstruerar en familj av lösningar ochäven explicita lösningsformler.

APA, Harvard, Vancouver, ISO, and other styles

9

Montgomery, Aaron. "Topics in Random Walks." Thesis, University of Oregon, 2013. http://hdl.handle.net/1794/13335.

Full text

Abstract:

We study a family of random walks defined on certain Euclidean lattices that are related to incidence matrices of balanced incomplete block designs. We estimate the return probability of these random walks and use it to determine the asymptotics of the number of balanced incomplete block design matrices. We also consider the problem of collisions of independent simple random walks on graphs. We prove some new results in the collision problem, improve some existing ones, and provide counterexamples to illustrate the complexity of the problem.

APA, Harvard, Vancouver, ISO, and other styles

10

Khattak, Azizullah. "Design of balanced incomplete factorial experiments." Thesis, University of Leeds, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Balanced Incomplete Block Design"

1

Cyclic designs. London: Chapman and Hall, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cuzick, Jack. Preventive Therapy. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190238667.003.0068.

Full text

Abstract:

Compared to cardiovascular medicine, where preventive treatments have long been firmly established, the development of therapies to prevent cancer is still in its infancy. Cancers are more heterogeneous and biologically complex than cardiovascular diseases, and it is challenging to identify agents that selectively block neoplastic progression in one organ without producing countervailing toxicity elsewhere. Causal pathways are less well understood for cancer than for heart disease; thus it is not surprising that the incomplete mechanistic understanding of carcinogenic pathways has yielded candidate treatments with mixed results. The balance of risks and benefits is also inherently more precarious for preventive than for therapeutic interventions. All of the patients treated therapeutically already have the disease for which the treatment is designed and can experience benefits as well as harms. This chapter discusses selected pharmacologic agents that have proven to be of value or show some promise as potential anti-cancer drugs.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Balanced Incomplete Block Design"

1

Das, Premadhis, Ganesh Dutta, Nripes Kumar Mandal, and Bikas Kumar Sinha. "OCDs in Balanced Incomplete Block Design Set-Up." In Optimal Covariate Designs, 41–63. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2461-7_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cheng, Ching-Shui. "Optimal Properties of Balanced Incomplete Block and Other Designs." In Coding Theory and Design Theory, 54–64. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4615-6654-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Das, Premadhis, Ganesh Dutta, Nripes Kumar Mandal, and Bikas Kumar Sinha. "OCDs in Balanced Treatment Incomplete Block Design Set-Up." In Optimal Covariate Designs, 113–30. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2461-7_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Rodríguez Rueda, David, Carlos Cotta, and Antonio J. Fernández. "Finding Balanced Incomplete Block Designs with Metaheuristics." In Evolutionary Computation in Combinatorial Optimization, 156–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01009-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Prestwich, Steven. "A Local Search Algorithm for Balanced Incomplete Block Designs." In Lecture Notes in Computer Science, 132–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36607-5_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Okbin, Sangho Lee, Seongyeol Kim, and Ilyong Chung. "An Efficient Load Balancing Algorithm Employing a Symmetric Balanced Incomplete Block Design." In Lecture Notes in Computer Science, 147–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44860-8_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cho, Youngjoo, Changkyun Chi, and Ilyong Chung. "An Efficient Conference Key Distribution System Based on Symmetric Balanced Incomplete Block Design." In Computational Science and Its Applications – ICCSA 2004, 647–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24768-5_69.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Büyükkurt, B. Kemal, and Meral Demirbağ Büyükkurt. "Reducing Questionnaire Length by Incidence Sampling: Balanced Incomplete Block Designs Versus Random Sampling of Questions." In Developments in Marketing Science: Proceedings of the Academy of Marketing Science, 655. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17323-8_140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Madsen, Anders L., Frank Jensen, Antonio Salmerón, Martin Karlsen, Helge Langseth, and Thomas D. Nielsen. "A New Method for Vertical Parallelisation of TAN Learning Based on Balanced Incomplete Block Designs." In Probabilistic Graphical Models, 302–17. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11433-0_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, Ju-Hyun, Sungkwon Kang, and Hoo-Kyun Choi. "A Fast Construction Algorithm for the Incidence Matrices of a Class of Symmetric Balanced Incomplete Block Designs." In Computational Science and Its Applications – ICCSA 2004, 11–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24768-5_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Balanced Incomplete Block Design"

1

Noshad, Mohammad, and Maite Brandt-Pearce. "Coded QPSK using balanced incomplete block design." In 2012 46th Asilomar Conference on Signals, Systems and Computers. IEEE, 2012. http://dx.doi.org/10.1109/acssc.2012.6488987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yang, Zhi-Fang, Po-Chen Lee, Wei-Hung Chen, and Jia-Guu Leu. "Enlargement of Balanced-Incomplete-Block-Designs-Based Watermarks." In 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). IEEE, 2009. http://dx.doi.org/10.1109/iih-msp.2009.254.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Zhi-Fang, and Mong-Shu Wu. "Robustness of Structure-Based Watermark by Using Balanced Incomplete Block Designs." In 2008 Eighth International Conference on Intelligent Systems Design and Applications (ISDA). IEEE, 2008. http://dx.doi.org/10.1109/isda.2008.169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Seol, Jae-min, and Seong-whan Kim. "Efficient Collision-Resilient RFID Tag Identification using Balanced Incomplete Block Design Code." In The Sixth IEEE International Conference on Computer and Information Technology. IEEE, 2006. http://dx.doi.org/10.1109/cit.2006.87.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Noshad, Mohammad, and Maite Brandt-Pearce. "Multilevel pulse-position modulation based on balanced incomplete block designs." In GLOBECOM 2012 - 2012 IEEE Global Communications Conference. IEEE, 2012. http://dx.doi.org/10.1109/glocom.2012.6503562.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Patil, Siddarama R., and Sant S. Pathak. "Construction of irregular LDPC codes based on Balanced Incomplete Block Designs." In 2007 International Conference on Industrial and Information Systems. IEEE, 2007. http://dx.doi.org/10.1109/iciinfs.2007.4579179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Sheng-Mei, Xiu-Li Zhu, Feng Gao, and Yan Zhu. "An Improved Quantum LDPC Codes Construction Based on Balanced Incomplete Block Designs." In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2010. http://dx.doi.org/10.1109/wicom.2010.5600960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bai Xiang and Mao Yu-Ming. "Balanced Incomplete Block Designs based scheduling scheme for multi-hop ad hoc networks." In 2008 International Conference on Communications, Circuits and Systems (ICCCAS). IEEE, 2008. http://dx.doi.org/10.1109/icccas.2008.4657799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

"USING A TWO-WAY BALANCED INCOMPLETE BLOCK DESIGN TO COMPARING AN AGENT-ORIENTED SOFTWARE ENGINEERING METHODOLOGIES." In 2th International Conference on Evaluation of Novel Approaches to Software Engineering. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002585200560065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ravi Kumar, M., S. S. Pathaky, and N. B. Chakrabarti. "A new multi wavelength — Optical Code Division Multiple Access code design based on Balanced Incomplete Block Design." In 2007 International Conference on Industrial and Information Systems. IEEE, 2007. http://dx.doi.org/10.1109/iciinfs.2007.4579167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Balanced Incomplete Block Design"

1

Foody, W., and A. Hedayat. Supports of BIB (Balanced Incomplete Block) Designs - An Algebraic and Graphical Study. Fort Belvoir, VA: Defense Technical Information Center, March 1986. http://dx.doi.org/10.21236/ada172029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Amzeri, Achmad, Kaswan Badami, and Gita Pawana. Inheritance of resistance to downy mildew (Peronosclerospora maydis) in crossing of Madura Maize Plant (Zea mays L.). Innovative Scientific Information & Services Network, May 2019. http://dx.doi.org/10.21107/amzeri.2019.1.

Full text

Abstract:

Hybridization of Back cross is one method to get varieties that are resistant to downy mildew. The purpose of this study was to obtain information on inheritance characteristics of downy mildew resistance. This research was conducted at the experiment center of Agro-Technology Study Program of Agriculture Faculty, University of Trunojoyo Madura. Research of Assessment of resistance to Downy Mildew used a randomized block design with 18 treatments (P1, P2, F1, F2, BC1P1 and BC1P2 in three sets of crosses, namely LGL x Mdr-3, T12 x Mdr-1 and E02 x Mdr-2) and three replications so there were 54 experimental units. Identification of polymorphic RAPD markers for endurance to downy mildew through Bulk Segregant Analysis (BSA) was done by amplifying the DNA in the resistant pool and susceptible pool. The random primers used were 120 primers from 6 operon groups, namely OPA, OPB, OPC, OPD, OPF and OPG. The results showed that the inheritance pattern of maize genetic resistance to downy mildew followed a segregation pattern of 3:1 with a degree of dominance between -1 and 0, and was controlled by incomplete partially negative dominant gene. OPC-07 was a marker that was linkage close to the resistance to downy mildew with a genetic distance of 1.9 cM.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!