Results 11  20
of
22,254
A CLASS OF ’ DESIGNS USING A FOLDOVER HADAMARD MATRIX FOR SCREENING EXPERIMENTS
"... Screening designs are frequently used in the pharmaceutical industry to eflciently study the importance of variables during the formulation and process development phase of a new pharmaceutical compound. This paper discusses the construction of an orthogonal 16run hierarchical screening design for ..."
Abstract
 Add to MetaCart
for a 3 x Z 8 experiment, based on a foldover Hadamard matrix, under conditions which define a new class of designs. The extension to larger designs of this type are described and the analysis is given in terms of sums and differences. This new class of designs will provide the applied statistician
Optimum Evaluation of Thermal Performance Characteristics of Micro Heat Pipe using the Hadamard Matrix Design Technique
"... Micro heat pipes are on increasing demand as a result of current advances in technology consequently leading to a concomitant demand for continued research on how their thermal performance could be optimized; hence this study. The Hadamard matrix design approach was used to optimize the input parame ..."
Abstract
 Add to MetaCart
Micro heat pipes are on increasing demand as a result of current advances in technology consequently leading to a concomitant demand for continued research on how their thermal performance could be optimized; hence this study. The Hadamard matrix design approach was used to optimize the input
A Fast Hybrid JacketHadamard Matrix Based Diagonal Blockwise Transform
, 2013
"... In this paper, based on the block (element)wise inverse Jacket matrix, a unified fast hybrid diagonal blockwise transform (FHDBT) algorithm is proposed. A new fast diagonal block matrix decomposition is made by the matrix product of successively lower order diagonal Jacket matrix and Hadamard mat ..."
Abstract
 Add to MetaCart
In this paper, based on the block (element)wise inverse Jacket matrix, a unified fast hybrid diagonal blockwise transform (FHDBT) algorithm is proposed. A new fast diagonal block matrix decomposition is made by the matrix product of successively lower order diagonal Jacket matrix and Hadamard
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm.
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma o(1)) ln n), and previous results of Lund and Yannakakis, that showed hardness of approximation within a ratio of (log 2 n)=2 ' 0:72 lnn. For max kcover we show an approximation threshold of (1 \Gamma 1=e) (up to low order terms), under the assumption that P != NP .
Dynamic conditional correlation: A simple class of multivariate generalized autoregressive conditional heteroskedasticity models
 Journal of Business and Economic Statistics
, 2002
"... Time varying correlations are often estimated with Multivariate Garch models that are linear in squares and cross products of the data. A new class of multivariate models called dynamic conditional correlation (DCC) models is proposed. These have the flexibility of univariate GARCH models coupled wi ..."
Abstract

Cited by 684 (17 self)
 Add to MetaCart
Time varying correlations are often estimated with Multivariate Garch models that are linear in squares and cross products of the data. A new class of multivariate models called dynamic conditional correlation (DCC) models is proposed. These have the flexibility of univariate GARCH models coupled with parsimonious parametric models for the correlations. They are not linear but can often be estimated very simply with univariate or two step methods based on the likelihood function. It is shown that they perform well in a variety of situations and provide sensible empirical results.
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Multipoint quantitativetrait linkage analysis in general pedigrees
 Am. J. Hum. Genet
, 1998
"... Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract

Cited by 549 (56 self)
 Add to MetaCart
Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint identitybydescent (IBD) probability calculations. We extend the sibpair multipoint mapping approach of Fulker et al. to general relative pairs. This multipoint IBD method uses the proportion of alleles shared identical by descent at genotyped loci to estimate IBD sharing at arbitrary points along a chromosome for each relative pair. We have derived correlations in IBD sharing as a function of chromosomal distance for relative pairs in general pedigrees and provide a simple framework whereby these correlations can be easily obtained for any relative pair related by a single line of descent or by multiple independent lines of descent. Once calculated, the multipoint relativepair IBDs can be utilized in variancecomponent linkage analysis, which considers the likelihood of the entire pedigree jointly. Examples are given that use simulated data, demonstrating both the accuracy of QTL localization and the increase in power provided by multipoint analysis with 5, 10, and 20cM marker maps. The general pedigree variance component and IBD estimation methods have been implemented in the SOLAR (Sequential Oligogenic Linkage Analysis Routines) computer package.
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Results 11  20
of
22,254