Zobrazeno 1 - 10
of 262
pro vyhledávání: '"Bulutoglu A"'
Autor:
Augeri, Christopher James, Mullins, Barry E., Baird III, Leemon C., Bulutoglu, Dursun A., Baldwin, Rusty O.
Publikováno v:
Proceedings of the 2007 workshop on Experimental Computer Science (ExpCS) at ACM FCRC 2007
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We present an XML test corpus and a combined efficiency metric integrating
Externí odkaz:
http://arxiv.org/abs/2410.07603
We describe how previously known methods for determining the number of decimation classes of density $\delta$ binary vectors can be extended to nonnegative integer vectors, where the vectors are indexed by a finite abelian group $G$ of size $\ell$ an
Externí odkaz:
http://arxiv.org/abs/2310.00403
Autor:
Morales, Luis B., Bulutoglu, Dursun A.
We prove the equivalence of two-symbol supersaturated designs (SSDs) with $N$ (even) rows, $m$ columns, $s_{\rm max} = 4t +i$, where $i\in\{0,2\}$, $t \in \mathbb{Z}^{\geq 0}$ and resolvable incomplete block designs (RIBDs) whose any two blocks inter
Externí odkaz:
http://arxiv.org/abs/2303.09104
The Legendre pair problem is a particular case of a rank-$1$ semidefinite description problem that seeks to find a pair of vectors $(\mathbf{u},\mathbf{v})$ each of length $\ell$ such that the vector $(\mathbf{u}^{\top},\mathbf{v}^{\top})^{\top}$ sat
Externí odkaz:
http://arxiv.org/abs/2301.01839
Autor:
Kotsireas Ilias S., Koutschan Christoph, Bulutoglu Dursun A., Arquette David M., Turner Jonathan S., Ryan Kenneth J.
Publikováno v:
Special Matrices, Vol 11, Iss 1, Pp 814-841 (2023)
By assuming a type of balance for length ℓ=87\ell =87 and nontrivial subgroups of multiplier groups of Legendre pairs (LPs) for length ℓ=85\ell =85, we find LPs of these lengths. We then study the power spectral density (PSD) values of mm compres
Externí odkaz:
https://doaj.org/article/3c302c690f8e4ec1a70ae409bf7737a4
Autor:
Kotsireas, Ilias, Koutschan, Christoph, Bulutoglu, Dursun, Arquette, David, Turner, Jonathan, Ryan, Kenneth
Publikováno v:
Special Matrices 2023; 11: 20230105
By assuming a type of balance for length $\ell=87$ and non-trivial subgroups of multiplier groups of Legendre pairs (LPs) for length $\ell=85$, we find LPs of these lengths. We then study the power spectral density (PSD) values of m-compressions of L
Externí odkaz:
http://arxiv.org/abs/2111.02105
Publikováno v:
LMS Journal of Computation and Mathematics, 19, (2016), 206-216
There is always a natural embedding of $S_s\wr S_k$ into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to pr
Externí odkaz:
http://arxiv.org/abs/2104.11006
Autor:
Bulutoglu, Dursun A., Ryan, Kenneth J.
Publikováno v:
Journal of Complexity 31 (4) (2015) 577-589
Statistical design of experiments is widely used in scientific and industrial investigations. A generalized minimum aberration (GMA) orthogonal array is optimum under the well-established, so-called GMA criterion, and such an array can extract as muc
Externí odkaz:
http://arxiv.org/abs/2104.12588
Publikováno v:
Discrete Optimization 32 (2019) 93-119
For a given linear program (LP) a permutation of its variables that sends feasible points to feasible points and preserves the objective function value of each of its feasible points is a symmetry of the LP. The set of all symmetries of an LP, denote
Externí odkaz:
http://arxiv.org/abs/2104.10517
We provide a search method for Legendre pairs of composite length based on generating binary matrices with fixed row and column sums from compressed, complementary integer vectors. This approach yielded the first construction of a Legendre pair of le
Externí odkaz:
http://arxiv.org/abs/2101.10918