In an era of increasing data cap constraints, optimizing video streaming quality while adhering to user-defined data caps remains a significant challenge. This paper introduces Bitrate-Adaptive Limit-Aware Netcast Content Enhancement (BALANCE), a novel Quantum framework aimed at addressing this issue. BALANCE intelligently pre-selects video segments based on visual complexity and anticipated data consumption, utilizing the Video Multimethod Assessment Fusion (VMAF) metric to enhance Quality of Experience (QoE). We compare our method against traditional bitrate ladders used in Adaptive Bitrate (ABR) streaming, demonstrating a notable improvement in QoE under equivalent data constraints. We compare the Slack variable approach with the Dynamic Penalization Approach (DPA) by framing the bitrate allocation problem through Quadratic Unconstrained Binary Optimization (QUBO) to effectively enforce data limits. Our results indicate that the DPA consistently outperforms the Slack Variable Method, delivering more valid and optimal solutions as data limits increase. This new quantum approach significantly enhances streaming satisfaction for users with limited data plans.

MOTIVATION: Recently, gene-coexpression relationships have been found to be often conditional and dynamic. Many studies have suggested that single nucleotide polymorphisms (SNPs) have impacts on gene expression variations in human populations. RESULTS: The SNPxGE(2) database contains the computationally predicted human SNP-coexpression associations, i.e. the differential coexpression between two genes is associated with the genotypes of an SNP. These data were generated from a large-scale association study that was based on the HapMap phase I data, which covered 269 individuals from 4 human populations, 556 873 SNPs and 15 000 gene expression profiles. In order to reduce the computational cost, the SNP-coexpression associations were assessed using gap/substitution models, proven to have a comparable power to logistic regression models. The results, at a false discovery rate (FDR) cutoff of 0.1, consisted of 44 769 and 50 792 SNP-coexpression associations based on single and pooled populations, respectively, and can be queried in the SNPxGE(2) database via either gene symbol or reference SNP ID. For each reported association, a detailed information page is provided. AVAILABILITY: http://lambchop.ads.uga.edu/snpxge2/index.php CONTACT: [email protected], [email protected].

We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-level human vision to estimate the perceptibility of local simplification operations in a view-dependent Multi-Triangulation structure. Our algorithm improves on prior perceptual simplification approaches by accounting for textured models and dynamic lighting effects. We also model more accurately the scale of visual changes resulting from simplification, using parametric texture deviation to bound the size (represented as spatial frequency) of features destroyed, created, or altered by simplifying the mesh. The resulting algorithm displays many desirable properties: it is view-dependent, sensitive to silhouettes, sensitive to underlying texture content, and sensitive to illumination (for example, preserving detail near highlight and shadow boundaries, while aggressively simplifying washed-out regions). Using a unified perceptual model to evaluate these effects automatically accounts for their relative importance and balances between them, overcoming the need for ad hoc or hand-tuned heuristics.

one pass per subpixel sample) through the hardware rendering pipeline.The resulting image is very high quality, but the performance degrades in proportion to the number of subpixel samples used by the filter function.This paper describes algorithms for accelerating antialiasing in 3D graphics through low-cost custom hardware.The rendering architecture employs a multiple-pass algorithm to perform front-to-back hidden surface removal and shading.Coverage mask evaluation is used to composite objects in 3D.The key advantage of this approach is that antialiasing requires no additional memory and decreases rendering performance by only 30-40% for typical images.The system is image partition based and is scalable to satisfy a wide range of performance and cost constraints.

We describe an interactive, immersive 3D system called Tracktur, which allows a viewer to track the development of a turbulent flow. Tracktur displays time-varying vortex structures extracted from a numerical flow simulation. The user navigates the space and probes the data within a windy 3D landscape. In order to sustain a constant frame rate, we enforce a fixed polygon budget on the geometry. In actual use by a fluid dynamicist, Tracktur has yielded new insights into the transition to turbulence of a laminar flow.

This paper describes algorithms for implementing accurate rendering of CSG and transparency in a hardware 3D accelerator. The algorithms are based on a hardware architecture which performs front-to-back Z-sorted shading; a multiple-pass algorithm which allows an unlimited number of Z-sorted object layers is also described. The multiple-pass algorithm has been combined with an image partitioning algorithm to improve efficiency, and to improve performance of the resulting hardware implementation.

article Free Access Share on A scalable hardware render accelerator using a modified scanline algorithm Authors: Michael Kelley Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014 Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014View Profile , Stephanie Winner Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014 Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014View Profile , Kirk Gould Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014 Apple Computer, Inc., 20525 Mariani Avenue, Cupertino, CA 95014View Profile Authors Info & Claims ACM SIGGRAPH Computer GraphicsVolume 26Issue 2July 1992 pp 241–248https://doi.org/10.1145/142920.134069Online:01 July 1992Publication History 22citation718DownloadsMetricsTotal Citations22Total Downloads718Last 12 Months16Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF