Constructing a Canonical form of a Matrix in Several Problems about Combinatorial Designs

Partially supported by the Bulgarian Science Fund contract with TU Varna, No 487.

A Method for Classification of Doubly Resolvable Designs and Its Application

This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010.

Further results on strongbox secured secret sharing schemes

We extend our earlier work on ways in which defining sets of combinatorial designs can be used to create secret sharing schemes. We give an algorithm for classifying defining sets or designs according to their security properties and summarise the results of this algorithm for many small designs. Finally, we discuss briefly how defining sets can be applied to variations of the basic secret sharing scheme.

What is Q-extension?

In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.

Analysis of key predistribution schemes in wireless sensor networks

Combinatorial designs are used for designing key predistribution schemes that are applied to wireless sensor networks in communications. This helps in building a secure channel. Private-key cryptography helps to determine a common key between a pair of nodes in sensor networks. Wireless sensor networks using key predistribution schemes have many useful applications in military and civil operations. When designs are efficiently implemented on sensor networks, blocks with unique keys will be the result. One such implementation is a transversal design which follows the principle of simple key establishment. Analysis of designs and modeling the key schemes are the subjects of this project.

On the construction of nearest neighbour balanced row-column designs

Nearest–neighbour balance is considered a desirable property for an experiment to possess in situations where experimental units are influenced by their neighbours. This paper introduces a measure of the degree of nearest–neighbour balance of a design. The measure is used in an algorithm which generates nearest–neighbour balanced designs and is readily modified to obtain designs with various types of nearest–neighbour balance. Nearest–neighbour balanced designs are produced for a wide class of parameter settings, and in particular for those settings for which such designs cannot be found by existing direct combinatorial methods. In addition, designs with unequal row and column sizes, and designs with border plots are constructed using the approach presented here.

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.

An application of combinatorial optimization in the printing industry

Offset printing is a common method to produce large amounts of printed matter. We consider a real-world offset printing process that is used to imprint customer-specific designs on napkin pouches. The print- ing technology used yields a number of specific constraints. The planning problem consists of allocating designs to printing-plate slots such that the given customer demand for each design is fulfilled, all technologi- cal and organizational constraints are met and the total overproduction and setup costs are minimized. We formulate this planning problem as a mixed-binary linear program, and we develop a multi-pass matching-based savings heuristic. We report computational results for a set of problem instances devised from real-world data.

Distance Distributions and Energy of Designs in Hamming Spaces

We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.

Assessment Of Robustness On Analysis Using Headspace Solid-phase Microextraction And Comprehensive Two-dimensional Gas Chromatography Through Experimental Designs.

Plackett-Burman experimental design was applied for the robustness assessment of GC×GC-qMS (Comprehensive Two-Dimensional Gas Chromatography with Fast Quadrupolar Mass Spectrometric Detection) in quantitative and qualitative analysis of volatiles compounds from chocolate samples isolated by headspace solid-phase microextraction (HS-SPME). The influence of small changes around the nominal level of six factors deemed as important on peak areas (carrier gas flow rate, modulation period, temperature of ionic source, MS photomultiplier power, injector temperature and interface temperature) and of four factors considered as potentially influential on spectral quality (minimum and maximum limits of the scanned mass ranges, ions source temperature and photomultiplier power). The analytes selected for the study were 2,3,5-trimethylpyrazine, 2-octanone, octanal, 2-pentyl-furan, 2,3,5,6-tetramethylpyrazine, and 2-nonanone e nonanal. The factors pointed out as important on the robustness of the system were photomultiplier power for quantitative analysis and lower limit of mass scanning range for qualitative analysis.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.

Effect of different ferrule designs on the fracture resistance and failure pattern of endodontically treated teeth restored with fiber posts and all-ceramic crowns

OBJECTIVE: This study investigated the effect of different ferrule heights on endodontically treated premolars. MATERIAL AND METHODS: Fifty sound mandibular first premolars were endodontically treated and then restored with 7-mm fiber post (FRC Postec Plus #1 Ivoclar-Vivadent) luted with self-polymerized resin cement (Multilink, Ivoclar Vivadent) while the coronal section was restored with hybrid composite core build-up material (Tetric Ceram, Ivoclar-Vivadent), which received all-ceramic crown. Different ferrule heights were investigated: 1-mm circumferential ferrule without post and core (group 1 used as control), a circumferential 1-mm ferrule (group 2), non-uniform ferrule 2-mm buccally and 1-mm lingually (group 3), non-uniform ferrule 3-mm buccally and 2-mm lingually (group 4), and finally no ferrule preparation (group 5). The fracture load and failure pattern of the tested groups were investigated by applying axial load to the ceramic crowns (n=10). Data were analyzed statistically by one-way ANOVA and Tukey's post-hoc test was used for pair-wise comparisons (α=0.05). RESULTS: There were no significant differences among the failure load of all tested groups (P<0.780). The control group had the lowest fracture resistance (891.43±202.22 N) and the highest catastrophic failure rate (P<0.05). Compared to the control group, the use of fiber post reduced the percentage of catastrophic failure while increasing the ferrule height did not influence the fracture resistance of the restored specimens. CONCLUSIONS: Within the limitations of this study, increasing the ferrule length did not influence the fracture resistance of endodontically treated teeth restored with glass ceramic crowns. Insertion of a fiber post could reduce the percentage of catastrophic failure of these restorations under function.

Influence of separate and mixed experimental designs on reaction times to two simple visual stimuli

Testing contexts have been shown to critically influence experimental results in psychophysical studies. One of these contexts that show important modulation of the behavioral effects of different stimulatory conditions is the separate (blocked) or mixed presentation of these stimulatory conditions. The study presents evidence that the apparent discriminabilities of two target stimuli can change according to which of these two testing contexts is used. A cross inside a ring and a vertical line inside a ring were presented as go stimuli in a go/no-go reaction time task. In one experiment, each of these stimuli was presented to a different group of volunteers and in another experiment they were presented to the same group of volunteers, randomly mixed in the blocks of trials. Similar reaction times were obtained for the two stimuli in the first experiment, and different reaction times (faster for the cross) in the second experiment. The latter result indicates that the two stimuli have different discriminabilities from the no-go stimulus; the cross having greater discriminability. This difference is however masked, presumably by the adoption of specific compensatory attentional sets, in a separate testing context.

Social interaction as a heuristic for combinatorial optimization problems

We investigate the performance of a variant of Axelrod's model for dissemination of culture-the Adaptive Culture Heuristic (ACH)-on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents' strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N(1/4) so that the number of agents must increase with the fourth power of the problem size, N proportional to F(4), to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F(6) which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

Experimental investigation on adaptive robust controller designs applied to a free-floating space manipulator

This paper aims to formulate and investigate the application of various nonlinear H(infinity) control methods to a fiee-floating space manipulator subject to parametric uncertainties and external disturbances. From a tutorial perspective, a model-based approach and adaptive procedures based on linear parametrization, neural networks and fuzzy systems are covered by this work. A comparative study is conducted based on experimental implementations performed with an actual underactuated fixed-base planar manipulator which is, following the DEM concept, dynamically equivalent to a free-floating space manipulator. (C) 2011 Elsevier Ltd. All rights reserved.