8110472
Methodology for Mode Selection in MIMO-OFDM System
Mode selection problem in MIMO-OFDM system is addressed. A general formulation is introduced to decompose the problem into two decoupled sub-problems: modulation and coding scheme (MCS) selection, and space-time processing (STP) optimization, each of which can be tackled more systematically. Mode selection algorithms can then be developed using a channel quality indicator (CQI) metric. The methodology is illustrated using the platform of IEEE 802.11n. The qualities of multiple CQI metrics are compared in terms of "coherency" and their performances are evaluated in terms of system goodput. This has been shown that the metric we proposed outperforms the other metrics.
10595235
A Block Coprocessor for User Data Rate Improvements to GPRS Coding Scheme 4
The general packet radio service (GPRS) has been developed to allow packet data to be transported efficiently over an existing circuit-switched radio network, such as GSM. The main application of GPRS are in transporting Internet protocol (IP) datagrams from web servers (for telemetry or for mobile Internet browsers). Four GPRS baseband coding schemes are defined to offer a trade-off in requested data rates versus propagation channel conditions. However, data rates in the order of > 100 kbits/s are only achievable if the simplest coding scheme is used (CS-4) which offers little error detection and correction (EDC) (requiring excellent SNR) and the receiver hardware is capable of full duplex which is not currently available in the consumer market. A simple EDC scheme to improve the GPRS block error rate (BLER) performance is presented, particularly for CS-4, however gains in other coding schemes are seen. For every GPRS radio block that is corrected by the EDC scheme, the block does not need to be retransmitted releasing bandwidth in the channel and improving the user's application data rate. As GPRS requires intensive processing in the baseband, a viable field programmable gate array (FPGA) solution is presented in this paper.
29061314
Improving CS-4 User Data Rate in GPRS Enabled Devices by Using a BLER Co-processor
 The General Packet Radio Service (GPRS) was developed to allow packet data to be transported efficiently over an existing circuit switched radio network. The main applications for GPRS are in transporting IP datagram’s from the user’s mobile Internet browser to and from the Internet, or in telemetry equipment. A simple Error Detection and Correction (EDC) scheme to improve the GPRS Block Error Rate (BLER) performance is presented, particularly for coding scheme 4 (CS-4), however gains in other coding schemes are seen. For every GPRS radio block that is corrected by the EDC scheme, the block does not need to be retransmitted releasing bandwidth in the channel, improving throughput and the user’s application data rate. As GPRS requires intensive processing in the baseband, a viable hardware solution for a GPRS BLER co-processor is discussed that has been currently implemented in a Field Programmable Gate Array (FPGA) and presented in this paper.
7470395
A Simulation-Based 3D Axon Axis Extraction in Confocal Fluorescence Microscopy Images
Neuron axon analysis is a fundamental mean to investigate nervous system in neurobiology and often requires collecting a great amount of statistical information. Automated extraction of axons axis in 3D microscopic images posts a key problem in the field of neuron axon analysis. To address tortuous axons with several touchings in 3D volumes, a novel simulation based approach with regard to volume modeling and scenario mapping is presented. Given the simulation model, the properties of dataset and the nature of axon (e.g., continuity) are converted to physics laws including the principle of minimum potential energy, law of buoyancy, and law of inertia. Experimental results on axon volumes show the proposed algorithm can effectively handle axon touching problem and actually extract multiple axon axes.
18767470
New event detection based on indexing-tree and named entity
New Event Detection (NED) aims at detecting from one or multiple streams of news stories that which one is reported on a new event (i.e. not reported previously). With the overwhelming volume of news available today, there is an increasing need for a NED system which is able to detect new events more efficiently and accurately. In this paper we propose a new NED model to speed up the NED task by using news indexing-tree dynamically. Moreover, based on the observation that terms of different types have different effects for NED task, two term reweighting approaches are proposed to improve NED accuracy. In the first approach, we propose to adjust term weights dynamically based on previous story clusters and in the second approach, we propose to employ statistics on training data to learn the named entity reweighting model for each class of stories. Experimental results on two Linguistic Data Consortium (LDC) datasets TDT2 and TDT3 show that the proposed model can improve both efficiency and accuracy of NED task significantly, compared to the baseline system and other existing systems.
16102915
PURPLE: a reflective middleware for pervasive computing
Pervasive computing is one of the hottest research areas in development of information technology. Among the identified key requirements for the software infrastructure of pervasive computing, such as adaptability, configurability, context and environment awareness, we focus the effort of study on the technology of reflection. In this paper, we introduce PURPLE, a reflective middleware platform which is designed and implemented to fit the very requirement of pervasive computing. And a performance analysis is given to evaluate the work.
2401406
Graph Theory Application in Cell Nuleus Segmentation, Tracking and Identification
A novel cell nucleus tracking approach is raised in this paper, developed from applied graph theory that simultaneously handles major challenges of cells touching, splitting, disappearing and emerging. The key point of our work lies in the graphs with robust structures that constructed from large cells groups. Then the problem of nucleus tracking is simplified to that of vertex matching between graphs generated from successive frames. Single cells are modeled as vertices in the graph and edges are built between neighboring ones, through which cells in large quantities are connected altogether. The algorithm works through a process of graph saturation following vertices with maximal entering belief-propagation flows. Feasibility of our approach is validated by so-called 'Crowds Model' that explains motional features of multi-cells groups. In processing CT image sources with high cell intensities as well as complex variations in structures, robustness of our approach is confirmed in that both successful tracking rates and segmentation rates are kept above 96%.
34929506
Adaptive Receive Antenna Selection for Orthogonal Space-Time Block Codes with Imperfect Channel Estimation
For coherent detection, decoding Orthogonal Space-Time Block Codes (OSTBC) requires full channel state information at the receiver, which basically is obtained by channel estimation. However, in practical systems, channel estimation errors are inevitable and may degrade the system performance more as the number of antennas increases. This letter shows that, using fewer receive antennas can enhance the performance of OSTBC systems in presence of channel estimation errors. Furthermore, a novel adaptive receive antenna selection scheme, which adaptively adjusts the number of receive antennas, is proposed. Performance evaluation and numerical examples show that the proposed scheme improves the performance obviously.