Assistant Professor
Air Force Institute of Technology (AFIT)
Wright-Patterson AFB, OH 45433
(937) 255-3636 x4704
Email Dursun Bulutoglu
D.A.
Bulutoglu and C.S. Cheng "Hidden Projection Properties of Some Nonregular
Fractional Factorial Designs and Their Applications" The Annals of Statistics 31, 1012-1026, (2003).
D.A. Bulutoglu and C.S. Cheng "Construction of E(s2)-optimal
Supersaturated Designs" The Annals of Statistics 32 1662-1678, (2004).
G. Roelke, R. Baldwin and D.A. Bulutoglu "Analytical Models for the
Performance of Von Neumann Mulitplexing" IEEE
Transactions on Nanotechnology 6, 2007.
K.J. Ryan and D.A. Bulutoglu "E(s2)-optimal
Supersaturated Designs with Good Minimax Properties" Journal of Statistical Planning and Inference 137, 2250-2262, 2007.
D.A. Bulutoglu "Cyclically Generated Supersaturated Designs" Journal of Statistical Planning and Inference
137, 2413-2428, 2007.
D.A. Bulutoglu and F. Margot "Classification of Orthogonal Arrays by Integer
Programming" Journal of Statistical Planning and Inference
138, 654-666, 2008.
D.A. Bulutoglu and K. J. Ryan "E(s2)-Optimal
Supersaturated Designs with Good Minimax Properties when N
is Odd" Journal of Statistical Planning and Inference 138 1754-1762, 2008.
D.A. Bulutoglu and K. J. Ryan "D-Optimal and
Near D-optimal 2k Fractional Factorial Designs of
Resolution V" Journal of Statistical
Planning and Inference Special Issue: Metaheuristics,
Combinatorial Optimization and Design of Experiments 139, 15-22, 2009.
D.A. Bulutoglu and D. M. Kaziska "A counterexample to Beder's conjectures about Hadamard matrices" Journal of Statistical Planning and Inference (to appear).
K. J. Ryan and D.A. Bulutoglu "Minimum Aberration Fractional Factorial
Designs with Large N" (submitted).
D.A. Bulutoglu D. M. Kaziska "Improved WLP and GWP Lower Bounds Based on Exact Integer Programming" (submitted).
D.A. Bulutoglu and K. J. Ryan "Generalized Minimum Aberration Designs with Small Run Sizes" (submitted).
Designs from this paper are here. Use the unix command "tar xvzf post.tgz" to unpack.
D.A. Bulutoglu and K. J. Ryan "A Step-down
Algorithm with Integer Programming for Improving
E(s2) Lower Bounds" (in preperation).
Orthogonal Arrays:
All non-isomorphic OA(24,6,2,3)s
All
non-isomorphic
OA(24,7,2,2)s
All non-isomorphic OA(24,7,2,3)s
All non-isomorphic OA(24,8,2,3)s
All
non-isomorphic
OA(24,9,2,3)s
All
non-isomorphic
OA(24,10,2,3)s
All
non-isomorphic
OA(24,11,2,3)s
All non-isomorphic OA(32,6,2,3)s
All
non-isomorphic
OA(32,7,2,3)s
All non-isomorphic OA(32,8,2,3)s
All non-isomorphic OA(32,9,2,3)s
All non-isomorphic OA(32,10,2,3)s
All
non-isomorphic
OA(32,11,2,3)s
All
non-isomorphic
OA(40,6,2,3)s
All non-isomorphic OA(40,7,2,3)s
All non-isomorphic OA(40,8,2,3)s
All non-isomorphic OA(40,9,2,3)s
All
non-isomorphic
OA(40,10,2,3)s
All
non-isomorphic
OA(48,6,2,3)s
All non-isomorphic OA(48,7,2,3)s
All non-isomorphic OA(48,8,2,3)s
All
non-isomorphic
OA(56,6,2,3)s
All
non-isomorphic
OA(56,7,2,3)s
All
non-isomorphic
OA(64,7,2,4)s
All
non-isomorphic
OA(64,8,2,4)s
All
non-isomorphic
OA(80,6,2,4)s
All non-isomorphic OA(96,7,2,4)s
All non-isomorphic OA(112,6,2,4)s
All non-isomorphic OA(144,8,2,4)s
Packing Arrays with the Maximum Number of Runs:
All non-isomorphic PA*3(6,2,4)
All non-isomorphic PA*5(7,2,4)
All non-isomorphic PA*7(7,2,4)
Covering Arrays with the Minimum Number of Runs:
All
non-isomorphic CA*1(3,2,2)
All non-isomorphic CA*1(4,2,2)
All non-isomorphic CA*1(5,2,2)
All non-isomorphic CA*1(6,2,2)
All non-isomorphic CA*1(7,2,2)
All non-isomorphic CA*1(8,2,2)
All
non-isomorphic CA*1(9,2,2)
All non-isomorphic CA*1(10,2,2)
All non-isomorphic CA*1(11,2,2)
All non-isomorphic CA*1(4,2,3)
All non-isomorphic CA*1(5,2,3)
All non-isomorphic CA*1(6,2,3)
All non-isomorphic CA*1(7,2,3)
All non-isomorphic CA*1(8,2,3)
All
non-isomorphic CA*1(9,2,3)
All non-isomorphic CA*1(10,2,3)
All non-isomorphic CA*1(5,2,4)
All non-isomorphic CA*1(6,2,4)
All non-isomorphic CA*1(7,2,4)
All non-isomorphic CA*1(8,2,4)
All
non-isomorphic CA*1(9,2,4)
All non-isomorphic CA*1(10,2,4)
All non-isomorphic CA*2(8,2,2)
All non-isomorphic CA*2(9,2,2)
All non-isomorphic CA*2(10,2,2)
All
non-isomorphic CA*2(8,2,3)
All non-isomorphic CA*2(9,2,3)
All
non-isomorphic CA*3(6,2,4)
All non-isomorphic CA*5(7,2,4)
All non-isomorphic CA*7(7,2,4)
All
non-isomorphic CA*1(3,3,2)
All non-isomorphic CA*1(4,3,2)
All non-isomorphic CA*1(5,3,2)
All non-isomorphic CA*1(6,3,2)
All
non-isomorphic CA*1(4,3,3)
All non-isomorphic CA*1(5,3,3)
All non-isomorphic CA*1(6,3,3)
All non-isomorphic CA*1(5,3,4)
E(s2)-optimal Supersaturated Designs:
Results discussed in the
paper “D-optimal and near D-optimal 2k
fractional factorial
designs of resolution V”
Design
of Experiments, Discrete Optimization and Combinatorial Optimization.
STAT
583 - Introduction to Probability and Statistics
STAT 696 - Linear Models
STAT 694 - Design of Experiments
MATH 509 - Mathematical Methods for the Physical Sciences
MATH 521 - Linear Algebra
MATH 633 - Graph Theory
Ph.D.
(2001), Statistics, University of California,
Thesis Advisor: Ching-Shui Cheng
M.A. (1998), Statistics,
B.S. (1996), Mathematics
The
following disclaimer applies to all hyperlinks contained on this web page:
The appearance of this hyperlink does not constitute endorsement by the U.S.
Air Force of this web site or the information, products or services contained
therein. For other than authorized activities such as military exchanges and
Morale, Welfare and Recreation sites, the U.S. Air Force does not exercise any
editorial control over the information at this location. This link is provided
consistent with the stated purpose of this DOD web site.
Last modifed
March 2, 2006. You can e-mail me by inserting my name as specified into the
address: FirstName.LastName@afit.edu