281 research outputs found

    Performance analysis of the WiNC2R platform:

    No full text
    A Cognitive Radio (CR) is an intelligent transceiver device, able to support multiple technologies, dynamic re-configurability, ease of programming and collaboration with other CR devices to improve the communication efficiency. The two key requirements for an efficient CR implementation are flexibility in operation/programming and speed. WiNC2R (Winlab Network Centric Cognitive Radio) achieves high speed of operation using its hardware platform and flexibility using its software-configurable architecture. The current WiNC2R architecture implements an 802.11a-like OFDM flow. We evaluate the WiNC2R hardware architecture to see the modularity in the architecture, separation of data and control flow and the performance in terms of latency and throughput. To test the system, the Xilinx Bus Functional Model environment, which is designed to test the IBM standard bus-architecture-based hardware systems, is used. We use a simple ALOHA protocol in the MAC layer to communicate between two WiNC2R nodes and evaluate the performance under the best-case scenario, where the performance is only hindered by the architecture itself rather than external conditions like channel state. The results of our basic experiments showed that for a single OFDM 802.11a-like flow, the Unit Control Modules (UCM) were idle for almost 80% of the total processing time. We then tested the WiNC2R system to study the effects of changing the frame size. It was seen that the latencies in the WiNC2R transmitter are frame-size dependent while those in the receiver mainly depend on the size of the data in the last chunk rather than the size of the whole frame. We suggest that chunk size should be 2 OFDM symbols, and chunking be moved to MAC layer for better performance. We give analytical estimates of resulting performance improvement. In the next experiment, we describe virtualization in the WiNC2R by adding more flows. We describe the steps to implement the additional flows and estimate maximum number of concurrent flows possible. In the last analysis, we show the effect of operating clock frequency on the performance. We prove that at 250 MHz operating frequency and 2 OFDM symbols per chunk, the current WiNC2R implementation will be able to satisfy the SIFS criterion.M.S.Includes bibliographical references (p. 72-73)by Sumit Satarka

    Mixed Based Classifier Approach for Sentiment Analysis

    No full text
    M.E. (Software Engineering)The increasing expansion of social media stuff provides massive collection of textual information. People share their thoughts and views on the WEB. So sentiment analysis used to classifies the sentiments or the opinions from this huge amount of data. There are already many algorithms to find the sentiment form the data but there are many difficulties present to handle data like slang words and miss-spelling so the efficiency and the accuracy of these algorithms became poor. In this methodology the underlying idea is to achieve a particular accuracy rate by a new mixed algorithm by using different approaches like POS, N-Gram and some lexicon techniques.Computer Science and Engineering, Thapar Univesity, Patial

    Multidimensional search result diversification

    No full text

    Production of yogurt powder using foam-mat drying

    No full text
    Student's Report (B.S.)--Assumption University, 2010.Includes bibliography

    Query optimization in mobile environments

    No full text
    We consider the issue of optimizing queries for distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consum- ption at the mobile client. In this scenario, the optimal plan for a query depends on the residual battery level of the mobile client and the load at the server. We approach this problem by compiling a query into a sequence of candidate plans, such that for any state of the client-server system, the optimal plan is one of the candidate plans. A general solution is proposed by adapting the partial order dynamic programming search algorithm (p.o dp) such that the coverset of the query is the set of candidate plans. We propose two novel algorithms, namely, the linear combinations algorithm and the linearset algorithm (referred to as the linear algorithms) that compute the linearset of a query. The linear- set of a query is an approximation to the coverset returned by p.o. dp. We show, by means of simulation, that (1) the linearset is an excellent approximation of the coverset, (2) query compilation using the linear algorithms outperform query compilation using p.o. dp by factors ranging from 2 to 9, (3) the time taken to compile queries using the linear algorithms for the general optimization criterion is at most twice the time taken by a System R* like standard query optimizer search algorithm, and (4) the run time overhead incurred by the linear algorithms technique is minimal. The techniques presented in the paper are of general applicability to multi-criterion optimization problems in distributed databases, where each criterion is an additive metric.Technical report lcsr-tr-21
    corecore