VoroCrust: Voronoi Meshing Without Clipping

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.Comment: 18 pages (including appendix), 18 figures. Version without compressed images available on https://www.dropbox.com/s/qc6sot1gaujundy/VoroCrust.pdf. Supplemental materials available on https://www.dropbox.com/s/6p72h1e2ivw6kj3/VoroCrust_supplemental_materials.pd

HardIDX: Practical and Secure Index with SGX

Software-based approaches for search over encrypted data are still either challenged by lack of proper, low-leakage encryption or slow performance. Existing hardware-based approaches do not scale well due to hardware limitations and software designs that are not specifically tailored to the hardware architecture, and are rarely well analyzed for their security (e.g., the impact of side channels). Additionally, existing hardware-based solutions often have a large code footprint in the trusted environment susceptible to software compromises. In this paper we present HardIDX: a hardware-based approach, leveraging Intel's SGX, for search over encrypted data. It implements only the security critical core, i.e., the search functionality, in the trusted environment and resorts to untrusted software for the remainder. HardIDX is deployable as a highly performant encrypted database index: it is logarithmic in the size of the index and searches are performed within a few milliseconds rather than seconds. We formally model and prove the security of our scheme showing that its leakage is equivalent to the best known searchable encryption schemes. Our implementation has a very small code and memory footprint yet still scales to virtually unlimited search index sizes, i.e., size is limited only by the general - non-secure - hardware resources

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-linear time solutions as well as upper bounds. Using various computational tools, we get solutions within considerably less than 1% of the optimum. An interesting feature of our approach is that, even though an FWP is hard to compute in theory and Edmonds' algorithm for maximum weighted matching yields a polynomial solution for the MWMP, the practical behavior is just the opposite, and we can solve the FWP with high accuracy in order to find a good heuristic solution for the MWMP.Comment: 20 pages, 14 figures, Latex, to appear in Journal of Experimental Algorithms, 200

COPD patients hospitalized with exacerbations have greater cognitive impairment than patients hospitalized with decompensated heart failure

Purpose: People with COPD have cognitive dysfunction, which is greater in those hospitalized for exacerbations than in stable outpatients. We tested the hypothesis that cognitive dysfunction at exacerbation is a disease-specific feature of COPD, rather than a nonspecific feature of hospitalization for acute illness, by comparing cognition between patients hospitalized for acute COPD exacerbations and those with worsening heart failure (HF). Patients and methods: A total of 40 hospital inpatients were recruited, 20 patients with COPD exacerbations and 20 patients with congestive or left-sided HF. Exclusion criteria included previous stroke, known neurological disease, and marked alcohol excess. Participants completed the Montreal cognitive assessment (MoCA) and Hospital Anxiety and Depression Scale (HADS) and underwent spirometry and review of clinical records. Results: Age (mean±SD, COPD 73±10; HF 76±11 years), acute illness severity (Acute Physiology and Chronic Health Evaluation [APACHE]-II, COPD 15.4±3.5; HF 15.9±3.0), comorbidities (Charlson index, COPD 1.3±1.9; HF 1.6±1.5), and educational background were similar between COPD and HF groups. MoCA total was significantly lower in COPD than in HF (COPD 20.6±5.6; HF 24.8±3.5, P=0.007); however, significance was lost after correction for age, sex, and pack year smoking history. When compared with HF patients, the COPD cohort performed worse on the following domains of the MoCA: visuospatial function (median [IQR], COPD 0 [1]; HF 2 [1], P=0.003), executive function (COPD 2 [1]; HF 3 [1], P=0.035), and attention (COPD 4 [3]; HF 6 [2], P=0.020). Age (P=0.012) and random glucose concentration (P=0.041) were associated with cognitive function in whole group analysis, with pack year smoking history reaching borderline significance (P=0.050). Conclusion: Total MoCA score for COPD and HF indicated that both groups had mild cognitive impairment, although this was greater in people with COPD. Mechanisms underlying the observed cognitive dysfunction in COPD remain unclear but appear related to blood glucose concentrations and greater lifetime smoking load

The Relationship between Marital Status and Psychological Resilience in Chronic Pain

We examined the relationship between marital status and a 2-stage model of pain-related effect, consisting of pain unpleasantness and suffering. We studied 1914 chronic pain patients using multivariate analysis of covariance (MANCOVA) to clarify whether marital status was a determinant factor in the emotional or ideational suffering associated with chronic pain after controlling for pain sensation intensity, age, and ethnicity. Marital status was unrelated to immediate unpleasantness (). We found a strong association with emotional suffering () but not with negative illness beliefs (). Interestingly, widowed subjects experienced significantly less frustration, fear, and anger than all other groups (married, divorced, separated, or single). A final MANCOVA including sex as a covariate revealed that the emotional response to pain was the same for both widow and widower. Only those individuals whose spouse died experienced less emotional turmoil in the face of a condition threatening their lifestyle. These data suggest that after experiencing the death of a spouse, an individual may derive some “emotional inoculation” against future lifestyle threat

A combinatorial approach of comprehensive QTL-based comparative genome mapping and transcript profiling identified a seed weight-regulating candidate gene in chickpea

High experimental validation/genotyping success rate (94–96%) and intra-specific polymorphic potential (82–96%) of 1536 SNP and 472 SSR markers showing in silico polymorphism between desi ICC 4958 and kabuli ICC 12968 chickpea was obtained in a 190 mapping population (ICC 4958 × ICC 12968) and 92 diverse desi and kabuli genotypes. A high-density 2001 marker-based intra-specific genetic linkage map comprising of eight LGs constructed is comparatively much saturated (mean map-density: 0.94 cM) in contrast to existing intra-specific genetic maps in chickpea. Fifteen robust QTLs (PVE: 8.8–25.8% with LOD: 7.0–13.8) associated with pod and seed number/plant (PN and SN) and 100 seed weight (SW) were identified and mapped on 10 major genomic regions of eight LGs. One of 126.8 kb major genomic region harbouring a strong SW-associated robust QTL (Caq'SW1.1: 169.1–171.3 cM) has been delineated by integrating high-resolution QTL mapping with comprehensive marker-based comparative genome mapping and differential expression profiling. This identified one potential regulatory SNP (G/A) in the cis-acting element of candidate ERF (ethylene responsive factor) TF (transcription factor) gene governing seed weight in chickpea. The functionally relevant molecular tags identified have potential to be utilized for marker-assisted genetic improvement of chickpea

An approach to convert vertex-based 3D representations to combinatorial B-splines for real-time visual collaboration

Scientific Visualization and Virtual Reality are increasingly being used for the design of complex systems. These technologies offer powerful capabilities to make decisions that are cost and time effective. The next logical extension is to collaborate with these visual models in real-time, where parts of a design team are geographically separated. Specifically, visual collaboration enables ideas and proposed changes to be discussed exactly on a virtual model of a product. However, high-end visualization hardware and Internet technologies impede widespread use of real-time visual collaboration due to the large amount of data from which these representations are created. These data are typically in the form of 3D vertex-based models, which offer a high degree of realism when displayed, but at a price of storage, rendering speeds and processing efficiency. The more realistic the representation desired, the larger the number of vertices required and hence the higher the file size. In this paper, we propose a new data modeling and handling technique where traditional vertex-based models are converted into combinatorial B-Spline based wire-frame models that allow realtime visual collaboration in the context of typical virtual reality systems. Using appropriate filtering methods, parametric equations are computed for each curved segment in a vertexbased representation and bundled together with sampled linear segments of the model. The computed parametric equation based models occupy only a fraction of the size when compared to the original vertex-based models. These lightweight models can easily be transmitted over the Internet, in real-time, for viewing with a platform independent visual client program. The proposed methods were tested on several example data files to prove the method’s effectiveness