45070598
An Adaptive Spatial Error Concealment for H.264/AVC Video Stream
A drill guide for positioning on a surface of a bone includes a projection for penetrating the bone, an abutment for engaging the surface of the bone to ensure penetration of the bone by the projection to a predetermined depth, less than the length of the projection, and a pair of guide passages having central longitudinal axes, respectively, converging at a predetermined point in the bone when the projection penetrates the bone to the predetermined depth. A kit for fixating soft tissue to bone includes a drill guide, a drill bit, a suture and a suture passer. The drill bit is insertable in a pair of guide passages of the drill guide to cut first and second passages converging in the bone to define a continuous tunnel. The suture passer has a portion for being introduced in the tunnel to engage the suture externally of the bone such that the suture is drawn through the tunnel when the suture passer is withdrawn therefrom. A method of fixating soft tissue to bone includes the steps of penetrating a bone with a projection of a drill guide, engaging the bone with an abutment of the drill guide to ensure penetration of the bone by the projection to a predetermined depth, introducing a drill bit through a pair of guide passages of the drill guide and into the bone to form first and second passages converging in the bone to define a continuous tunnel, introducing a suture passer into the tunnel such that a suture engaging member of the suture passer protrudes externally of the bone, engaging a suture with the suture engaging member, withdrawing the suture passer from the tunnel to draw the suture through the tunnel and using the suture to fixate soft tissue to the bone.
28547446
Low-Complex Equalization for Single Carrier Systems Employing Cyclic Prefix over Time-Variant Channels
A simplified equalization method based on the band structure of the frequency domain channel matrix is proposed for the single carrier systems employing cyclic prefix (SC-CP) over time-varying wireless channels. Using both theoretical analysis and computer simulation, it is shown that the complexity of this method is proportional to the number of symbols in one SC-CP block and is less than that of traditional block equalization methods. We also show that they have similar performance.
7144886
Khatri-Rao Unitary Space-Time Modulation
Based on the Khatri-Rao matrix product, we propose a novel unitary space-time modulation design called KR-USTM in this paper. Different from existing USTM schemes, such as the systematic approach and space-time frequency-shift keying (ST-FSK), KR-USTM does not require any computer search and can be applied to any number of transmit antennas. Moreover, the special structure of KR-USTM also makes it a high-rate scheme and achieve full antenna diversity as well as lower decoding complexity. Simulation results show that the proposed KR-USTM constellation achieves error performance comparable to existing USTM designs at low rates, while it outperforms them at high rates.
11066290
Robust multi-level video representation using mean shift analysis
A robust method for multi-level video representation based on the mean shift analysis (MSA) of low-level visual features is proposed in this paper. By tuning the bandwidth of MSA, video representation from the coarse level to the fine level can be achieved. This representation form provides a flexible scheme for content-based video analysis such as summarization, classification, and retrieval. Compared with the conventional k-means or fuzzy c-means algorithms, our method can adjust the resolution of representation in a more straightforward way, and is more robust since it does not need to initialize the cluster centers
1462661
Low-power AEC-based MIMO signal processing for gigabit ethernet 1000Base-T transceivers
Presented in this paper is a low-power technique, denoted as MIMO-AEC, to reduce energy dissipation in multi-input-multi-output (MIMO) signal processing systems. The proposed technique extends a previously proposed adaptive error-cancellation (AEC) technique to MIMO systems by employing an algorithm transformation denoted as MIMO-DECOR. The purpose of MIMO-DECOR is to reduce complexity by exploiting correlations inherent in MIMO systems, thereby improving the effectiveness of AEC. We employ the MIMO-AEC in the design of a low-power Gigabit Ethernet 1000Base-T device. Simulation results demonstrate 44.3% - 25.2% overhead reduction due to MIMO-DECOR and 69.1% - 64.2% energy savings over conventional implementations with no loss in algorithmic performance.
30275519
Traffic Intelligent Optimization and Local Traffic-Flow Control Inside Shanghai-EXPO-Area
32146489
Cycle Period Analysis and Optimization of Timed Circuits
In this paper, a method is proposed to analyze the minimum average cycle period of the timed circuits. Timed Petri net is used to model timed circuits. Our method is focus on structural analysis of the Petri net model of the timed circuits, which is another way to reduce the state space of the analyzed model. Then an algorithm is proposed to optimize the performance of timed circuit by asynchronous retiming technique. The algorithm balances the asynchronous pipelines to gain the target cycle period while minimize the area at the same time. Experimental results demonstrate the computational feasibility and effectiveness of both approaches.
14334349
Learning Cascaded Reduced-Set SVMs Using Linear Programming
This paper proposes a simple and efficient detection framework that uses reduced-set kernels. We first describe our approach which reduces the number of kernels. A convex optimization method is used for calculating the reduced sets. Following this, we propose a method that optimally designs the cascade. Our experimental results indicate that our method minimizes complexity regarding the number of kernels in the cascaded structure while preserving the low error rates. Our algorithm generates the optimal weight of kernels for each cascade stage. This proposed algorithm achieves high detection-rates at low computational cost.