67,111 research outputs found

    Progressive Processing of Continuous Range Queries in Hierarchical Wireless Sensor Networks

    Full text link
    In this paper, we study the problem of processing continuous range queries in a hierarchical wireless sensor network. Contrasted with the traditional approach of building networks in a "flat" structure using sensor devices of the same capability, the hierarchical approach deploys devices of higher capability in a higher tier, i.e., a tier closer to the server. While query processing in flat sensor networks has been widely studied, the study on query processing in hierarchical sensor networks has been inadequate. In wireless sensor networks, the main costs that should be considered are the energy for sending data and the storage for storing queries. There is a trade-off between these two costs. Based on this, we first propose a progressive processing method that effectively processes a large number of continuous range queries in hierarchical sensor networks. The proposed method uses the query merging technique proposed by Xiang et al. as the basis and additionally considers the trade-off between the two costs. More specifically, it works toward reducing the storage cost at lower-tier nodes by merging more queries, and toward reducing the energy cost at higher-tier nodes by merging fewer queries (thereby reducing "false alarms"). We then present how to build a hierarchical sensor network that is optimal with respect to the weighted sum of the two costs. It allows for a cost-based systematic control of the trade-off based on the relative importance between the storage and energy in a given network environment and application. Experimental results show that the proposed method achieves a near-optimal control between the storage and energy and reduces the cost by 0.989~84.995 times compared with the cost achieved using the flat (i.e., non-hierarchical) setup as in the work by Xiang et al.Comment: 41 pages, 20 figure

    A predictive approach for a real-time remote visualization of large meshes

    Get PDF
    Déjà sur HALRemote access to large meshes is the subject of studies since several years. We propose in this paper a contribution to the problem of remote mesh viewing. We work on triangular meshes. After a study of existing methods of remote viewing, we propose a visualization approach based on a client-server architecture, in which almost all operations are performed on the server. Our approach includes three main steps: a first step of partitioning the original mesh, generating several fragments of the original mesh that can be supported by the supposed smaller Transfer Control Protocol (TCP) window size of the network, a second step called pre-simplification of the mesh partitioned, generating simplified models of fragments at different levels of detail, which aims to accelerate the visualization process when a client(that we also call remote user) requests a visualization of a specific area of interest, the final step involves the actual visualization of an area which interest the client, the latter having the possibility to visualize more accurately the area of interest, and less accurately the areas out of context. In this step, the reconstruction of the object taking into account the connectivity of fragments before simplifying a fragment is necessary.Pestiv-3D projec

    Scalable wavelet-based coding of irregular meshes with interactive region-of-interest support

    Get PDF
    This paper proposes a novel functionality in wavelet-based irregular mesh coding, which is interactive region-of-interest (ROI) support. The proposed approach enables the user to define the arbitrary ROIs at the decoder side and to prioritize and decode these regions at arbitrarily high-granularity levels. In this context, a novel adaptive wavelet transform for irregular meshes is proposed, which enables: 1) varying the resolution across the surface at arbitrarily fine-granularity levels and 2) dynamic tiling, which adapts the tile sizes to the local sampling densities at each resolution level. The proposed tiling approach enables a rate-distortion-optimal distribution of rate across spatial regions. When limiting the highest resolution ROI to the visible regions, the fine granularity of the proposed adaptive wavelet transform reduces the required amount of graphics memory by up to 50%. Furthermore, the required graphics memory for an arbitrary small ROI becomes negligible compared to rendering without ROI support, independent of any tiling decisions. Random access is provided by a novel dynamic tiling approach, which proves to be particularly beneficial for large models of over 10(6) similar to 10(7) vertices. The experiments show that the dynamic tiling introduces a limited lossless rate penalty compared to an equivalent codec without ROI support. Additionally, rate savings up to 85% are observed while decoding ROIs of tens of thousands of vertices

    Delayed commutation in quantum computer networks

    Full text link
    In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communications. We propose a non-classical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes we can route the information after part of it has left the network node.Comment: 4 pages. 4 figures. Preliminar versio

    Treatment of lipomas and diffuse lipomatosis with NDYAG 1064 NM laser and their impact on the quality of life

    Get PDF
    Lipomas, the most common type of benign tumours, are generally developed from adipose tissue and present an incidence of 2.1 per 1000 inhabitants. In addition to lipomas, at least three other maladies of the adipose tissue lead patients to consult a doctor, especially for aesthetic purposes: multiple familial lipomatosis, diffuse congenital lipomatosis, and adiposa doloris. Unlike lipomas, these maladies are characterized by numerous lipomas, encapsulated or not, of different sizes, symmetrical or not, which may appear in the neck, limbs, or the trunk, sometimes being painful. The life quality of these patients is affected, not only from an aesthetic point of view but also from medical considerations, like pain. Chemical lipolysis has proven unsatisfactory for patients due to several reasons: the prolonged therapy, high cost, the partial dissolution of the lipomatosis, and high recurrence at one year. Surgical treatment remains the only viable option; sometimes when numerous lipomatous tumors required large and numerous incisions, treatment was refused by patients. The result after laser liposuction is excellent, the recovery time is short, without much pain for the patient, with minimal ecchymoses and edemas, without any recurrence in time, and with an excellent degree of patient satisfaction

    Enabling error-resilient internet broadcasting using motion compensated spatial partitioning and packet FEC for the dirac video codec

    Get PDF
    Video transmission over the wireless or wired network require protection from channel errors since compressed video bitstreams are very sensitive to transmission errors because of the use of predictive coding and variable length coding. In this paper, a simple, low complexity and patent free error-resilient coding is proposed. It is based upon the idea of using spatial partitioning on the motion compensated residual frame without employing the transform coefficient coding. The proposed scheme is intended for open source Dirac video codec in order to enable the codec to be used for Internet broadcasting. By partitioning the wavelet transform coefficients of the motion compensated residual frame into groups and independently processing each group using arithmetic coding and Forward Error Correction (FEC), robustness to transmission errors over the packet erasure wired network could be achieved. Using the Rate Compatibles Punctured Code (RCPC) and Turbo Code (TC) as the FEC, the proposed technique provides gracefully decreasing perceptual quality over packet loss rates up to 30%. The PSNR performance is much better when compared with the conventional data partitioning only methods. Simulation results show that the use of multiple partitioning of wavelet coefficient in Dirac can achieve up to 8 dB PSNR gain over its existing un-partitioned method

    Error-resilient performance of Dirac video codec over packet-erasure channel

    Get PDF
    Video transmission over the wireless or wired network requires error-resilient mechanism since compressed video bitstreams are sensitive to transmission errors because of the use of predictive coding and variable length coding. This paper investigates the performance of a simple and low complexity error-resilient coding scheme which combines source and channel coding to protect compressed bitstream of wavelet-based Dirac video codec in the packet-erasure channel. By partitioning the wavelet transform coefficients of the motion-compensated residual frame into groups and independently processing each group using arithmetic and Forward Error Correction (FEC) coding, Dirac could achieves the robustness to transmission errors by giving the video quality which is gracefully decreasing over a range of packet loss rates up to 30% when compared with conventional FEC only methods. Simulation results also show that the proposed scheme using multiple partitions can achieve up to 10 dB PSNR gain over its existing un-partitioned format. This paper also investigates the error-resilient performance of the proposed scheme in comparison with H.264 over packet-erasure channel

    Disparate Impact: Social Security and African Americans

    Get PDF
    Perhaps no group has as much at stake in the debate over Social Security reform as do African Americans. Elderly African Americans are much more likely than their white counterparts to be dependent on Social Security benefits for most or all of their retirement income, yet the current system often works to their disadvantage. Despite a progressive benefit structure, Social Security benefits are inadequate to provide for the retirement needs of the elderly poor, leaving nearly 30 percent of African-American seniors in poverty. Moreover, because African Americans generally have shorter life expectancies than do whites, they receive less total Social Security payments over the course of their lifetimes. Social Security also contributes to the growing wealth gap between blacks and whites. Because Social Security taxes squeeze out other forms of saving and investment, especially for low-income workers, many African Americans are unable to accumulate real wealth. And, since Social Security benefits are not inheritable, that wealth inequity is compounded from generation to generation. Traditional Social Security reforms such as raising the retirement age, cutting benefits, or increasing taxes would only make the problem worse. On the other hand, African Americans would be among those with the most to gain from the privatization of Social Security--transforming the program into a system of individually owned, privately invested accounts
    corecore