Speech processing is typically based on a set of complex algorithms requiring many parameters to be specified. When parts of the speech processing chain do not behave as expected, trial and error is often the only way...
详细信息
In this study we apply a cumulative belief degrees approach to an environmental sampling example in nuclear safeguards evaluation. Transformation formulas for each indicator are defined for distinguishing anthropogeni...
详细信息
The paper describes the application porting process onto the EGEE grid of GROMACS package that was carried out using the P-GRADE Grid Portal tool implemented in COMPCHEM. For this purpose a new stategy to access local...
详细信息
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structures in over-segmented electron microsc...
详细信息
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structures in over-segmented electron microscopy images. We formulate the problem of co-clustering as a quadratic semi-assignment problem and investigate convex relaxations using semidefinite and linear programming. We further introduce a linear programming method with manageable number of constraints and present an approach for learning the cost function. Our method increases computational efficiency by orders of magnitude while maintaining accuracy, automatically finds the optimal number of clusters, and empirically tends to produce binary assignment solutions. We illustrate our approach in simulations and in experiments with real EM data.
It is well known that a digital elevation model (DEM) may contain systematic or other errors. In many 3-D visualization systems, problems in the data may be highlighted, but it is often difficult for the viewer to dis...
详细信息
It is well known that a digital elevation model (DEM) may contain systematic or other errors. In many 3-D visualization systems, problems in the data may be highlighted, but it is often difficult for the viewer to discern the exact nature of the problem. We present DEMView, a viewing and error assessment system specifically for use with DEMs. The system displays a DEM in 3-D with the usual translation, rotation, and zooming tools. However, the system incorporates a suite of visual (qualitative) and statistical (quantitative) assessment tools that help a researcher determine and analyze errors and uncertainty in a given DEM. A case study shows the efficacy of the system.
Speech processing is typically based on a set of complex algorithms requiring many parameters to be specified. When parts of the speech processing chain do not behave as expected, trial and error is often the only way...
详细信息
ISBN:
(纸本)9781424475421
Speech processing is typically based on a set of complex algorithms requiring many parameters to be specified. When parts of the speech processing chain do not behave as expected, trial and error is often the only way to investigate the reasons. In this paper, we present a research methodology to analyze unexpected algorithmic behavior by making (intermediate) results of the speech processing chain perceivable and intuitively comprehensible by humans. The workflow of the process is explicated using a real-world example leading to considerable improvements in speaker clustering. The described methodology is supported by a software toolbox available for download.
Learning in the presence of data imbalances presents a great challenge to machine learning. Imbalanced data sets represent a significant problem because the corresponding classifier has a tendency to ignore samples wh...
详细信息
Given a set of n points in Rd with nonnegative weights, we consider the weighted rectilinear min-sum facility problem to minimize the sum of weighted rectilinear distance between the given points and a new added point...
详细信息
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may make the connection route sub-optimal in ...
详细信息
ISBN:
(纸本)9781450300629
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may make the connection route sub-optimal in terms of hop length, thereby resulting in unnecessarily high end-to-end delays, energy consumption and channel contention. In AODV, for example, a connection route is recomputed only if one of its constituent links suffers catastrophic failure, at which point global route discovery attempts repair, and after which the topological structure of the connection again returns to nearoptimality. In this paper, we propose an extension to AODV that performs periodic subconnection shrinking of the topological substructure within each connection. We show that this not only reduces the average end-to-end connection length, but also increases the mean time between catastrophic link failures of the connection's constituent links, thereby reducing the number of repair-related global route discoveries experienced. The control traffic needed to operate our scheme can be amortized against the reduction in repair-related global route discovery traffic. Through ns2 simulations, we show that our dynamic subconnection shrinking scheme manifests connections that, on average, have (i) shorter hop length, (ii) higher packet delivery fraction;moreover, this extension operates using less control traffic than standard AODV. We demonstrate that these conclusions continue to hold scalably over a wide range of operating regimes.
Ubiquitous embedded systems are often resource-constrained. Developing software for these systems should take into account resources such as memory space. In this paper, we develop and implement an analysis framework ...
详细信息
Ubiquitous embedded systems are often resource-constrained. Developing software for these systems should take into account resources such as memory space. In this paper, we develop and implement an analysis framework to infer statically stack usage bounds for assembly-level programs in abstract Java Byte code. Our stack bound inference process, extended from a theoretical framework proposed earlier by some of the authors, is composed of deductive inference rules in multiple passes. Based on these rules, a usable tool has been developed for processing programs to capture the stack memory needs of each procedure in terms of the symbolic values of its parameters. The final result contains path-sensitive information to achieve better precision. The tool invokes a Presburger solver to perform fixed point analysis for loops and recursive procedures. Our initial experiments have confirmed the viability and power of the approach.
暂无评论