Results 1  10
of
24,741
diaryl sulfoxides with various sizes
, 1999
"... and photoinversion reactions in solutions of chiral ..."
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
. To deal with cells of various sizes, the algorithm progresses by moving one cell at a time between the blocks of the partition while maintaining a desired balance based on the size of the blocks rather than the number of cells per block. Efficient data structures are used to avoid unnecessary searching
Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment
 In IEEE Infocom
, 2001
"... Energyaware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of wellknown wireless network interfaces and device specifications do not ..."
Abstract

Cited by 669 (3 self)
 Add to MetaCart
collection of linear equations for calculating the energy consumed in sending, receiving and discarding broadcast and pointto point data packets of various sizes. Some implications for protocol design and evaluation in ad hoc networks are discussed. Keywordsenergy consumption, IEEE 802.11, ad hoc
On the algorithmic implementation of multiclass kernelbased vector machines
 Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernelbased vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract

Cited by 559 (13 self)
 Add to MetaCart
to incorporate kernels with a compact set of constraints and decompose the dual problem into multiple optimization problems of reduced size. We describe an efficient fixedpoint algorithm for solving the reduced optimization problems and prove its convergence. We then discuss technical details that yield
Dummynet: A Simple Approach to the Evaluation of Network Protocols
 ACM Computer Communication Review
, 1997
"... Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate mo ..."
Abstract

Cited by 484 (6 self)
 Add to MetaCart
Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate
DETERMINISTIC CONSTRUCTIONS OF BINARY MEASUREMENT MATRICES WITH VARIOUS SIZES
"... We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their hardware realization convenient and easy. Firstly, using th ..."
Abstract
 Add to MetaCart
and columns from these base matrices, we construct the desired measurement matrices with various sizes and they show empirically comparable performance to that of the corresponding Gaussian matrices. Index Terms — Compressed sensing, deterministic measure
Sequential minimal optimization: A fast algorithm for training support vector machines
 Advances in Kernel MethodsSupport Vector Learning
, 1999
"... This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest possi ..."
Abstract

Cited by 461 (3 self)
 Add to MetaCart
is avoided, SMO scales somewhere between linear and quadratic in the training set size for various test problems, while the standard chunking SVM algorithm scales somewhere between linear and cubic in the training set size. SMO’s computation time is dominated by SVM evaluation, hence SMO is fastest
Image analogies
, 2001
"... Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The fullsize images are shown in Figures 10 and 11. This paper describes a new framewo ..."
Abstract

Cited by 455 (8 self)
 Add to MetaCart
Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The fullsize images are shown in Figures 10 and 11. This paper describes a new
Reliability of Various Size Oxide Aperture VCSELs,"
 Proceedings of the 52nd Electronic Components and Technology Conference,
, 2002
"... Abstract This paper presents Honeywell's most recent work on 850nm oxide aperture vertical cavity surface emitting laser (VCSEL) reliability. The VCSELs studied have a range of aperture diameters from about 5 to 20 µm and the reliability effect of aperture diameter is of principal interest in ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
in this paper. Larger apertures generally exhibit greater reliability. Electrostatic discharge (ESD) sensitivity thresholds of the various oxide aperture VCSELs is discussed, again showing dependence on diameter, with larger being better. Results for humidity exposure are presented. Here we find no aperture
Macroamylases: Differences in Activityagainst VariousSized Substrates
"... Hyperamylasemia caused by macroamylases can lead to the overdiagnosis of acute pancreatitis. We examined whether interference from macroamylase is less in assays that use highmolecularmass (highMi) substrates rather than oligosacchande substrates. We hypothesized that highM. substrates would be ..."
Abstract
 Add to MetaCart
Hyperamylasemia caused by macroamylases can lead to the overdiagnosis of acute pancreatitis. We examined whether interference from macroamylase is less in assays that use highmolecularmass (highMi) substrates rather than oligosacchande substrates. We hypothesized that highM. substrates would be stencally excluded from macroamylasemic complexes and thus would be hydrolyzed less efficiently. Eighteen macroamylasemic samples were assayed by using reddyed amylopectin or bluedyed starch as polysacchande substrates or by using maltoheptaose or maftotetraose as oligosacchande substrates. The oligosacchande substrates gave comparable results (y = O.81x + 83), but we observed consistently lower activities for amylopectin than for mattotetraose (y = 0.32x + 38). We observed no bias among methods when nonmacroamylasemic specimens were analyzed. The mechanism of this difference was examined by adding antihuman pancreatic amylase antibodies to hyperamylasemic serum samples from patients without macroamylasemia and to purified human pancreatic or salivary isoamylases. In each case, polyclonal and monoclonal antibodies lowered amylase activity more in assays with complex polysaccharides than in those with oligosaccharides. The use of highMr substrates diminishes interference, and detection of suspected macroamylasemla may be possible through comparing activities determined from automated methods that use different substrates. Additional K.yphru.s: hyperam}dasemia. macroamylasemia variatIon,sowce of
Results 1  10
of
24,741