bluuebunny/crossref_metadata_2025_split huggingface dataset:
Safety and immunogenicity of a novel cold‐adapted modified‐live equine influenza virus vaccine
Authors: Tabynov K , Kydyrbayev Z , Ryskeldinova S , Assanzhanova N , Kozhamkulov Y , Inkarbekov D , Sansyzbay A 
Published: October 2014

ObjectiveTo design and evaluate the safety and immunogenicity of a modified‐live vaccine to prevent equine influenza virus (EIV) infection based on the novel reassortant cold‐adapted strain A/HK/Otar/6:2/2010.MethodsSurface proteins (HA,NA) from the wild‐type strain A/equine/Otar/764/2007 (H3N8) and internal proteins (PB2, PB1, PA, NP, M, NS) from the attenuated cold‐adapted donor strain A/HongKong/1/68/162/35CA (H3N2) were included in the vaccine. Horses were administered 109.2EID50/mL of the modified‐live vaccine or saline solution using a nasal spray. The clinical condition of the animals was assessed throughout the study and nasopharyngeal swabs were collected for virus titration. Two yearlings in each group were euthanased on day 5 post vaccination (PV) for histological examination and measurement of viral titres in the organs.Serum samples and nasal secretions were collected to evaluate serological response. Lymphoproliferation after restimulation in vitro was determined to evaluate cell‐mediated immunity. To evaluate the protective capacity of the vaccine, the yearlings in both groups were challenged with the wild‐type virus at 28 days PV and their clinical condition and serological response was evaluated. Nasal swabs were collected to assess viral shedding from the upper respiratory tract.ResultsSingle intranasal administration of a modified‐liveEIVvaccine caused no adverse effects and vaccinated yearlings and pregnant mares did not form detectable levels of antibodies by days 7, 14 and 28 PV, as indicated by the HI reaction andELISA. Secretory antibodies could be detected on day 7 and reached maximal levels on day 14 PV. In vitro studies showed that the yearlings and pregnant mares both formed a cell‐mediated immune response by day 14 PV. The vaccine protected yearlings against challenge with wild‐type virus. We conclude that single intranasal administration of the modified‐liveEIVvaccine was safe in the yearlings and pregnant mares that we treated, and was immunogenic and protective in the yearlings.
Anthelmintic resistance in ovine gastrointestinal nematodes in inland southern Queensland
Authors: Lyndal‐Murphy M , Ehrlich WK , Mayer DG 
Published: October 2014

ObjectiveTo establish the prevalence of anthelmintic resistance in ovine gastrointestinal nematodes in southern Queensland.DesignAn observational parasitological study using the faecal egg count reduction test.MethodsSheep farms (n = 20) enrolled in this study met the twin criteria of using worm testing for drench decisions and having concerns about anthelmintic efficacy. On each farm, 105 sheep were randomly allocated to one of six treatment groups or an untreated control group. Faecal samples were collected on day 0 and days 10–14 for worm egg counts and larval differentiation. Single‐ and multi‐combination anthelmintics, persistent and non‐persistent, oral liquid or capsule, pour‐on and injectable formulations were tested. Monepantel was not tested. Farmers also responded to a questionnaire on drenching practices.ResultsHaemonchus contortus was the predominant species. Efficacy <95% was recorded on 85% of farms for one or more anthelmintics and on 10% of farms for six anthelmintics. No resistance was identified on three farms. The 4‐way combination product was efficacious (n = 4 farms). Napthalophos resistance was detected on one farm only. Resistance to levamisole (42% of farms), moxidectin injection (50% of farms) and the closantel/abamectin combination (67% of farms) was identified. Moxidectin oral was efficacious against Trichostrongylus colubriformis, which was predominant on only one farm. Of the farms tested, 55% ran meat breeds, 60% dosed more than the recommended dose rate and 70% always, mostly or when possible practised a ‘drench and move’ strategy.ConclusionThis level of anthelmintic resistance in southern Queensland will severely compromise worm control and force increased use of monepantel.
Mucus as a Barrier to Drug Delivery – Understanding and Mimicking the Barrier Properties
Authors: Boegh Marie , Nielsen Hanne Mørck 
Published: October 2014

AbstractViscoelastic mucus lines all mucosal surfaces of the body and forms a potential barrier to mucosal drug delivery. Mucus is mainly composed of water and mucins; high molecular weight glycoproteins forming an entangled network. Consequently, mucus forms a steric barrier, and due to its negative charge and hydrophobic domains, the overall hydrophilic mucus also presents an interactive barrier limiting the free diffusion of components within and through the mucus. Furthermore, mucus is a dynamic barrier due to its continuous secretion and shedding from the mucosal surfaces. Mucus is thus a highly complex gel barrier to drug delivery. Current knowledge of mucus characteristics and barrier properties, as achieved by state‐of‐the‐art methodologies, is the topic of this MiniReview emphasizing the gastrointestinal mucus and an overall focus on oral drug delivery. Cell culture‐based in vitro models are well‐established as essential tools in drug research and development, but traditionally, mucus‐containing models have only rarely been applied. However, a number of mucus‐containing in vitro models have recently been described in the literature, and their properties and applications will be reviewed and discussed. Finally, studies of peptide and protein drug diffusion in and through mucus and studies of mucus‐penetrating nanoparticles are included to illustrate the mucus as a potentially important barrier to obtain sufficient bioavailability of orally administered drugs, and thus an important parameter to address in the development of future oral drug delivery systems.
Quantitative T cell subsets profile in peripheral blood from patients with idiopathic inflammatory myopathies: tilting the balance towards proinflammatory and pro-apoptotic subsets
Authors: Espinosa-Ortega F , Gómez-Martin D , Santana-De Anda K , Romo-Tena J , Villaseñor-Ovies P , Alcocer-Varela J 
Published: October 2014

SummaryThe role of T cells in idiopathic inflammatory myopathies (IIM) is not yet clear. Some alterations in certain subsets have been reported in inflamed muscle cells. However, a broad quantitative assessment of peripheral T cell subsets has not been evaluated. The aim of this study was to address the quantitative profile of potential pathogenic T cell subsets, namely follicular helper T cells (Tfh), T helper type 17 (Th17), CD28null and regulatory T cells (Tregs) in peripheral blood from IIM patients. Thirty IIM patients and 30 age- and gender-matched healthy donors were included. Peripheral blood mononuclear cells were isolated. T cell subsets were evaluated by flow cytometry, as follows: Tfh (CD4+ CXCR5+) and its subsets Tfh1 (CXCR3+ CCR6−), Tfh2 (CXCR3− CCR6−), Tfh17 (CXCR3− CCR6+), Th17 (CD4+ IL17A+), CD28null (CD4+ CD28− CD244+) and Tregs (CD4+ CD25high forkhead box protein 3 (FoxP3+); CD8+ CD25high FoxP3+). Percentage, absolute numbers and mean fluorescence intensity were analysed. We found increased numbers of total Tfh cells (28 ± 8·16 versus 6·64 ± 1·29, P = 0·031) in IIM patients when compared to healthy controls. Moreover, this increment was dependent upon Tfh2 and Tfh17 (Tfh2:9·49 ± 2·19 versus 1·66 ± 0·46, P = 0·005; Tfh17 9·48 ± 2·83 versus 1·18 ± 0·21, P = 0·014). Also, IIM patients showed higher numbers of Th17 cells (30·25 ± 6·49 versus 13·46 ± 2·95, P = 0·031) as well as decreased number of Tregs (5·98 ± 1·61 versus 30·82 ± 8·38, P = 0·009). We also found an expansion of CD28null cells (162·88 ± 32·29 versus 64 ± 17·35, P = 0·015). Our data suggest that IIM patients are characterized by an expansion of peripheral proinflammatory T cells, such as Tfh and Th17, as well as pro-apoptotic CD28 null cells and a deficiency of suppressor populations of Tregs (CD4+ and CD8+).
Data‐Driven Reconstruction of Human Locomotion Using a Single Smartphone
Authors: Eom Haegwang , Choi Byungkuk , Noh Junyong 
Published: October 2014

AbstractGenerating a visually appealing human motion sequence using low‐dimensional control signals is a major line of study in the motion research area in computer graphics. We propose a novel approach that allows us to reconstruct full body human locomotion using a single inertial sensing device, a smartphone. Smartphones are among the most widely used devices and incorporate inertial sensors such as an accelerometer and a gyroscope. To find a mapping between a full body pose and smartphone sensor data, we perform low dimensional embedding of full body motion capture data, based on a Gaussian Process Latent Variable Model. Our system ensures temporal coherence between the reconstructed poses by using a state decomposition model for automatic phase segmentation. Finally, application of the proposed nonlinear regression algorithm finds a proper mapping between the latent space and the sensor data. Our framework effectively reconstructs plausible 3D locomotion sequences. We compare the generated animation to ground truth data obtained using a commercial motion capture system.
A Data‐Driven Framework for Visual Crowd Analysis
Authors: Charalambous Panayiotis , Karamouzas Ioannis , Guy Stephen J. , Chrysanthou Yiorgos 
Published: October 2014

AbstractWe present a novel approach for analyzing the quality of multi‐agent crowd simulation algorithms. Our approach is data‐driven, taking as input a set of user‐defined metrics and reference training data, either synthetic or from video footage of real crowds. Given a simulation, we formulate the crowd analysis problem as an anomaly detection problem and exploit state‐of‐the‐art outlier detection algorithms to address it. To that end, we introduce a new framework for the visual analysis of crowd simulations. Our framework allows us to capture potentially erroneous behaviors on a per‐agent basis either by automatically detecting outliers based on individual evaluation metrics or by accounting for multiple evaluation criteria in a principled fashion using Principle Component Analysis and the notion of Pareto Optimality. We discuss optimizations necessary to allow real‐time performance on large datasets and demonstrate the applicability of our framework through the analysis of simulations created by several widely‐used methods, including a simulation from a commercial game.
Sub‐Pixel Anti‐Aliasing Via Triangle‐Based Geometry Reconstruction
Authors: Du Wenjun , Feng Jieqing , Yang Baoguang 
Published: October 2014

AbstractAnti‐aliasing has recently been employed as a post‐processing step to adapt to the deferred shading technique in real‐time applications. Some of these existing algorithms store supersampling geometric information as geometric buffer (G‐buffer) to detect and alleviate sub‐pixel‐level aliasing artifacts. However, the anti‐aliasing filter based on sampled sub‐pixel geometries only may introduce unfaithful shading information to the sub‐pixel color in uniform‐geometry regions, and large G‐buffer will increase memory storage and fetch overheads. In this paper, we present a new Triangle‐based Geometry Anti‐Aliasing (TGAA) algorithm, to address these problems. The coverage triangle of each screen pixel is accessed, and then, the coverage information between the triangle and neighboring sub‐pixels is stored in a screen‐resolution bitmask, which allows the geometric information to be stored and accessed in an inexpensive manner. Using triangle‐based geometry, TGAA can exclude irrelevant neighboring shading samples and achieve faithful anti‐aliasing filtering. In addition, a morphological method of estimating the geometric edges in high‐frequency geometry is incorporated into the TGAA's anti‐aliasing filter to complement the algorithm. The implementation results demonstrate that the algorithm is efficient and scalable for generating high‐quality anti‐aliased images.
Approximate Symmetry Detection in Partial 3D Meshes
Authors: Sipiran Ivan , Gregor Robert , Schreck Tobias 
Published: October 2014

AbstractSymmetry is a common characteristic in natural and man‐made objects. Its ubiquitous nature can be exploited to facilitate the analysis and processing of computational representations of real objects. In particular, in computer graphics, the detection of symmetries in 3D geometry has enabled a number of applications in modeling and reconstruction. However, the problem of symmetry detection in incomplete geometry remains a challenging task. In this paper, we propose a vote‐based approach to detect symmetry in 3D shapes, with special interest in models with large missing parts. Our algorithm generates a set of candidate symmetries by matching local maxima of a surface function based on the heat diffusion in local domains, which guarantee robustness to missing data. In order to deal with local perturbations, we propose a multi‐scale surface function that is useful to select a set of distinctive points over which the approximate symmetries are defined. In addition, we introduce a vote‐based scheme that is aware of the partiality, and therefore reduces the number of false positive votes for the candidate symmetries. We show the effectiveness of our method in a varied set of 3D shapes and different levels of partiality. Furthermore, we show the applicability of our algorithm in the repair and completion of challenging reassembled objects in the context of cultural heritage.
G2 Surface Interpolation Over General Topology Curve Networks
Authors: Salvi Péter , Várady Tamás 
Published: October 2014

AbstractThe basic idea of curve network‐based design is to construct smoothly connected surface patches, that interpolate boundaries and cross‐derivatives extracted from the curve network. While the majority of applications demands only tangent plane (G1) continuity between the adjacent patches, curvature continuous connections (G2) may also be required. Examples include special curve network configurations with supplemented internal edges, “master‐slave” curvature constraints, and general topology surface approximations over meshes.The first step is to assign optimal surface curvatures to the nodes of the curve network; we discuss different optimization procedures for various types of nodes. Then interpolant surfaces called parabolic ribbons are created along the patch boundaries, which carry first and second derivative constraints. Our construction guarantees that the neighboring ribbons, and thus the respective transfinite patches, will be G2 continuous. We extend Gregory's multi‐sided surface scheme in order to handle parabolic ribbons, involving the blending functions, and a new sweepline parameterization. A few simple examples conclude the paper.
Polyline‐sourced Geodesic Voronoi Diagrams on Triangle Meshes
Authors: Xu Chunxu , Liu Yong‐Jin , Sun Qian , Li Jinyan , He Ying 
Published: October 2014

AbstractThis paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm.
Incompressible SPH using the Divergence‐Free Condition
Authors: Kang Nahyup , Sagong Donghoon 
Published: October 2014

AbstractIn this paper, we present a novel SPH framework to simulate incompressible fluid that satisfies both the divergence‐ free condition and the density‐invariant condition. In our framework, the two conditions are applied separately. First, the divergence‐free condition is enforced when solving the momentum equation. Later, the density‐invariant condition is applied after the time integration of the particle positions. Our framework is a purely Lagrangian approach so that no auxiliary grid is required. Compared to the previous density‐invariant based SPH methods, the proposed method is more accurate due to the explicit satisfaction of the divergence‐free condition. We also propose a modified boundary particle method for handling the free‐slip condition. In addition, two simple but effective methods are proposed to reduce the particle clumping artifact induced by the density‐invariant condition.
Real‐Time Symmetry‐Preserving Deformation
Authors: Wu Xiaokun , Wand Michael , Hildebrandt Klaus , Kohli Pushmeet , Seidel Hans‐Peter 
Published: October 2014

AbstractIn this paper, we address the problem of structure‐aware shape deformation: We specifically consider deformations that preserve symmetries of the shape being edited. While this is an elegant approach for obtaining plausible shape variations from minimal assumptions, a straightforward optimization is numerically expensive and poorly conditioned. Our paper introduces an explicit construction of bases of linear spaces of shape deformations that exactly preserve symmetries for any user‐defined level of detail. This permits the construction of low‐dimensional spaces of low‐frequency deformations that preserve the symmetries. We obtain substantial speed‐ups over alternative approaches for symmetry‐preserving shape editing due to (i) the sub‐space approach, which permits low‐res editing, (ii) the removal of redundant, symmetric information, and (iii) the simplification of the numerical formulation due to hard‐coded symmetry preservation. We demonstrate the utility in practice by applying our framework to symmetry‐preserving co‐rotated iterative Laplace surface editing of models with complex symmetry structure, including partial and nested symmetry.
Efficient Depth Propagation for Constructing a Layered Depth Image from a Single Image
Authors: Iizuka S. , Endo Y. , Kanamori Y. , Mitani J. , Fukui Y. 
Published: October 2014

AbstractIn this paper, we propose an interactive technique for constructing a 3D scene via sparse user inputs. We represent a 3D scene in the form of a Layered Depth Image (LDI) which is composed of a foreground layer and a background layer, and each layer has a corresponding texture and depth map. Given user‐specified sparse depth inputs, depth maps are computed based on superpixels using interpolation with geodesic‐distance weighting and an optimization framework. This computation is done immediately, which allows the user to edit the LDI interactively. Additionally, our technique automatically estimates depth and texture in occluded regions using the depth discontinuity. In our interface, the user paints strokes on the 3D model directly. The drawn strokes serve as 3D handles with which the user can pull out or push the 3D surface easily and intuitively with real‐time feedback. We show our technique enables efficient modeling of LDI that produce sufficient 3D effects.
Perceptually‐based Color Assignment
Authors: Kim Hye‐Rin , Yoo Min‐Joon , Kang Henry , Lee In‐Kwon 
Published: October 2014

AbstractColor assignment is a complex task of incorporating and balancing area configuration, color harmony, and user's intent. In this paper, we present a novel method for automatic color assignment based on theories of color perception. We define color assignment as an optimization problem with respect to the color relationships as well as the spatial configuration of input segments. We also suggest possible constraints that are suitable for task‐specific purposes and for enhancing visual appeal. Our colorization scheme is useful in many applications such as infographics, computer‐aided design, and visual presentation. The user study shows that our method generates perceptually pleasing results over a variety of data sets.
Single‐shot High Dynamic Range Imaging Using Coded Electronic Shutter
Authors: Cho Hojin , Kim Seon Joo , Lee Seungyong 
Published: October 2014

AbstractTypical high dynamic range (HDR) imaging approaches based on multiple images have difficulties in handling moving objects and camera shakes, suffering from the ghosting effect and the loss of sharpness in the output HDR image. While there exist a variety of solutions for resolving such limitations, most of the existing algorithms are susceptible to complex motions, saturation, and occlusions. In this paper, we propose an HDR imaging approach using the coded electronic shutter which can capture a scene with row‐wise varying exposures in a single image. Our approach enables a direct extension of the dynamic range of the captured image without using multiple images, by photometrically calibrating rows with different exposures. Due to the concurrent capture of multiple exposures, misalignments of moving objects are naturally avoided with significant reduction in the ghosting effect. To handle the issues with under‐/over‐exposure, noise, and blurs, we present a coherent HDR imaging process where the problems are resolved one by one at each step. Experimental results with real photographs, captured using a coded electronic shutter, demonstrate that our method produces a high quality HDR images without the ghosting and blur artifacts.
Time‐Lapse Photometric Stereo and Applications
Authors: Shen Fangyang , Sunkavalli Kalyan , Bonneel Nicolas , Rusinkiewicz Szymon , Pfister Hanspeter , Tong Xin 
Published: October 2014

AbstractThis paper presents a technique to recover geometry from time‐lapse sequences of outdoor scenes. We build upon photometric stereo techniques to recover approximate shadowing, shading and normal components allowing us to alter the material and normals of the scene. Previous work in analyzing such images has faced two fundamental difficulties: 1. the illumination in outdoor images consists of time‐varying sunlight and skylight, and 2. the motion of the sun is restricted to a near‐planar arc through the sky, making surface normal recovery unstable. We develop methods to estimate the reflection component due to skylight illumination. We also show that sunlight directions are usually non‐planar, thus making surface normal recovery possible. This allows us to estimate approximate surface normals for outdoor scenes using a single day of data. We demonstrate the use of these surface normals for a number of image editing applications including reflectance, lighting, and normal editing.
Seamless, Static Multi‐Texturing of 3D Meshes
Authors: Pagés R. , Berjón D. , Morán F. , García N. 
Published: October 2014

AbstractIn the context of 3D reconstruction, we present a static multi‐texturing system yielding a seamless texture atlas calculated by combining the colour information from several photos from the same subject covering most of its surface. These pictures can be provided by shooting just one camera several times when reconstructing a static object, or a set of synchronized cameras, when dealing with a human or any other moving object. We suppress the colour seams due to image misalignments and irregular lighting conditions that multi‐texturing approaches typically suffer from, while minimizing the blurring effect introduced by colour blending techniques. Our system is robust enough to compensate for the almost inevitable inaccuracies of 3D meshes obtained with visual hull–based techniques: errors in silhouette segmentation, inherently bad handling of concavities, etc.