Fragmentation, allocation and replication are database distribution design techniques that aim at improving the system performance. Among the two fragmentation techniques, vertical fragmentation is often considered mo...
详细信息
Fragmentation, allocation and replication are database distribution design techniques that aim at improving the system performance. Among the two fragmentation techniques, vertical fragmentation is often considered more complicated than horizontal fragmentation, because the huge number of alternatives makes it nearly impossible to obtain an optimal solution to the vertical fragmentation problem. Therefore, we can only expect to find out a heuristic solution. Often fragmentation and allocation are considered separately, disregarding that they are using the same input information to achieve the same objective, i.e. improve the overall system performance. This paper addresses vertical fragmentation and allocation simultaneously in the context of the relational model. The core of the paper is a heuristic approach to vertical fragmentation, which uses a cost model and is targeted at globally minimising these costs
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the total quadratic netlength, we partition...
详细信息
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the total quadratic netlength, we partition the chip area into regions and assign the circuits to them (meeting capacity constraints) such that the placement is changed as little as possible. The core routine of our placer is a new algorithm for the transportation problem that allows to compute efficiently the circuit assignments to the regions. We test our algorithm on a set of industrial designs with up to 3.6 millions of movable objects and two sets of artificial benchmarks showing that it produces excellent results. In terms of wirelength, we can improve the results of leading-edge placement tools by about 5%.
The paper looks at the error resiliency of the motion-compensated embedded zero block coder (MC-EZBC). The MC-EZBC is gaining momentum as a motion compensated temporal filtering solution. We propose to demultiplex the...
详细信息
The paper looks at the error resiliency of the motion-compensated embedded zero block coder (MC-EZBC). The MC-EZBC is gaining momentum as a motion compensated temporal filtering solution. We propose to demultiplex the MC-EZBC bitstream into seven bit categories and examine the effect of bit errors on each bit category. It is shown that different bit categories have different immunity to bit errors. The significance map at quadtree level zero, the motion vectors and the coefficients sign bits are shown to be the most sensitive. These categories exceed 60% of the total bitrate. It is concluded that employing unequal error protection for the motion fields is sufficient. The coding algorithm need not be modified, hence preserving its bitstream embedding and universal scalability feature.
An improved wavelet based 2-D ECG compression method is presented which employs set partitioning in hierarchical trees (SPIHT) algorithm and run length (RL) coding. The proposed 2-D approach utilizes the fact that ECG...
详细信息
An improved wavelet based 2-D ECG compression method is presented which employs set partitioning in hierarchical trees (SPIHT) algorithm and run length (RL) coding. The proposed 2-D approach utilizes the fact that ECG signal shows redundancy between adjacent beats and also adjacent samples. The results of several experiments show that the wavelet function biorthogonal-6.8 with five level of decomposition has better performance compared to others. In period normalization repeating each beat instead of zero padding is more efficient. The initializing of list of insignificant pixels (LIP) is also done in a different way. Results of applying the proposed algorithm on several record of MIT/BIH database show lower percent root mean square difference (PRD) than other 1-D and several 2-D methods for the same compression ratio.
In this work, a mechanism contributing to the blocking artifacts of standard block based transform coding schemes is stated and a simple solution is proposed for reducing its effect. The proposed solution can be easil...
详细信息
In this work, a mechanism contributing to the blocking artifacts of standard block based transform coding schemes is stated and a simple solution is proposed for reducing its effect. The proposed solution can be easily incorporated into the encoding algorithms of existing two dimensional (2-D) discrete cosine transform (DCT) based image and video coding standards (JPEG, MPEG-1 and 2, H-261, H-263) without the need for a modification in their bitstream syntax.
The analysis of the communication architecture and its associated synthesis process has grown in importance in the era of System-On-Chip (SoC) devices, since one is moving towards more complex systems, made by several...
详细信息
The analysis of the communication architecture and its associated synthesis process has grown in importance in the era of System-On-Chip (SoC) devices, since one is moving towards more complex systems, made by several processing elements (cores), with heterogeneous behavior. In many cases, the choice for a communication architecture can be the most crucial factor to meet design constraints. This goal of this work is to define and implement algorithms devoted to analyzing and selecting those communication architectures that better match the user defined system constraints, in an integrated design environment.
Graph theory plays a key role in the field of prediction of protein structure. In this paper, we proposed a new method of protein secondary structure predict based on the path with the maximum weight of a graph. Three...
详细信息
Graph theory plays a key role in the field of prediction of protein structure. In this paper, we proposed a new method of protein secondary structure predict based on the path with the maximum weight of a graph. Three vertices of the graph give a possible secondary structure of a protein, and each edge of the graph is assigned a weight by a function. The path with the maximum weight equated the corrected secondary structure. By this method, we tested against several groups proteins and showed that this method was feasible. Finally we discussed the selection of parameters in this method.
Based on spherical parameterization, we in this paper present an algorithm to naturally morph a mesh model to another. Our algorithm first adjusts poses of both the models to align them in 3D space. Then, the two norm...
详细信息
Based on spherical parameterization, we in this paper present an algorithm to naturally morph a mesh model to another. Our algorithm first adjusts poses of both the models to align them in 3D space. Then, the two normalized models are parameterized onto a common spherical parametrical domain. Subsequently, the algorithm matches a group of given features of the models on spherical domain via a re-parameterizing procedure. As a result, the correspondence of two models' vertices are obtained. Finally, our algorithm interpolates original coordinates of the source model to their corresponding coordinates on the target model to create morphing.
For convenient hands-free telecommunication systems echo cancelers with a low delay are desirable. Since such systems have to cope with long room impulse responses (RIRs) common echo cancelation techniques often suffe...
详细信息
For convenient hands-free telecommunication systems echo cancelers with a low delay are desirable. Since such systems have to cope with long room impulse responses (RIRs) common echo cancelation techniques often suffer from slow convergence or introduce large delays. An algorithm for acoustic echo cancelation (AEC) has to compensate the influence of RIRs of several thousand sampling points. Thus for frequency domain algorithms long DFT-lengths are needed to cover the whole influence of the RIRs. Approaches in the partitioned frequency domain overcome this drawback. Our contribution describes a combined echo cancelation system in the partitioned frequency domain containing a conventional stereo AEC enhanced by a post-filter which requires a reliable residual echo estimate. This contribution focuses on minimizing the estimation bias introduced by partitioned residual echo estimation. For this purpose an optimal smoothing factor for the residual echo differential system will be derived.
We introduce a new fuzzy relational clustering technique with Local Scaling Parameter Learning (LSPL). The proposed approach learns the underlying cluster dependent dissimilarity measure while finding compact clusters...
详细信息
We introduce a new fuzzy relational clustering technique with Local Scaling Parameter Learning (LSPL). The proposed approach learns the underlying cluster dependent dissimilarity measure while finding compact clusters in the given data set. The learned measure is a Gaussian similarity function defined with respect to each cluster that allows to control the scaling of the clusters and thus, improve the final partition. We minimize one objective function for both the optimal partition and for the cluster dependent scaling parameter. This optimization is done iteratively by dynamically updating the partition and the scaling parameter in each iteration. This makes the proposed algorithm simple and fast. Moreover, as we assume that the data is available in a relational form, the proposed approach is applicable even when only the degree to which pairs of objects in the data are related is available. It is also more practical when similar objects cannot be represented by a single prototype.
暂无评论