This book constitutes the proceedings of the First internationalconference on Advances in computing and informationtechnology, ACITY 2011, held in Chennai, India, in July 2011. The 55 revised full papers presented w...
ISBN:
(数字)9783642225550
ISBN:
(纸本)9783642225543
This book constitutes the proceedings of the First internationalconference on Advances in computing and informationtechnology, ACITY 2011, held in Chennai, India, in July 2011. The 55 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers feature significant contributions to all major fields of the Computer Science and informationtechnology in theoretical and practical aspects.
Cooperative communications are candidates for emerging distributed Network designs. In this paper, a new design of distributed network coding is introduced. The proposed design are based on algebraic constructions in ...
详细信息
ISBN:
(纸本)9781479988020
Cooperative communications are candidates for emerging distributed Network designs. In this paper, a new design of distributed network coding is introduced. The proposed design are based on algebraic constructions in Finite Fields using the Discrete Fourier Transform (DFT). These set of codes provides an alternative to Generalized Dynamic Network Codes (GDNC) and are based on the Hamming distance metric. Using this metric, the codes have maximum diversity and scales over large networks. In our work, we show that a compromise on the Field Size becomes necessary for enforcing the distributed Network codes over large networks. While the diversity offered by these codes are optimum, a unique feature of these codes are the ease of generation and scalability to larger network sizes. Results are provided and compared with theoretical evaluations.
With advances in computer and informationtechnology, high volumes of a wide variety of valuable data are easily collected and generated in the current era of big data from a broad range of data sources of different v...
详细信息
ISBN:
(纸本)9781509043149
With advances in computer and informationtechnology, high volumes of a wide variety of valuable data are easily collected and generated in the current era of big data from a broad range of data sources of different veracities at a high velocity. As such, many traditional data management and analytic approaches may not be suitable for handling the big data due to their well-known 5V's characteristics. Over the past few years, several systems and applications have developed to use cloud, grid and service computing to manage and analyze big data so as to support data science (e.g., knowledge discovery and data mining). In this paper, we present a big data science solution for social computing and social network analytics so as to provide services and support to big data mining of interesting patterns from big social networks that are stored in key-value databases.
Document summarization is a strategy, intended to extract information from multiple documents, deliberating the same subject. Many software applications handle document summarization,helping people grab the main thoug...
详细信息
ISBN:
(纸本)9781509063673
Document summarization is a strategy, intended to extract information from multiple documents, deliberating the same subject. Many software applications handle document summarization,helping people grab the main thought, from a collection of documents, within a short time. Automatic summaries present information algorithmically extracted from multiple sources, without any impressionistic human intervention mediation. Experiments have resulted in ingenious algorithms, surmount the task of creating a short and salient summary. One such technique suggested in this paper is Dictionary Learning. This paper focuses on Document summarization, using dictionary learning and sparse coding techniques, considering the ordering of sentences and redundancy of documents. We use Singular Value Decomposition(SVD) for dictionary learning and Orthogonal Matching Pursuit(OMP) for sparse coding. The application of SVD augments the semantics of the generated summary. The order of sparsity in the final sparse code is used in ordering the sentences in the final summary. Verification of our proposed methodology have shown 75% precision.
By research on lossy compression technology about about the encrypt coding image, lossy predictive coding is analyzed, and Optimal predictors altogether with optimal quantization was set up. Meanwhile, coding image mo...
详细信息
ISBN:
(纸本)9780769536828
By research on lossy compression technology about about the encrypt coding image, lossy predictive coding is analyzed, and Optimal predictors altogether with optimal quantization was set up. Meanwhile, coding image model produces a fairly good effect by application on the encrypt image at the entrance of a network user on the platform of information network under WEB.
Distributed Video coding based on compressed sensing is considered in this paper. Side information plays an important role in the quality of decoded non-key video frames. Existing systems generate side information bas...
详细信息
Wireless Sensor networks (WSNs) require energy-efficient and robust communication protocols. Cooperative MIMO transmission is one of the new solutions. In this paper, we propose an Energy-efficient Cluster-based Coope...
详细信息
ISBN:
(纸本)9781424462520
Wireless Sensor networks (WSNs) require energy-efficient and robust communication protocols. Cooperative MIMO transmission is one of the new solutions. In this paper, we propose an Energy-efficient Cluster-based Cooperative MIMO transmission scheme using Network coding, termed as ECCM-NC. Network coding algorithm is applied to reduce the energy and time consumption in intra-cluster information exchange procedure. An optimization model is developed to find the optimum cooperative nodes number, clusters number and transmission rates. Simulation shows that tremendous energy saving is possible with application of network coding and judicious choice of designed protocol parameters even considering the local circuit energy cost and STBC training overhead.
With the development of the XML technology, it becomes more and more important to find a new method for efficient XML data management. In this paper, we propose a new approach (CCSU) that not only supports XML data up...
详细信息
In classes supported by electronic messaging systems, students are required or encouraged to discuss the class topics and share their knowledge by posting text messages and replying to others. When the amount of messa...
详细信息
ISBN:
(纸本)0769521088
In classes supported by electronic messaging systems, students are required or encouraged to discuss the class topics and share their knowledge by posting text messages and replying to others. When the amount of messages is large, it is difficult for the instructor to read through all messages and evaluate student's performance. We apply natural language processing techniques to analyze the course messages to assess student's performance. Students are evaluated from three aspects: knowledge learned from the class, effort devoted to the class, and the activeness of their participation;three measures - keyword density (KD), message length (ML), and message count (MC), are derived from the text messages for each evaluation aspect respectively. The three measures are then combined to compute an overall performance indicator (PI) score for each student. The experiment shows that there is a high correlation between the PI scores and the actual grades;the rank order of students by the PI scores and that by the actual grades are highly correlated as well.
Block matching algorithms (BMA) have been widely used as standard motion estimation (ME) techniques in video. coding practice. In this paper, we present an iterative but analytical motion estimation algorithm with att...
详细信息
ISBN:
(纸本)0769519164
Block matching algorithms (BMA) have been widely used as standard motion estimation (ME) techniques in video. coding practice. In this paper, we present an iterative but analytical motion estimation algorithm with attractive computational efficiency. Our work can be viewed as generalization of the celebrated work of Lucas and Kanade [1] on iterative image registration into the wavelet space. We will demonstrate that block-based motion estimation can be performed efficiently in a coarse-to-fine fashion by propagating the estimate across the scale in the wavelet space. Our solution often takes a fraction of the computations required by the conventional BMA methods and reaches comparable MSE performance of prediction residues (fractional-pel motion accuracy is achieved due to the analytical nature of the proposed scheme). In spite of the iteration in the proposed scheme, it converges fast especially with a good initial estimate passed on from the low resolution. Our new ME scheme is particularly useful to the speed-up of implementing a new class of wavelet-based scalable video coders.
暂无评论